Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1518

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Disjoint paths in expander graphs via random walks: A short survey
Alan M. Frieze
Lecture Notes in Computer Science 1518, 1998, pp. 1-14
A derandomization using min-wise independent permutations
Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
Lecture Notes in Computer Science 1518, 1998, pp. 15-24
An algorithmic embedding of graphs via perfect matchings
Vojtech Rödl, Andrzej Ruciński, Michelle Wagner
Lecture Notes in Computer Science 1518, 1998, pp. 25-34
Deterministic hypergraph coloring and its applications
Chi-Jen Lu
Lecture Notes in Computer Science 1518, 1998, pp. 35-46
On the derandomization of space-bounded computations
Roy Armoni
Lecture Notes in Computer Science 1518, 1998, pp. 47-59
Talagrand's inequality and locality in distributed computing
Devdatt P. Dubhashi
Lecture Notes in Computer Science 1518, 1998, pp. 60-70
On-line bin-stretching
Yossi Azar, Oded Regev
Lecture Notes in Computer Science 1518, 1998, pp. 71-81
Combinatorial linear programming: Geometry can help
Bernd Gärtner
Lecture Notes in Computer Science 1518, 1998, pp. 82-96
A note on bounding the mixing time by linear programming
Abraham Sharell
Lecture Notes in Computer Science 1518, 1998, pp. 97-115
Robotic exploration, Brownian motion and electrical resistance
Israel A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein
Lecture Notes in Computer Science 1518, 1998, pp. 116-130
Fringe analysis of synchronized parallel algorithms on 2-3 trees
Ricardo Baeza-Yates, Joaquim Gabarró, Xavier Messeguer
Lecture Notes in Computer Science 1518, 1998, pp. 131-144
On balls and bins with deletions
Richard Cole, Alan Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh Sitaraman, Eli Upfal
Lecture Notes in Computer Science 1518, 1998, pp. 145-158
``Balls into bins'' - A simple and tight analysis
Martin Raab, Angelika Steger
Lecture Notes in Computer Science 1518, 1998, pp. 159-170
Tornado codes: Practical erasure codes based on random irregular graphs
Michael Luby
Lecture Notes in Computer Science 1518, 1998, pp. 171-171
Using approximation hardness to achieve dependable computation
Mike Burmester, Yvo Desmedt, Yongge Wang
Lecture Notes in Computer Science 1518, 1998, pp. 172-186
Complexity of sequential pattern matching algorithms
Mireille Régnier, Wojciech Szpankowski
Lecture Notes in Computer Science 1518, 1998, pp. 187-199
A random server model for private information retrieval
Yael Gertner, Shafi Goldwasser, Tal Malkin
Lecture Notes in Computer Science 1518, 1998, pp. 200-217
Almost optimal (on the average) combinatorial algorithms for Boolean matrix product witnesses, computing the diameter
C.P. Schnorr, C.R. Subramanian
Lecture Notes in Computer Science 1518, 1998, pp. 218-231
Randomized lower bounds for online path coloring
Stefano Leonardi, Andrea Vitaletti
Lecture Notes in Computer Science 1518, 1998, pp. 232-247
Parallel random search and tabu search for the minimal consistent subset selection problem
Vicente Cerverón, Ariadna Fuertes
Lecture Notes in Computer Science 1518, 1998, pp. 248-259
On various cooling schedules for simulated annealing applied to the job shop problem
K. Steinhöfel, A. Albrecht, C.K. Wong
Lecture Notes in Computer Science 1518, 1998, pp. 260-279
A high performance approximate algorithm for the Steiner problem in graphs
Pere Guitart, Josep M. Basart
Lecture Notes in Computer Science 1518, 1998, pp. 280-293
Random geometric problems on [0,1]^2
Josep Díaz, Jordi Petit, Maria Serna
Lecture Notes in Computer Science 1518, 1998, pp. 294-306
A role of constraint in self-organization
Carlos Domingo, Osamu Watanabe, Tadashi Yamazaki
Lecture Notes in Computer Science 1518, 1998, pp. 307-318
Constructive bounds and exact expectations for the random assignment problem
Don Coppersmith, Gregory B. Sorkin
Lecture Notes in Computer Science 1518, 1998, pp. 319-330

Seiten 1 2 >