scientific article; zbMATH DE number 1792106

MaRDI QIDQ4552048zbMATH OpenFDO

Authors Lars Arge

Publication date 28 August 2002

zbMATH Keywords

kinetic data structuresproximity queriesinterval trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1424311
• scientific article; zbMATH DE number 1875404
• Algorithms and data structures for external memory
• Publication:4490352
• scientific article; zbMATH DE number 1792107
• scientific article; zbMATH DE number 4033049

Cited in

(13)

• Approximate range searching in external memory
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
• I/O-efficient point location using persistent B-trees
• scientific article; zbMATH DE number 1424325 (Why is no real title available?)
• Computing and Combinatorics
• I/O-efficient dynamic planar point location
• Indexing moving points
• Optimal External Memory Interval Management
• Permuting and batched geometric lower bounds in the I/O model
• Cache-Oblivious Red-Blue Line Segment Intersection
• scientific article; zbMATH DE number 1875404 (Why is no real title available?)
• A data structure for a sequence of string accesses in external memory
• Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality

Describes a project that uses

Uses Software

• LEDA

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 Q4552048)