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
[1]
Hilfe
Suche: Series=LNCS AND Volume=1853
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Resource augmentation for online bounded space bin packing
János Csirik
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
1853
, 2000, pp. 296-304
Optimal projective algorithms for the list update problem
Christoph Ambühl
,
Bernd Gärtner
,
Bernhard von Stengel
Lecture Notes in Computer Science
1853
, 2000, pp. 305-316
Efficient verification algorithms for one-counter processes
Antonín Kuc̑era
Lecture Notes in Computer Science
1853
, 2000, pp. 317-328
On the complexity of bisimulation problems for basic parallel processes
Richard Mayr
Lecture Notes in Computer Science
1853
, 2000, pp. 329-341
Decidable first-order transition logics for
PA
-processes
Denis Lugiez
,
Philippe Schnoebelen
Lecture Notes in Computer Science
1853
, 2000, pp. 342-353
Non interference for the analysis of cryptographic protocols
Riccardo Focardi
,
Roberto Gorrieri
,
Fabio Martinelli
Lecture Notes in Computer Science
1853
, 2000, pp. 354-372
Average bit-complexity of Euclidean algorithms
Ali Akhavi
,
Brigitte Vallée
Lecture Notes in Computer Science
1853
, 2000, pp. 373-387
Planar maps and Airy phenomena
Cyril Banderier
,
Philippe Flajolet
,
Gilles Schaeffer
,
Michèle Soria
Lecture Notes in Computer Science
1853
, 2000, pp. 388-402
Analysing input/output-capabilities of mobile processes with a generic type system
Barbara König
Lecture Notes in Computer Science
1853
, 2000, pp. 403-414
Information flow vs. resource access in the asynchronous Pi-calculus
Matthew Hennessy
,
James Riely
Lecture Notes in Computer Science
1853
, 2000, pp. 415-427
The genomics revolution and its challenges for algorithmic research
Richard M. Karp
Lecture Notes in Computer Science
1853
, 2000, pp. 428-428
Alternating the temporal picture for safety
Zohar Manna
,
Henny B. Sipma
Lecture Notes in Computer Science
1853
, 2000, pp. 429-450
Neccessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all
NP
relations
Alfredo de Santis
,
Giovanni di Crescenzo
,
Giuseppe Persiano
Lecture Notes in Computer Science
1853
, 2000, pp. 451-462
Fast verification of any remote procedure call: Short witness-indistinguishable one-round proofs for
NP
William Aiello
,
Sandeep Bhatt
,
Rafail Ostrovsky
,
S.Raj. Rajagopalan
Lecture Notes in Computer Science
1853
, 2000, pp. 463-474
A new unfolding approach to LTL model checking
Javier Esparza
,
Keijo Heljanko
Lecture Notes in Computer Science
1853
, 2000, pp. 475-486
Reasoning about message passing in finite state environments
B. Meenakshi
,
R. Ramanujam
Lecture Notes in Computer Science
1853
, 2000, pp. 487-498
Extended notions of security for multicast public key cryptosystems
Olivier Baudron
,
David Pointcheval
,
Jacques Stern
Lecture Notes in Computer Science
1853
, 2000, pp. 499-511
One-round secure computation and secure autonomous mobile agents
Christian Cachin
,
Jan Camenisch
,
Joe Kilian
,
Joy Müller
Lecture Notes in Computer Science
1853
, 2000, pp. 512-523
Round-optimal and abuse-free optimistic multi-party contract signing
Birgit Baum-Waidner
,
Michael Waidner
Lecture Notes in Computer Science
1853
, 2000, pp. 524-535
On the centralizer of a finite set
Juhani Karhumäki
,
Ion Petre
Lecture Notes in Computer Science
1853
, 2000, pp. 536-546
On the power of tree-walking automata
Frank Neven
,
Thomas Schwentick
Lecture Notes in Computer Science
1853
, 2000, pp. 547-560
Determinization of transducers over infinite words
Marie-Pierre Béal
,
Olivier Carton
Lecture Notes in Computer Science
1853
, 2000, pp. 561-570
Constraint programming and graph algorithms
Kurt Mehlhorn
Lecture Notes in Computer Science
1853
, 2000, pp. 571-575
Scalable secure storage when half the system is faulty
Noga Alon
,
Haim Kaplan
,
Michael Krivelevich
,
Dahlia Malkhi
,
Julien Stern
Lecture Notes in Computer Science
1853
, 2000, pp. 576-587
Generating partial and multiple transversals of a hypergraph
Endre Boros
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
Lecture Notes in Computer Science
1853
, 2000, pp. 588-599
Seiten
<
1
2
3
4
>