Optimal worst-case operations for implicit cache-oblivious search trees.
From MaRDI portal
Recommendations
Cited in
(19)- A tradeoff between search and update time for the implicit dictionary problem
- A compact data structure for representing a dynamic multiset
- Worst-case optimal tree layout in external memory
- Optimal implicit dictionaries over unbounded universes
- A survey on priority queues
- Succinct and Implicit Data Structures for Computational Geometry
- Cache-oblivious implicit predecessor dictionaries with the working-set property
- A Distribution-Sensitive Dictionary with Low Space Overhead
- A distribution-sensitive dictionary with low space overhead
- scientific article; zbMATH DE number 2079398 (Why is no real title available?)
- Array layouts for comparison-based searching
- scientific article; zbMATH DE number 2119642 (Why is no real title available?)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- The cost of cache-oblivious searching
- Optimizing search layouts in packed memory arrays
- Tiny pointers
- Recursively rotated orders and implicit data structures: A lower bound
This page was built for publication: Optimal worst-case operations for implicit cache-oblivious search trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900747)
