Pages that link to "Item:Q2432542"
From MaRDI portal
The following pages link to Optimal implicit dictionaries over unbounded universes (Q2432542):
Displaying 10 items.
- 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)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Implicit data structures for linear hashing schemes (Q1116689) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- (Q3484345) (← links)
- (Q4449185) (← links)
- Algorithms and Data Structures (Q5900747) (← links)