Optimal cache-oblivious implicit dictionaries
From MaRDI portal
Recommendations
- A Cache-Oblivious Implicit Dictionary with the Working Set Property
- scientific article; zbMATH DE number 6297800
- Cache-oblivious implicit predecessor dictionaries with the working-set property
- scientific article; zbMATH DE number 2079398
- A locality-preserving cache-oblivious dynamic dictionary
- scientific article; zbMATH DE number 2119641
- A trade-off for worst-case efficient dictionaries
- Cache-oblivious dictionaries and multimaps with negligible failure probability
- Optimal implicit dictionaries over unbounded universes
- A tradeoff between search and update time for the implicit dictionary problem
Cited in
(11)- A tradeoff between search and update time for the implicit dictionary problem
- A compact data structure for representing a dynamic multiset
- Optimal implicit dictionaries over unbounded universes
- Cache-oblivious implicit predecessor dictionaries with the working-set property
- A Cache-Oblivious Implicit Dictionary with the Working Set Property
- A locality-preserving cache-oblivious dynamic dictionary
- scientific article; zbMATH DE number 3956454 (Why is no real title available?)
- scientific article; zbMATH DE number 2119641 (Why is no real title available?)
- scientific article; zbMATH DE number 6297800 (Why is no real title available?)
- Optimal worst-case operations for implicit cache-oblivious search trees.
- Implicit \(B\)-trees: A new data structure for the dictionary problem
This page was built for publication: Optimal cache-oblivious implicit dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449185)
