The following pages link to Algorithms and Data Structures (Q5900747):
Displaying 15 items.
- A distribution-sensitive dictionary with low space overhead (Q414433) (← links)
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (Q579942) (← links)
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Recursively rotated orders and implicit data structures: A lower bound (Q792764) (← links)
- A tradeoff between search and update time for the implicit dictionary problem (Q1108806) (← links)
- A compact data structure for representing a dynamic multiset (Q1675822) (← links)
- Worst-case optimal tree layout in external memory (Q2354018) (← links)
- Optimal implicit dictionaries over unbounded universes (Q2432542) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Cache-oblivious implicit predecessor dictionaries with the working-set property (Q2904754) (← links)
- A Distribution-Sensitive Dictionary with Low Space Overhead (Q3183445) (← links)
- Array Layouts for Comparison-Based Searching (Q4577950) (← links)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations (Q5199262) (← links)
