scientific article; zbMATH DE number 1476487

zbMATH Open0945.68191MaRDI QIDQ4490352FDOQ4490352

Authors: Lars Arge 

Publication date: 14 July 2000

Title of this publication is not available (Why is that?)

Recommendations

• Algorithms and data structures for external memory
• scientific article; zbMATH DE number 1424311
• Computing and Combinatorics
• The buffer tree: A new technique for optimal I/O-algorithms
• The buffer tree: A technique for designing batched external data structures

zbMATH Keywords

large-scale problemsdatabase systemsgeographic information systemsVLSI design systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computing methodologies and applications (68U99) Data structures (68P05) Nonnumerical algorithms (68W05)

Cited In (18)

• Worst-case efficient external-memory priority queues
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the dynamic one-dimensional interval management problem in external memory
• Optimal External Memory Interval Management
• Heaps and heapsort on secondary storage
• Lower bounds for external algebraic decision trees
• The buffer tree: A technique for designing batched external data structures
• A general lower bound on the I/O-complexity of comparison-based algorithms
• Extending STL with efficient data structures
• Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing and Combinatorics
• Algorithms and data structures for external memory
• The buffer tree: A new technique for optimal I/O-algorithms
• Permuting and batched geometric lower bounds in the I/O model
• Efficient data storage in large nanoarrays

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)