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 [1]	Hilfe

Suche: Series=LNCS AND Volume=2518

• Meaningful information
  Paul Vitányi
  Lecture Notes in Computer Science 2518, 2002, pp. 588-599
• Market clearing with supply/demand curves
  Tuomas Sandholm, Subhash Suri
  Lecture Notes in Computer Science 2518, 2002, pp. 600-611
• Partitioning trees of supply and demand
  Takehiro Ito, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 2518, 2002, pp. 612-623
• Maximizing a Voronoi region: The convex case
  Frank Dehne, Rolf Klein, Raimund Seidel
  Lecture Notes in Computer Science 2518, 2002, pp. 624-634
• Random tries
  Luc Devroye
  Lecture Notes in Computer Science 2518, 2002, pp. 635-635
• Expected acceptance counts for finite automata with almost uniform input
  Nicholas Pippenger
  Lecture Notes in Computer Science 2518, 2002, pp. 636-646
• Monotone drawings of planar graphs
  János Pach, Géza Tóth
  Lecture Notes in Computer Science 2518, 2002, pp. 647-653