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 YEAR=1998

• A randomized algorithm for two servers on the line
  Yair Bartal, Marek Chrobak, Lawrence L. Larmore
  Lecture Notes in Computer Science 1461, 1998, pp. 247-258
• Adaptability and the usefulness of hints
  Piotr Berman, Juan A. Garay
  Lecture Notes in Computer Science 1461, 1998, pp. 271-282
• Evaluating server-assisted cache replacement in the Web
  Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford
  Lecture Notes in Computer Science 1461, 1998, pp. 307-319
• 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
• 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
• A resource management architecture for metacomputing systems
  Karl Czajkowski, Ian Foster, Nick Karonis, Carl Kesselman, Stuart Martin, Warren Smith, Steven Tuecke
  Lecture Notes in Computer Science 1459, 1998, pp. 62-82
• Job scheduling scheme for pure space sharing among rigid jobs
  Kento Aida, Hironori Kasahara, Seinosuke Narita
  Lecture Notes in Computer Science 1459, 1998, pp. 98-121
• Coarse-grid selection for parallel algebraic multigrid
  Andrew J. Cleary, Robert D. Falgout, Henson van Emden, Jim E. Jones
  Lecture Notes in Computer Science 1457, 1998, pp. 104-115
• Quality balancing for parallel adaptive FEM
  Ralf Diekmann, Frank Schlimbach, Chris Walshaw
  Lecture Notes in Computer Science 1457, 1998, pp. 170-181
• The distributed object-oriented threads system DOTS
  Wolfgang Blochinger, Wolfgang Küchlin, Andreas Weber
  Lecture Notes in Computer Science 1457, 1998, pp. 206-217
• Parallel vertex-to-vertex radiosity on a distributed shared memory system
  Adi Bar-Lev, Ayal Itzkovitz, Alon Raviv, Assaf Schuster
  Lecture Notes in Computer Science 1457, 1998, pp. 238-250
• COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications
  Jesús Carretero, Jaechun No, Alok Choudhary, Pang Chen
  Lecture Notes in Computer Science 1457, 1998, pp. 262-273
• Cooperative multi-thread parallel tabu search with an application to circuit partitioning
  Renata M. Aiex, Simone de L. Martins, Celso C. Ribeiro, Noemi de la R. Rodriguez
  Lecture Notes in Computer Science 1457, 1998, pp. 310-331
• Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via irregularization
  Dmitry Arapov, Alexey Kalinov, Alexey Lastovetsky, Ilya Ledovskih
  Lecture Notes in Computer Science 1457, 1998, pp. 332-343
• Balancing the load in large-scale distributed entity-level simulations
  Sharon Brunnett
  Lecture Notes in Computer Science 1457, 1998, pp. 344-355
• Parallel run-time system for adaptive mesh refinement
  Nikos Chrisochoides
  Lecture Notes in Computer Science 1457, 1998, pp. 396-405
• Hypergraph traversal revisited: Cost measures and dynamic algorithms
  Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
  Lecture Notes in Computer Science 1450, 1998, pp. 1-16
• Defining the Java virtual machine as platform for provably correct Java compilation
  Egon Börger, Wolfram Schulte
  Lecture Notes in Computer Science 1450, 1998, pp. 17-35
• Combinatorial hardness proofs for polynomial evaluation
  Mikel Aldaz, Joos Heintz, Guillermo Matera, José L. Montaña, Luis M. Pardo
  Lecture Notes in Computer Science 1450, 1998, pp. 167-175
• Minimum propositional proof length is NP-hard to linearly approximate
  Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi
  Lecture Notes in Computer Science 1450, 1998, pp. 176-184
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
  Marek Chrobak, Christoph Dürr
  Lecture Notes in Computer Science 1450, 1998, pp. 185-193