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

• Compact DFA representation for fast regular expression search
  Gonzalo Navarro, Mathieu Raffinot
  Lecture Notes in Computer Science 2141, 2001, pp. 1-12
• The max-shift algorithm for approximate string matching
  Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon
  Lecture Notes in Computer Science 2141, 2001, pp. 13-25
• Fractal matrix multiplication: A case study on portability of cache performance
  Gianfranco Bilardi, Paolo DáAlberto, Alex Nicolau
  Lecture Notes in Computer Science 2141, 2001, pp. 26-38
• Experiences with the design and implementation of space-efficient deques
  Jyrki Katajainen, Bjarke Buur Mortensen
  Lecture Notes in Computer Science 2141, 2001, pp. 39-50
• Designing and implementing a general purpose halfedge data structure
  Hervé Brönnimann
  Lecture Notes in Computer Science 2141, 2001, pp. 51-66
• Optimised predecessor data structures for internal memory
  Naila Rahman, Richard Cole, Rajeev Raman
  Lecture Notes in Computer Science 2141, 2001, pp. 67-78
• An adaptable and extensible geometry kernel
  Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
  Lecture Notes in Computer Science 2141, 2001, pp. 79-90
• Efficient resource allocation with noisy functions
  Arne Andersson, Per Carlsson, Fredrik Ygge
  Lecture Notes in Computer Science 2141, 2001, pp. 91-105
• Improving the efficiency of branch and bound algorithms for the simple plant location problem
  Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
  Lecture Notes in Computer Science 2141, 2001, pp. 106-117
• Exploiting partial knowledge of satisfying assignments
  Kazuo Iwama, Suguru Tamaki
  Lecture Notes in Computer Science 2141, 2001, pp. 118-128
• Using PRAM algorithms on a uniform-memory-access shared-memory architecture
  David A. Bader, Ajith K. Illendula, Bernard M.E. Moret, Nina R. Weisse-Bernstein
  Lecture Notes in Computer Science 2141, 2001, pp. 129-144
• An experimental study of data migration algorithms
  Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes
  Lecture Notes in Computer Science 2141, 2001, pp. 145-158
• An experimental study of basic communication protocols in ad-hoc mobile networks
  Ioannis Chatzigiannakis, Sotiris Nikoletseas, Nearchos Paspallis, Paul Spirakis, Christos Zaroliagis
  Lecture Notes in Computer Science 2141, 2001, pp. 159-171
• Experimental analysis of algorithms for bilateral-contract clearing mechanisms arising in deregulated power industry
  Chris Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
  Lecture Notes in Computer Science 2141, 2001, pp. 172-184
• Pareto shortest paths is often feasible in practice
  Matthias Müller-Hannemann, Karsten Weihe
  Lecture Notes in Computer Science 2141, 2001, pp. 185-197