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

• Three-dimensional layers of maxima
  Adam L. Buchsbaum, Michael T. Goodrich
  Lecture Notes in Computer Science 2461, 2002, pp. 257-269
• Optimal terrain construction problems and applications in intensity-modulated radiation therapy
  Danny Z. Chen, Xiaobo Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu
  Lecture Notes in Computer Science 2461, 2002, pp. 270-283
• Geometric algorithms for density-based data clustering
  Danny Z. Chen, Michiel Smid, Bin Xu
  Lecture Notes in Computer Science 2461, 2002, pp. 284-296
• Balanced-replication algorithms for distribution trees
  Edith Cohen, Haim Kaplan
  Lecture Notes in Computer Science 2461, 2002, pp. 297-309
• Butterflies and peer-to-peer networks
  Mayur Datar
  Lecture Notes in Computer Science 2461, 2002, pp. 310-322
• Estimating rarity and similarity over data stream windows
  Mayur Datar, S. Muthukrishnan
  Lecture Notes in Computer Science 2461, 2002, pp. 323-334
• Efficient constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels
  Annalisa De Bonis, Ugo Vaccaro
  Lecture Notes in Computer Science 2461, 2002, pp. 335-347
• Frequency estimation of internet packet streams with limited space
  Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
  Lecture Notes in Computer Science 2461, 2002, pp. 348-360
• Truthful and competitive double auctions
  Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
  Lecture Notes in Computer Science 2461, 2002, pp. 361-373
• Optimal graph exploration without good maps
  Anders Dessmark, Andrzej Pelc
  Lecture Notes in Computer Science 2461, 2002, pp. 374-386
• 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
• Computing homotopic shortest paths efficiently
  Alon Efrat, Stephen G. Kobourov, Anna Lubiw
  Lecture Notes in Computer Science 2461, 2002, pp. 411-423
• An algorithm for dualization in products of lattices and its applications
  Khaled M. Elbassioni
  Lecture Notes in Computer Science 2461, 2002, pp. 424-435
• Determining similarity of conformational polymorphs
  Angela Enosh, Klara Kedem, Joel Bernstein
  Lecture Notes in Computer Science 2461, 2002, pp. 436-448
• Minimizing the maximum starting time on-line
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 2461, 2002, pp. 449-460
• Vector assignment problems: A general framework
  Leah Epstein, Tamir Tassa
  Lecture Notes in Computer Science 2461, 2002, pp. 461-472
• Speeding up the incremental construction of the union of geometric objects in practice
  Eti Ezra, Dan Halperin, Micha Sharir
  Lecture Notes in Computer Science 2461, 2002, pp. 473-484
• Simple and fast: Improving a branch-and-bound algorithm for maximum clique
  Torsten Fahle
  Lecture Notes in Computer Science 2461, 2002, pp. 485-498
• Online companion caching
  Amos Fiat, Manor Mendel, Steven S. Seiden
  Lecture Notes in Computer Science 2461, 2002, pp. 499-511
• Deterministic communication in radio networks with large labels
  Leszek Ga̧sieniec, Aris Pagourtzis, Igor Potapov
  Lecture Notes in Computer Science 2461, 2002, pp. 512-524
• A primal approach to the stable set problem
  Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel
  Lecture Notes in Computer Science 2461, 2002, pp. 525-537
• Wide-sense nonblocking WDM cross-connects
  Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler
  Lecture Notes in Computer Science 2461, 2002, pp. 538-549
• Efficient implementation of a minimal triangulation algorithm
  Pinar Heggernes, Yngve Villanger
  Lecture Notes in Computer Science 2461, 2002, pp. 550-561
• Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme
  Klaus Jansen
  Lecture Notes in Computer Science 2461, 2002, pp. 562-573