Cache oblivious distribution sweeping

DOI10.1007/3-540-45465-9_37MaRDI QIDQ4737177zbMATH OpenFDO

Authors Gerth Stølting Brodal, Rolf Fagerberg

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Cache-oblivious algorithms
• Cache-oblivious algorithms
• Cache-oblivious data structures for orthogonal range searching
• A general approach for cache-oblivious range reporting and approximate range counting
• Cache-Oblivious Red-Blue Line Segment Intersection

Cited in

(12)

• Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
• Cache-Oblivious Red-Blue Line Segment Intersection
• Geometric algorithms for private-cache chip multiprocessors (extended abstract)
• scientific article; zbMATH DE number 1383711 (Why is no real title available?)
• External-memory sorting with comparison errors
• Optimal cache-oblivious mesh layouts
• The cost of cache-oblivious searching
• Deterministic cache-oblivious funnelselect
• When are cache-oblivious algorithms cache adaptive? A case study of matrix multiplication and sorting
• Masking patterns in sequences: A new class of motif discovery with don't cares
• External-memory priority queues with optimal insertions
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: Cache oblivious distribution sweeping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737177)