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

• Bandwidth and profile minimization
  M. Wiegers, B. Monien
  Lecture Notes in Computer Science 344, 1989, pp. 378-393
• On the spanning trees of weighted graphs
  E.W. Mayr, C.G. Plaxton
  Lecture Notes in Computer Science 344, 1989, pp. 394-405
• On paths in search or decision trees which require almost worst-case time
  U. Huckenbeck
  Lecture Notes in Computer Science 344, 1989, pp. 406-423
• A time-optimal parallel algorithm for the computing of Voronoi-diagrams
  W. Preilowski, W. Mumbeck
  Lecture Notes in Computer Science 344, 1989, pp. 424-433
• Voronoi diagrams in the Moscow metric
  R. Klein
  Lecture Notes in Computer Science 344, 1989, pp. 434-441
• A sweep algorithm and its implementation
  K. Hinrichs, J. Nievergelt, P. Schorn
  Lecture Notes in Computer Science 344, 1989, pp. 442-457