Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2076

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

Algorithms, games, and the Internet
Christos H. Papadimitriou
Lecture Notes in Computer Science 2076, 2001, pp. 1-3
Automata, circuits, and hybrids: Facets of continuous time
Boris A. Trakhtenbrot
Lecture Notes in Computer Science 2076, 2001, pp. 4-23
Languages, rewriting systems, and verification of infinite-state systems
Ahmed Bouajjani
Lecture Notes in Computer Science 2076, 2001, pp. 24-39
Integrating semantics for object-oriented system models
Martin Große-Rhode
Lecture Notes in Computer Science 2076, 2001, pp. 40-60
Modelling with partial orders - Why and why not?
Mogens Nielsen
Lecture Notes in Computer Science 2076, 2001, pp. 61-63
Theoretical aspects of evolutionary algorithms
Ingo Wegener
Lecture Notes in Computer Science 2076, 2001, pp. 64-78
Improvements of the Alder-Strassen bound: Algebras with nonzero radical
Markus Bläser
Lecture Notes in Computer Science 2076, 2001, pp. 79-91
On generating all minimal integer solutions for a monotone system of linear inequalities
E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino
Lecture Notes in Computer Science 2076, 2001, pp. 92-103
Division is in uniform TC^o
William Hesse
Lecture Notes in Computer Science 2076, 2001, pp. 104-114
A framework for index bulk loading and dynamization
Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
Lecture Notes in Computer Science 2076, 2001, pp. 115-127
A characterization of temporal locality and its portability across memory hierarchies
Gianfranco Bilardi, Enoch Peserico
Lecture Notes in Computer Science 2076, 2001, pp. 128-139
The complexity of constructing evolutionary trees using experiments
Gerth Stlting Brodal, Rolf Fagerberg, Christian N.S. Pedersen, Anna Östlin
Lecture Notes in Computer Science 2076, 2001, pp. 140-151
Hidden pattern statistics
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée
Lecture Notes in Computer Science 2076, 2001, pp. 152-165
Combinatorics and algorithms on low-discrepancy roundings of a real sequence
Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
Lecture Notes in Computer Science 2076, 2001, pp. 166-177
All-pairs shortest paths computation in the BSP model
Alexandre Tiskin
Lecture Notes in Computer Science 2076, 2001, pp. 178-189
Approximating the minimum spanning tree weight in sublinear time
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
Lecture Notes in Computer Science 2076, 2001, pp. 190-200
Approximation hardness of TSP with bounded metrics
Lars Engebretsen, Marek Karpinski
Lecture Notes in Computer Science 2076, 2001, pp. 201-212
The RPR^2 rounding technique for semidefinite programs
Uriel Feige, Michael Langberg
Lecture Notes in Computer Science 2076, 2001, pp. 213-224
Approximation algorithms for partial covering problems
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
Lecture Notes in Computer Science 2076, 2001, pp. 225-236
On the online bin packing problem
Steven S. Seiden
Lecture Notes in Computer Science 2076, 2001, pp. 237-248
Quick k-median, k-center, and facility location for sparse graphs
Mikkel Thorup
Lecture Notes in Computer Science 2076, 2001, pp. 249-260
Parameterized complexity: Exponential speed-up for planar graph problems
Jochen Alber, Henning Fernau, Rolf Niedermeier
Lecture Notes in Computer Science 2076, 2001, pp. 261-272
Subexponential parameterized algorithms collapse the W-hierarchy
Liming Cai, David Juedes
Lecture Notes in Computer Science 2076, 2001, pp. 273-284
Improved lower bounds on the randomized complexity of graph properties
Amit Chakrabarti, Subhash Khot
Lecture Notes in Computer Science 2076, 2001, pp. 285-296
New imperfect random source with applications to coin-flipping
Yevgeniy Dodis
Lecture Notes in Computer Science 2076, 2001, pp. 297-309

Seiten 1 2 3 4 >