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=2002

• Approximating the medial axis from the Voronoi diagram with a convergence guarantee
  Tamal K. Dey, Wulue Zhao
  Lecture Notes in Computer Science 2461, 2002, pp. 387-398
• Non-independent randomized rounding and an application to digital halftoning
  Benjamin Doerr, Henning Schnieder
  Lecture Notes in Computer Science 2461, 2002, pp. 399-410
• Global development via local observational construction steps
  Michel Bidoit, Donald Sannella, Andrzej Tarlecki
  Lecture Notes in Computer Science 2420, 2002, pp. 1-24
• On radiocoloring hierarchically specified planar graphs: PSPACE-completeness and approximations
  Maria I. Andreou, Dimitris A. Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis
  Lecture Notes in Computer Science 2420, 2002, pp. 81-92
• Finite domain constraint satisfaction using quantum computation
  Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson
  Lecture Notes in Computer Science 2420, 2002, pp. 93-103
• Fast algorithms with algebraic Monge properties
  Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
  Lecture Notes in Computer Science 2420, 2002, pp. 104-117
• Packing edges in random regular graphs
  Mihalis Beis, William Duckworth, Michele Zito
  Lecture Notes in Computer Science 2420, 2002, pp. 118-130
• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
  Beate Bollig, Philipp Woelfel
  Lecture Notes in Computer Science 2420, 2002, pp. 131-142
• Matroid intersections, polymatroid inequalities, and related problems
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
  Lecture Notes in Computer Science 2420, 2002, pp. 143-154
• Accessibility in automata on scattered linear orderings
  Olivier Carton
  Lecture Notes in Computer Science 2420, 2002, pp. 155-164
• On infinite terms having a decidable monadic theory
  Didier Caucal
  Lecture Notes in Computer Science 2420, 2002, pp. 165-176
• A Chomsky-like hierarchy of infinite graphs
  Didier Caucal, Teodor Knapik
  Lecture Notes in Computer Science 2420, 2002, pp. 177-187
• Competitive analysis of on-line stream merging algorithms
  Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W.H. Wong
  Lecture Notes in Computer Science 2420, 2002, pp. 188-200
• Coloring k-colorable semirandom graphs in polynomial expected time via semidefinite programming
  Amin Coja-Oghlan
  Lecture Notes in Computer Science 2420, 2002, pp. 201-211
• On word equations in one variable
  Robert Da̧browski, Wojtek Plandowski
  Lecture Notes in Computer Science 2420, 2002, pp. 212-220
• An experimental study of prefetching and caching algorithms for the World Wide Web
  Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti
  Lecture Notes in Computer Science 2409, 2002, pp. 71-85
• Partitioning planar graphs with costs and weights
  Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
  Lecture Notes in Computer Science 2409, 2002, pp. 98-110
• Maintaining dynamic minimum spanning trees: An experimental study
  Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
  Lecture Notes in Computer Science 2409, 2002, pp. 111-125
• Getting more from out-of-core columnsort
  Geeta Chaudhry, Thomas H. Cormen
  Lecture Notes in Computer Science 2409, 2002, pp. 143-154
• An improvement on Tree Selection Sort
  Jingchao Chen
  Lecture Notes in Computer Science 2409, 2002, pp. 194-205
• Orchestrating computations on the World-Wide Web
  Young-ri Choi, Amit Garg, Siddharta Rai, Jayadev Misra, Harrick Vin
  Lecture Notes in Computer Science 2400, 2002, pp. 1-20
• Realistic rendering in real-time
  Alan Chalmers, Kirsten Cater
  Lecture Notes in Computer Science 2400, 2002, pp. 21-28
• Non-massive, non-high performance, distributed computing: Selected issues
  Albert Benveniste
  Lecture Notes in Computer Science 2400, 2002, pp. 29-48
• Support tools and environments
  Marian Bubak, Thomas Ludwig
  Lecture Notes in Computer Science 2400, 2002, pp. 73-74
• Performance of MP3D on the SB-PRAM prototype
  Roman Dementiev, Michael Klein, Wolfgang J. Paul
  Lecture Notes in Computer Science 2400, 2002, pp. 132-136