scientific article; zbMATH DE number 1476487
From MaRDI portal
Recommendations
Cited in
(18)- scientific article; zbMATH DE number 1792106 (Why is no real title available?)
- Lower bounds for external algebraic decision trees
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- Heaps and heapsort on secondary storage
- The buffer tree: A new technique for optimal I/O-algorithms
- On the dynamic one-dimensional interval management problem in external memory
- A general lower bound on the I/O-complexity of comparison-based algorithms
- Algorithms and data structures for external memory
- Efficient data storage in large nanoarrays
- scientific article; zbMATH DE number 1424325 (Why is no real title available?)
- Computing and Combinatorics
- Worst-case efficient external-memory priority queues
- Extending STL with efficient data structures
- Optimal External Memory Interval Management
- The buffer tree: A technique for designing batched external data structures
- Permuting and batched geometric lower bounds in the I/O model
- scientific article; zbMATH DE number 4115931 (Why is no real title available?)
- scientific article; zbMATH DE number 1452526 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490352)