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

• Selecting problems for algorithm evaluation
  Andrew V. Goldberg
  Lecture Notes in Computer Science 1668, 1999, pp. 1-11
• BSP Algorithms - ``Write once, run anywhere''
  Bill McColl
  Lecture Notes in Computer Science 1668, 1999, pp. 12-13
• Ten years of LEDA - Some thoughts
  Kurt Mehlhorn
  Lecture Notes in Computer Science 1668, 1999, pp. 14-14
• Computing the K shortest paths: A new algorithm and an experimental comparison
  Víctor M. Jímenez, Andrés Marzal
  Lecture Notes in Computer Science 1668, 1999, pp. 15-29
• Efficient implementation of lazy suffix trees
  Robert Giegerich, Stefan Kurtz, Jens Stoye
  Lecture Notes in Computer Science 1668, 1999, pp. 30-42
• Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism
  Shlomit Dascal, Uzi Vishkin
  Lecture Notes in Computer Science 1668, 1999, pp. 43-59
• Finding minimum congestion spanning trees
  Renato Fonseca F. Werneck, João Carlos Setubal, Arlindo F. da Conceição
  Lecture Notes in Computer Science 1668, 1999, pp. 60-71
• Evaluation of an algorithm for the transversal hypergraph problem
  Dimitris J. Kavvadias, Elias C. Stavropoulos
  Lecture Notes in Computer Science 1668, 1999, pp. 72-84
• Construction heuristics and domination analysis for the asymmetric TSP
  Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich
  Lecture Notes in Computer Science 1668, 1999, pp. 85-94
• Counting in mobile networks: Theory and experimentation
  K. Hatzis, G. Pentaris, P. Spirakis, B. Tampakas
  Lecture Notes in Computer Science 1668, 1999, pp. 95-109
• Dijkstra's algorithm on-line: An empirical case study from public railroad transport
  Frank Schulz, Dorothea Wagner, Karsten Weihe
  Lecture Notes in Computer Science 1668, 1999, pp. 110-123
• Implementation and experimental evaluation of graph connectivity algorithms using LEDA
  Panagiota Fatouro, Paul Spirakis, Panagiotis Zarafidis, Anna Zoura
  Lecture Notes in Computer Science 1668, 1999, pp. 124-138
• On-line zone construction in arrangements of lines in the plane
  Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
  Lecture Notes in Computer Science 1668, 1999, pp. 139-153
• The design and implementation of planar maps in Cgal
  Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan
  Lecture Notes in Computer Science 1668, 1999, pp. 154-168
• An easy to use implementation of linear perturbations within Cgal
  Jochen Comes, Mark Ziegelmann
  Lecture Notes in Computer Science 1668, 1999, pp. 169-182
• Analysing cache effects in distribution sorting
  Naila Rahman, Rajeev Raman
  Lecture Notes in Computer Science 1668, 1999, pp. 183-197
• Fast regular expression search
  Gonzalo Navarro, Mathieu Raffinot
  Lecture Notes in Computer Science 1668, 1999, pp. 198-212
• An experimental evaluation of hybrid data structures for searching
  Maureen Korda, Rajeev Raman
  Lecture Notes in Computer Science 1668, 1999, pp. 213-227
• LEDA-SM - Extending LEDA to secondary memory
  Andreas Crauser, Kurt Mehlhorn
  Lecture Notes in Computer Science 1668, 1999, pp. 228-242
• A priority queue transform
  Michael L. Fredman
  Lecture Notes in Computer Science 1668, 1999, pp. 243-257
• Implementation issues and experimental study of a wavelength routing algorithm for irregular all-optical networks
  Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis
  Lecture Notes in Computer Science 1668, 1999, pp. 258-270
• Estimating large distances in phylogenetic reconstruction
  Daniel H. Huson, Kelly Ann Smith, Tandy J. Warnow
  Lecture Notes in Computer Science 1668, 1999, pp. 271-285
• The performance of concurrent red-black tree algorithms
  Sabine Hanke
  Lecture Notes in Computer Science 1668, 1999, pp. 286-300
• Performance engineering case study: Heap construction
  Jesper Bojesen, Jyrki Katajainen, Maz Spork
  Lecture Notes in Computer Science 1668, 1999, pp. 301-315
• A fast and simple local search for graph coloring
  Massimiliano Caramia, Paolo Dell'Olmo
  Lecture Notes in Computer Science 1668, 1999, pp. 316-329