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 YEAR=1998

• Static and dynamic low-congested interval routing schemes
  Serafino Cicerone, Gabriele di Stefano, Michele Flammini
  Lecture Notes in Computer Science 1443, 1998, pp. 592-603
• Low-bandwidth routing and electrical power networks
  Doug Cook, Vance Faber, Madhav Marathe, Aravind Srinivasan, Yoram J. Sussmann
  Lecture Notes in Computer Science 1443, 1998, pp. 604-615
• A polynomial time approximation scheme for Euclidean minimum cost k-connectivity
  Artur Czumaj, Andrzej Lingas
  Lecture Notes in Computer Science 1443, 1998, pp. 682-694
• Inversion of circulant matrices over Z_m
  Dario Bini, Gianna M. del Corso, Giovanni Manzini, Luciano Margara
  Lecture Notes in Computer Science 1443, 1998, pp. 719-730
• The relevance of proof-irrelevance
  Gilles Barthe
  Lecture Notes in Computer Science 1443, 1998, pp. 755-768
• New horizons in quantum information processing
  Gilles Brassard
  Lecture Notes in Computer Science 1443, 1998, pp. 769-771
• Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP
  Ivan Damgård, Birgit Pfitzmann
  Lecture Notes in Computer Science 1443, 1998, pp. 772-783
• Totality, definability and Boolean circuits
  Antonio Bucciarelli, Ivano Salvo
  Lecture Notes in Computer Science 1443, 1998, pp. 808-819
• Quantum counting
  Gilles Brassard, Peter Hyer, Alain Tapp
  Lecture Notes in Computer Science 1443, 1998, pp. 820-831
• On the complexity of deriving score functions from examples for problems in molecular biology
  Tatsuya Akutsu, Mutsunori Yagiura
  Lecture Notes in Computer Science 1443, 1998, pp. 832-843
• Protection in programming-language translations
  Martín Abadi
  Lecture Notes in Computer Science 1443, 1998, pp. 868-883
• A simple solution to type specialization
  Olivier Danvy
  Lecture Notes in Computer Science 1443, 1998, pp. 908-917
• Self-organizing data structures
  Susanne Albers, Jeffery Westbrook
  Lecture Notes in Computer Science 1442, 1998, pp. 13-51
• Metrical task systems, the server problem and the work function algorithm
  Marek Chrobak, Lawrence L. Larmore
  Lecture Notes in Computer Science 1442, 1998, pp. 74-96
• Distributed paging
  Yair Bartal
  Lecture Notes in Computer Science 1442, 1998, pp. 97-117
• Competitive analysis of distributed algorithms
  James Aspnes
  Lecture Notes in Computer Science 1442, 1998, pp. 118-146
• On-line packing and covering problems
  János Csirik, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1442, 1998, pp. 147-177
• On-line load balancing
  Yossi Azar
  Lecture Notes in Computer Science 1442, 1998, pp. 178-195
• On-line searching and navigation
  Piotr Berman
  Lecture Notes in Computer Science 1442, 1998, pp. 232-241
• On-line algorithms in machine learning
  Avrim Blum
  Lecture Notes in Computer Science 1442, 1998, pp. 306-325
• Bibliography on competitive algorithms
  Marek Chrobak, John Noga
  Lecture Notes in Computer Science 1442, 1998, pp. 395-436
• An \epsilon-approximation algorithm for weighted shortest paths on polyhedral surfaces
  Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-R. Sack
  Lecture Notes in Computer Science 1432, 1998, pp. 11-22
• Facility location with dynamic distance functions
  Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
  Lecture Notes in Computer Science 1432, 1998, pp. 23-34
• Approximations for the general block distribution of a matrix
  Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
  Lecture Notes in Computer Science 1432, 1998, pp. 47-58
• Worst-case efficient external-memory priority queues
  Gerth Stlting Brodal, Jyrki Katajainen
  Lecture Notes in Computer Science 1432, 1998, pp. 107-118