Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1432

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

Recent developments in maximum flow algorithms
Andrew V. Goldberg
Lecture Notes in Computer Science 1432, 1998, pp. 1-10
An \epsilon-approximation algorithm for weighted shortest paths on polyhedral surfaces
Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-R. Sack
Lecture Notes in Computer Science 1432, 1998, pp. 11-22
Facility location with dynamic distance functions
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
Lecture Notes in Computer Science 1432, 1998, pp. 23-34
An approximation scheme for bin packing with conflicts
Klaus Jansen
Lecture Notes in Computer Science 1432, 1998, pp. 35-46
Approximations for the general block distribution of a matrix
Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
Lecture Notes in Computer Science 1432, 1998, pp. 47-58
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
Thorsten Graf, Kamakoti Veezhinathan
Lecture Notes in Computer Science 1432, 1998, pp. 59-70
Moving an angle around a region
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
Lecture Notes in Computer Science 1432, 1998, pp. 71-82
Models and motion planning
Mark de Berg, Matthew J. Katz, Mark Overmars, A. Frank van der Stappen, Jules Vleugels
Lecture Notes in Computer Science 1432, 1998, pp. 83-94
Constrained square-center problems
Matthew J. Katz, Klara Kedem, Michael Segal
Lecture Notes in Computer Science 1432, 1998, pp. 95-106
Worst-case efficient external-memory priority queues
Gerth Stlting Brodal, Jyrki Katajainen
Lecture Notes in Computer Science 1432, 1998, pp. 107-118
Simple confluently persistent catenable lists
Haim Kaplan, Chris Okasaki, Robert E. Tarjan
Lecture Notes in Computer Science 1432, 1998, pp. 119-130
Improved upper bounds for time-space tradeoffs for selection with limited storage
Venkatesh Raman, Sarnath Ramnath
Lecture Notes in Computer Science 1432, 1998, pp. 131-142
Probabilistic data structures for priority queues
R. Sridhar, K. Rajasekar, C. Pandu Rangan
Lecture Notes in Computer Science 1432, 1998, pp. 143-154
Extractors for weak random sources and their applications
David Zuckerman
Lecture Notes in Computer Science 1432, 1998, pp. 155-157
Comparator networks for binary heap construction
Gerth Stlting Brodal, M. Cristina Pinotti
Lecture Notes in Computer Science 1432, 1998, pp. 158-168
Two-variable linear programming in parallel
Danny Z. Chen, Jinhui Xu
Lecture Notes in Computer Science 1432, 1998, pp. 169-180
Optimal deterministic protocols for mobile robots on a grid
Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
Lecture Notes in Computer Science 1432, 1998, pp. 181-192
Concurrent multicast in weighted networks
Gianluca de Marco, Luisa Gargano, Ugo Vaccaro
Lecture Notes in Computer Science 1432, 1998, pp. 193-204
Some recent strong inapproximability results
Johan Håstad
Lecture Notes in Computer Science 1432, 1998, pp. 205-209
Minimal elimination of planar graphs
Elias Dahlhaus
Lecture Notes in Computer Science 1432, 1998, pp. 210-221
Memory requirements for table computations in partial k-tree algorithms
Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle
Lecture Notes in Computer Science 1432, 1998, pp. 222-233
Formal language constrained path problems
Chris Barrett, Riko Jacob, Madhav Marathe
Lecture Notes in Computer Science 1432, 1998, pp. 234-245
Local search algorithms for SAT: Worst-case analysis
Edward A. Hirsch
Lecture Notes in Computer Science 1432, 1998, pp. 246-254
Speed is more powerful than clairvoyance
Piotr Berman, Chris Coulston
Lecture Notes in Computer Science 1432, 1998, pp. 255-263
Randomized online multi-threaded paging
Steven S. Seiden
Lecture Notes in Computer Science 1432, 1998, pp. 264-275

Seiten 1 2 >