Algorithms for memory hierarchies. Advanced lectures
From MaRDI portal
Publication:1403156
DOI10.1007/3-540-36574-5zbMath1018.68761OpenAlexW1487258612WikidataQ57515800 ScholiaQ57515800MaRDI QIDQ1403156
No author found.
Publication date: 31 August 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://link.springer.de/link/service/series/0558/tocs/t2625.htm
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computing methodologies and applications (68U99) Algorithms in computer science (68W99)
Related Items (13)
Tight lower bounds for query processing on streaming and external memory data ⋮ Mechanisms with Monitoring for Truthful RAM Allocation ⋮ I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark ⋮ External matrix multiplication and all-pairs shortest path ⋮ An I/O Efficient Algorithm for Minimum Spanning Trees ⋮ Flash memory efficient LTL model checking ⋮ On Trade-Offs in External-Memory Diameter-Approximation ⋮ Semi-external LTL Model Checking ⋮ Unnamed Item ⋮ I/O-efficient algorithms for computing planar geometric spanners ⋮ Reversal complexity revisited ⋮ Survey on Directed Model Checking ⋮ An external-memory depth-first search algorithm for general grid graphs
This page was built for publication: Algorithms for memory hierarchies. Advanced lectures
