Cache-Oblivious Data Structures

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Handbook of Data Structures and Applications

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1201/9781420035179.ch34
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Engineering a Cache-Oblivious Sorting Algorith

  2004cited by this paper
• On the limits of cache-obliviousness

  2003cited by this paper
• The Cost of Cache-Oblivious Searching

  2003cited by this paper
• Cache-oblivious data structures for orthogonal range searching

  2003influential reference
• Exponential Structures for Efficient Cache-Oblivious Algorithms

  2002cited by this paper
• Efficient Tree Layout in a Multilevel Memory Hierarchy

  2002cited by this paper
• A locality-preserving cache-oblivious dynamic dictionary

  2002cited by this paper
• Cache Oblivious Distribution Sweeping

  2002influential reference
• Funnel Heap - A Cache Oblivious Priority Queue

  2002influential reference
• Cache-oblivious priority queue and graph algorithm applications

  2002cited by this paper
• External Memory Data Structures

  2001cited by this paper
• Cache oblivious search trees via binary trees of small height

  2001influential reference
• External memory algorithms and data structures: dealing with massive data

  2001influential reference
• Optimised Predecessor Data Structures for Internal Memory

  2001cited by this paper
• Cache-oblivious B-trees

  2000cited by this paper
• A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation

  2000cited by this paper
• Cache-oblivious algorithms

  1999cited by this paper
• Optimal Dynamic Range Searching in Non-replicating Index Structures

  1999cited by this paper
• Fast Updating of Well-Balanced Trees

  1990influential reference
• The input/output complexity of sorting and related problems

  1988influential reference
• A Sparse Table Implementation of Priority Queues

  1981cited by this paper
• Decomposable Searching Problems

  1979cited by this paper
• Preserving order in a forest in less than logarithmic time

  1975cited by this paper
• Multidimensional binary search trees used for associative searching

  1975cited by this paper
• Organization and maintenance of large ordered indexes

  1972influential reference

• Parallel kd-tree with Batch Updates

  2025cites this paper
• Cache Complexity of Cache-Oblivious Approaches: A Review and Extension

  2022cites this paper
• ParGeo: A Library for Parallel Computational Geometry

  2022cites this paper
• Parallel Batch-Dynamic kd-Trees

  2021cites this paper
• The Algorithm Design Manual

  2020cites this paper
• Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]

  2020cites this paper
• Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra

  2018cites this paper
• Algorithms for Analyzing Spatio-Temporal Data

  2018cites this paper
• On The Implementation of Recursive Data Structures for Cache-Oblivious Algorithms

  2016cites this paper
• Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures

  2016cites this paper
• Cache-Efficient Aggregation: Hashing Is Sorting

  2015cites this paper
• Autonomous and safe capture of large space debris with a robotic manipulator

  2015cites this paper
• Cache-aware asymptotically-optimal sampling-based motion planning

  2014cites this paper
• Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees

  2012cites this paper
• Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data

  2011cites this paper
• A comparison of neighbor search algorithms for large rigid molecules

  2011cites this paper
• Redesigning the string hash table, burst trie, and BST to exploit cache

  2011cites this paper
• GOOGLE DATASTORE ON MULTI-CORE ARCHITECTURES

  2011cites this paper
• Oblivious algorithms for multicores and network of processors

  2010cites this paper
• Engineering scalable, cache and space efficient tries for strings

  2010cites this paper
• Cache-Efficient Parallel Isosurface Extraction for Shared Cache Multicores

  2010cites this paper
• Cache-oblivious ray reordering

  2010cites this paper
• Data Structures: Time, I/Os, Entropy, Joules!

  2010cites this paper
• RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies

  2009cites this paper
• A Fast Cache Oblivious Mesh Layout with Theoretical Guarantees

  2008cites this paper
• On the limits of cache-oblivious rational permutations

  2008cites this paper
• Cache-Oblivious Red-Blue Line Segment Intersection

  2008cites this paper
• Cache-Oblivious Model

  2008cites this paper
• Real-Time Massive Model Rendering

  2008cites this paper
• Cache-Oblivious B-Tree

  2008cites this paper
• Algorithms and Data Structures for External Memory

  2008cites this paper
• Engineering a cache-oblivious sorting algorithm

  2008cites this paper
• Massive model visualization techniques: course notes

  2008cites this paper
• Random-Accessible Compressed Triangle Meshes

  2007cites this paper
• HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings

  2007cites this paper
• An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms

  2007cites this paper
• Skewed Binary Search Trees

  2006cites this paper
• A Memory Model for Scientific Algorithms on Graphics Processors

  2006cites this paper
• Cache-oblivious string dictionaries

  2006cites this paper
• Cache‐Efficient Layouts of Bounding Volume Hierarchies

  2006cites this paper
• On the Limits of Cache-Oblivious Matrix Transposition

  2006cites this paper
• External String Sorting: Faster and Cache-Oblivious

  2006cites this paper
• Mesh Layouts for Block-Based Caches

  2006cites this paper
• Interactive visualization and collision detection using dynamic simplification and cache-coherent layouts

  2005cites this paper
• Cache-oblivious mesh layouts

  2005cites this paper
• Cache-Aware and Cache-Oblivious Adaptive Sorting

  2005cites this paper
• Cache-Oblivious Algorithms and Data Structures

  2004cites this paper
• Cache-Oblivious Searching and Sorting

  2003cites this paper
• Syllabus

  1959cites this paper