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

• What can be efficiently reduced to the K-random strings?
  Eric Allender, Harry Buhrman, Michal Koucký
  Lecture Notes in Computer Science 2996, 2004, pp. 584-595
• Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
  Sebastian Bala
  Lecture Notes in Computer Science 2996, 2004, pp. 596-607
• Deterministic truthful approximation mechanisms for scheduling related machines
  Vincenzo Auletta, Roberto de Prisco, Paolo Penna, Giuseppe Persiano
  Lecture Notes in Computer Science 2996, 2004, pp. 608-619
• The expected competitive ratio for weighted completion time scheduling
  Alexander Souza, Angelika Steger
  Lecture Notes in Computer Science 2996, 2004, pp. 620-631
• Effective strong dimension in algorithmic information and computational complexity
  Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
  Lecture Notes in Computer Science 2996, 2004, pp. 632-643
• A lower bound on the competitive ratio of truthful auctions
  Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael Saks
  Lecture Notes in Computer Science 2996, 2004, pp. 644-655
• Erratum to ''Analysis of the harmonic algorithm for three servers''
  Marek Chrobak, Jiȓí Sgall
  Lecture Notes in Computer Science 2996, 2004, pp. 656-656