Publication:4552048
From MaRDI portal
zbMath1010.68039MaRDI QIDQ4552048
Publication date: 28 August 2002
68P05: Data structures
Related Items
Permuting and Batched Geometric Lower Bounds in the I/O Model, I/O-efficient point location using persistent B-trees, Approximate range searching in external memory, Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies, Indexing moving points, I/O-efficient dynamic planar point location, Cache-Oblivious Red-Blue Line Segment Intersection
Uses Software