Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2161

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

External memory data structures
Lars Arge
Lecture Notes in Computer Science 2161, 2001, pp. 1-29
Some algorithmic problems in large networks
Susanne Albers
Lecture Notes in Computer Science 2161, 2001, pp. 30-32
Exact and approximate distances in graphs - A survey
Uri Zwick
Lecture Notes in Computer Science 2161, 2001, pp. 33-48
Strongly competitive algorithms for caching with pipelined prefetching
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
Lecture Notes in Computer Science 2161, 2001, pp. 49-61
Duality between prefetching and queued writing with parallel disks
David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
Lecture Notes in Computer Science 2161, 2001, pp. 62-73
Online bin coloring
Sven O. Krumke, Willem E. de Paepe, Jörg Rambau, Leen Stougie
Lecture Notes in Computer Science 2161, 2001, pp. 74-85
A general decomposition theorem for the k-server problem
Steven S. Seiden
Lecture Notes in Computer Science 2161, 2001, pp. 86-97
Buying a constant competitive ratio for paging
János Csirik, Csanád Imreh, John Noga, Steve S. Seiden, Gerhard J. Woeginger
Lecture Notes in Computer Science 2161, 2001, pp. 98-108
Simple minimal perfect hashing in less space
Martin Dietzfelbinger, Torben Hagerup
Lecture Notes in Computer Science 2161, 2001, pp. 109-120
Cuckoo hashing
Rasmus Pagh, Flemming Friche Rodler
Lecture Notes in Computer Science 2161, 2001, pp. 121-133
Coupling variable fixing algorithms for the automatic recording problem
Meinolf Sellmann, Torsten Fahle
Lecture Notes in Computer Science 2161, 2001, pp. 134-145
Approximation algorithms for scheduling malleable tasks under precedence constraints
Renaud Lepère, Denis Trystram, Gerhard J. Woeginger
Lecture Notes in Computer Science 2161, 2001, pp. 146-157
On the approximability of the minimum test collection problem
Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi
Lecture Notes in Computer Science 2161, 2001, pp. 158-169
Finding approximate repetitions under Hamming distance
Roman Kolpakov, Gregory Kucherov
Lecture Notes in Computer Science 2161, 2001, pp. 170-181
SNPs problems, complexity, and algorithms
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz
Lecture Notes in Computer Science 2161, 2001, pp. 182-193
A FPTAS for approximating the unrelated parallel machines scheduling problem with costs
Eric Angel, Evripidis Bampis, Alexander Kononov
Lecture Notes in Computer Science 2161, 2001, pp. 194-205
Grouping techniques for scheduling problems: Simpler and faster
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
Lecture Notes in Computer Science 2161, 2001, pp. 206-217
A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times
Yoshiyuki Karuno, Hiroshi Nagamochi
Lecture Notes in Computer Science 2161, 2001, pp. 218-229
A simple shortest path algorithm with linear average time
Andrew V. Goldberg
Lecture Notes in Computer Science 2161, 2001, pp. 230-241
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Kurt Mehlhorn, Guido Schäfer
Lecture Notes in Computer Science 2161, 2001, pp. 242-253
A separation bound for real algebraic expressions
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
Lecture Notes in Computer Science 2161, 2001, pp. 254-265
Property testing with geometric queries
Artur Czumaj, Christian Sohler
Lecture Notes in Computer Science 2161, 2001, pp. 266-277
Smallest color-spanning objects
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
Lecture Notes in Computer Science 2161, 2001, pp. 278-289
Explicit deterministic constructions for membership in the bitprobe model
Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
Lecture Notes in Computer Science 2161, 2001, pp. 290-299
Lossy dictionaries
Rasmus Pagh, Flemming Friche Rodler
Lecture Notes in Computer Science 2161, 2001, pp. 300-311

Seiten 1 2 >