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

• Memory hierarchies - Models and lower bounds
  Peter Sanders
  Lecture Notes in Computer Science 2625, 2003, pp. 1-13
• Basic external memory data structures
  Rasmus Pagh
  Lecture Notes in Computer Science 2625, 2003, pp. 14-35
• A survey of techniques for designing I/O-efficient algorithms
  Anil Maheshwari, Norbert Zeh
  Lecture Notes in Computer Science 2625, 2003, pp. 36-61
• Elementary graph algorithms in external memory
  Irit Katriel, Ulrich Meyer
  Lecture Notes in Computer Science 2625, 2003, pp. 62-84
• I/O-efficient algorithms for sparse graphs
  Laura Toma, Norbert Zeh
  Lecture Notes in Computer Science 2625, 2003, pp. 85-109
• External memory computational geometry revisited
  Christian Breimann, Jan Vahrenhold
  Lecture Notes in Computer Science 2625, 2003, pp. 110-148
• Full-text indexes in external memory
  Juha Kärkkäinen, S. Srinivasa Rao
  Lecture Notes in Computer Science 2625, 2003, pp. 149-170
• Algorithms for hardware caches and TLB
  Naila Rahman
  Lecture Notes in Computer Science 2625, 2003, pp. 171-192
• Cache oblivious algorithms
  Piyush Kumar
  Lecture Notes in Computer Science 2625, 2003, pp. 193-212
• An overview of cache optimization techniques and cache-aware numerical algorithms
  Markus Kowarschik, Christian Weiß
  Lecture Notes in Computer Science 2625, 2003, pp. 213-232
• Memory limitations in artificial intelligence
  Stefan Edelkamp
  Lecture Notes in Computer Science 2625, 2003, pp. 233-250
• Algorithmic approaches for storage networks
  Kay A. Salzwedel
  Lecture Notes in Computer Science 2625, 2003, pp. 251-272
• An overview of file system architectures
  Florin Isaila
  Lecture Notes in Computer Science 2625, 2003, pp. 273-289
• Exploitation of the memory hierarchy in relational DBMSs
  Josep-L. Larriba-Pey
  Lecture Notes in Computer Science 2625, 2003, pp. 290-319
• Hierarchical models and software tools for parallel programming
  Massimo Coppola, Martin Schmollinger
  Lecture Notes in Computer Science 2625, 2003, pp. 320-354
• Case study: Memory conscious parallel sorting
  Dani Jiménez-González, Josep-L. Larriba-Pey, Juan Navarro
  Lecture Notes in Computer Science 2625, 2003, pp. 355-377