scientific article; zbMATH DE number 2086622

MaRDI QIDQ4737157zbMATH OpenFDO

Authors Rajeev Raman, Michael A. Bender, Richard Cole

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800195.htm

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Algorithm Theory - SWAT 2004
• Cache-oblivious algorithms
• scientific article; zbMATH DE number 2011837
• scientific article; zbMATH DE number 1445384
• Towards a theory of cache-efficient algorithms
• Cache-independent algorithms
• Cache-oblivious data structures for orthogonal range searching
• Cache and I/O efficent functional algorithms
• A cache-optimal alternative to the unidirectional hierarchization algorithm

Cited in

(9)

• Cache-oblivious R-trees
• Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
• Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
• Cache-oblivious persistence
• Alphabet-dependent string searching with wexponential search trees
• Towards a theory of cache-efficient algorithms
• I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
• The cost of cache-oblivious searching
• A general approach for cache-oblivious range reporting and approximate range counting

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