Pages that link to "Item:Q1108806"
From MaRDI portal
The following pages link to A tradeoff between search and update time for the implicit dictionary problem (Q1108806):
Displayed 8 items.
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- The number of tests required to search an unordered table (Q1014399) (← links)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- A data structure for lattice representation (Q1392212) (← links)
- A tradeoff between search and update in dictionaries (Q1607123) (← links)
- An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)