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	Hilfe

Suche: Series=LNCS AND Volume=1461

• Evaluating server-assisted cache replacement in the Web
  Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford
  Lecture Notes in Computer Science 1461, 1998, pp. 307-319
• Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
  Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
  Lecture Notes in Computer Science 1461, 1998, pp. 320-331
• A functional approach to external graph algorithms
  James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook
  Lecture Notes in Computer Science 1461, 1998, pp. 332-343
• Minimal triangulations for graphs with ``few'' minimal separators
  Vincent Bouchitté, Ioan Todinca
  Lecture Notes in Computer Science 1461, 1998, pp. 344-355
• Finding an optimal path without growing the tree
  Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu, Jinhui Xu
  Lecture Notes in Computer Science 1461, 1998, pp. 356-367
• An experimental study of dynamic algorithms for directed graphs
  Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schaefer, Christos Zaroliagis
  Lecture Notes in Computer Science 1461, 1998, pp. 368-380
• Matching medical students to pairs of hospitals: A new variation on a well-known theme
  Robert W. Irving
  Lecture Notes in Computer Science 1461, 1998, pp. 381-392
• \Delta-stepping: A parallel single source shortest path algorithm
  Ulrich Meyer, Peter Sanders
  Lecture Notes in Computer Science 1461, 1998, pp. 393-404
• Improved deterministic parallel padded sorting
  Ka Wong Chong, Edgar A. Ramos
  Lecture Notes in Computer Science 1461, 1998, pp. 405-416
• Analyzing an infinite parallel job allocation process
  Micah Adler, Petra Berenbrink, Klaus Schröder
  Lecture Notes in Computer Science 1461, 1998, pp. 417-428
• Nearest neighbor load balancing on graphs
  Ralf Diekmann, Andreas Frommer, Burkhard Monien
  Lecture Notes in Computer Science 1461, 1998, pp. 429-440
• 2-approximation algorithm for finding a spanning tree with maximum number of leaves
  Roberto Solis-Oba
  Lecture Notes in Computer Science 1461, 1998, pp. 441-452
• Moving-target TSP and related problems
  C.S. Helvig, Gabriel Robins, Alex Zelikovsky
  Lecture Notes in Computer Science 1461, 1998, pp. 453-464
• Fitting points on the real line and its application to RH mapping
  Johan Håstad, Lars Ivansson, Jens Lagergren
  Lecture Notes in Computer Science 1461, 1998, pp. 465-476
• Approximate coloring of uniform hypergraphs
  Michael Krivelevich, Benny Sudakov
  Lecture Notes in Computer Science 1461, 1998, pp. 477-489
• Techniques for scheduling with rejection
  Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R.N. Uma, Joel Wein
  Lecture Notes in Computer Science 1461, 1998, pp. 490-501
• Computer-aided way to prove theorems in scheduling
  S.V. Sevastianov, I.D. Tchernykh
  Lecture Notes in Computer Science 1461, 1998, pp. 502-513