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

• Agent rendezvous: A dynamic symmetry-breaking problem
  Xiangdong Yu, Moti Yung
  Lecture Notes in Computer Science 1099, 1996, pp. 610-621
• Efficient asynchronous consensus with the value-oblivious adversary scheduler
  Yonatan Aumann, Michael A. Bender
  Lecture Notes in Computer Science 1099, 1996, pp. 622-633
• A formal framework for evaluating heuristic programs
  Lenor Cowen, Joan Feigenbaum, Sampath Kannan
  Lecture Notes in Computer Science 1099, 1996, pp. 634-645
• Improved scheduling algorithms for minsum criteria
  Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Cliff Stein, Joel Wein
  Lecture Notes in Computer Science 1099, 1996, pp. 646-657
• On the complexity of string folding
  Mike Paterson, Teresa Przytycka
  Lecture Notes in Computer Science 1099, 1996, pp. 658-669
• A polynomial-time algorithm for near-perfect phylogeny
  David Fernández-Baca, Jens Lagergren
  Lecture Notes in Computer Science 1099, 1996, pp. 670-680