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
[2]
Hilfe
Suche: Series=LNCS AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
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
Determinization of transducers over infinite words
Marie-Pierre Béal
,
Olivier Carton
Lecture Notes in Computer Science
1853
, 2000, pp. 561-570
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
Revisiting the correspondence between cut elimination and normalisation
José Espírito Santo
Lecture Notes in Computer Science
1853
, 2000, pp. 600-611
Strong inapproximability of the basic
k
-spanner problem
Michael Elkin
,
David Peleg
Lecture Notes in Computer Science
1853
, 2000, pp. 636-647
Deterministic radio broadcasting
Bogdan S. Chlebus
,
Leszek Ga̧sieniec
,
Anna Östlin
,
John Michael Robson
Lecture Notes in Computer Science
1853
, 2000, pp. 717-728
A complete axiomatization for observational congruence of prioritized finite-state behaviors
Mario Bravetti
,
Roberto Gorrieri
Lecture Notes in Computer Science
1853
, 2000, pp. 744-755
Tight size bounds for packet headers in narrow meshes
Micah Adler
,
Faith Fich
,
Leslie Ann Goldberg
,
Mike Paterson
Lecture Notes in Computer Science
1853
, 2000, pp. 756-767
On the logical characterisation of performability properties
Christel Baier
,
Boudewijn Haverkort
,
Holger Hermanns
,
Joost-Pieter Katoen
Lecture Notes in Computer Science
1853
, 2000, pp. 780-792
On the representation of timed polyhedra
Olivier Bournez
,
Oded Maler
Lecture Notes in Computer Science
1853
, 2000, pp. 793-807
Min-wise independent permutations: Theory and practice
Andrei Z. Broder
Lecture Notes in Computer Science
1853
, 2000, pp. 808-808
Testing acyclicity of directed graphs in sublinear time
Michael A. Bender
,
Dana Ron
Lecture Notes in Computer Science
1853
, 2000, pp. 809-820
Computing the girth of a planar graph
Hristo N. Djidjev
Lecture Notes in Computer Science
1853
, 2000, pp. 821-831
Unlearning helps
Ganesh Baliga
,
John Case
,
Wolfgang Merkle
,
Frank Stephan
Lecture Notes in Computer Science
1853
, 2000, pp. 844-855
Fast approximation schemes for Euclidean multi-connectivity problems
Artur Czumaj
,
Andrzej Lingas
Lecture Notes in Computer Science
1853
, 2000, pp. 856-868
Homogenization and the polynomial calculus
Josh Buresh-Oppenheim
,
Toniann Pitassi
,
Matt Clegg
,
Russell Impagliazzo
Lecture Notes in Computer Science
1853
, 2000, pp. 926-937
Coping with the
NP
-hardness of the graph bandwidth problem
Uriel Feige
Lecture Notes in Computer Science
1851
, 2000, pp. 10-19
Maintaining center and median in dynamic trees
Stephen Alstrup
,
Jacob Holm
,
Mikkel Thorup
Lecture Notes in Computer Science
1851
, 2000, pp. 46-56
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>