Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND Volume=1443
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The regular real-time languages
T.A. Henzinger
,
J.-F. Raskin
,
P.-Y. Schobbens
Lecture Notes in Computer Science
1443
, 1998, pp. 580-591
Static and dynamic low-congested interval routing schemes
Serafino Cicerone
,
Gabriele di Stefano
,
Michele Flammini
Lecture Notes in Computer Science
1443
, 1998, pp. 592-603
Low-bandwidth routing and electrical power networks
Doug Cook
,
Vance Faber
,
Madhav Marathe
,
Aravind Srinivasan
,
Yoram J. Sussmann
Lecture Notes in Computer Science
1443
, 1998, pp. 604-615
Constraint automata and the complexity of recursive subtype entailment
Fritz Henglein
,
Jakob Rehof
Lecture Notes in Computer Science
1443
, 1998, pp. 616-627
Reasoning about the past with two-way automata
Moshe Y. Vardi
Lecture Notes in Computer Science
1443
, 1998, pp. 628-641
A neuroidal architecture for cognitive computation
Leslie G. Valiant
Lecture Notes in Computer Science
1443
, 1998, pp. 642-669
Deterministic polylog approximation for minimum communication spanning trees
David Peleg
,
Eilon Reshef
Lecture Notes in Computer Science
1443
, 1998, pp. 670-681
A polynomial time approximation scheme for Euclidean minimum cost
k
-connectivity
Artur Czumaj
,
Andrzej Lingas
Lecture Notes in Computer Science
1443
, 1998, pp. 682-694
Global/local subtyping and capability inference for a distributed
\pi
-calculus
Peter Sewell
Lecture Notes in Computer Science
1443
, 1998, pp. 695-706
Checking strong/weak bisimulation equivalences and observation congruence for the
\pi
-calculus
Zhoujun Li
,
Huowang Chen
Lecture Notes in Computer Science
1443
, 1998, pp. 707-718
Inversion of circulant matrices over
Z_m
Dario Bini
,
Gianna M. del Corso
,
Giovanni Manzini
,
Luciano Margara
Lecture Notes in Computer Science
1443
, 1998, pp. 719-730
Application of Lempel-Ziv encodings to the solution of word equations
Wojciech Plandowski
,
Wojciech Rytter
Lecture Notes in Computer Science
1443
, 1998, pp. 731-742
Explicit substitutions for constructive necessity
Neil Ghani
,
Valeria de Paiva
,
Eike Ritter
Lecture Notes in Computer Science
1443
, 1998, pp. 743-754
The relevance of proof-irrelevance
Gilles Barthe
Lecture Notes in Computer Science
1443
, 1998, pp. 755-768
New horizons in quantum information processing
Gilles Brassard
Lecture Notes in Computer Science
1443
, 1998, pp. 769-771
Sequential iteration of interactive arguments and an efficient zero-knowledge argument for
NP
Ivan Damgård
,
Birgit Pfitzmann
Lecture Notes in Computer Science
1443
, 1998, pp. 772-783
Image density is complete for Non-Interactive-SZK
A. de Santis
,
G. di Crescenzo
,
G. Persiano
,
M. Yung
Lecture Notes in Computer Science
1443
, 1998, pp. 784-795
Randomness spaces
Peter Hertling
,
Klaus Weihrauch
Lecture Notes in Computer Science
1443
, 1998, pp. 796-807
Totality, definability and Boolean circuits
Antonio Bucciarelli
,
Ivano Salvo
Lecture Notes in Computer Science
1443
, 1998, pp. 808-819
Quantum counting
Gilles Brassard
,
Peter Hyer
,
Alain Tapp
Lecture Notes in Computer Science
1443
, 1998, pp. 820-831
On the complexity of deriving score functions from examples for problems in molecular biology
Tatsuya Akutsu
,
Mutsunori Yagiura
Lecture Notes in Computer Science
1443
, 1998, pp. 832-843
A hierarchy of equivalences for asynchronous calculi
Cédric Fournet
,
Georges Gonthier
Lecture Notes in Computer Science
1443
, 1998, pp. 844-855
On asynchrony in name-passing calculi
Massimo Merro
,
Davide Sangiorgi
Lecture Notes in Computer Science
1443
, 1998, pp. 856-867
Protection in programming-language translations
Martín Abadi
Lecture Notes in Computer Science
1443
, 1998, pp. 868-883
Efficient simulations by queue machines
Holger Petersen
,
John Michael Robson
Lecture Notes in Computer Science
1443
, 1998, pp. 884-895
Seiten
<
1
2
3
4
>