scientific article; zbMATH DE number 2079398
From MaRDI portal
Publication:4471357
Recommendations
- Optimal implicit dictionaries over unbounded universes
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- A tradeoff between search and update time for the implicit dictionary problem
- Optimal worst-case operations for implicit cache-oblivious search trees.
Cited in
(18)- An implicit data structure for searching a multikey table in logarithmic time
- A tradeoff between search and update in dictionaries
- 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 Distribution-Sensitive Dictionary with Low Space Overhead
- Implicit data structures for weighted elements
- scientific article; zbMATH DE number 3990869 (Why is no real title available?)
- scientific article; zbMATH DE number 140496 (Why is no real title available?)
- A distribution-sensitive dictionary with low space overhead
- scientific article; zbMATH DE number 2038720 (Why is no real title available?)
- Finger search in the implicit model
- scientific article; zbMATH DE number 6297800 (Why is no real title available?)
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- Optimal worst-case operations for implicit cache-oblivious search trees.
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- Recursively rotated orders and implicit data structures: A lower bound
- Bounded ordered dictionaries in O(log log N) time and O(n) space
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 Q4471357)
