Pages that link to "Item:Q3962473"
From MaRDI portal
The following pages link to Implicit Data Structures for the Dictionary Problem (Q3962473):
Displayed 15 items.
- 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)
- A bounded-space tree traversal algorithm (Q689629) (← links)
- Recursively rotated orders and implicit data structures: A lower bound (Q792764) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- Designing networks with compact routing tables (Q1104109) (← links)
- A tradeoff between search and update time for the implicit dictionary problem (Q1108806) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Improved bounds for finger search on a RAM (Q1950391) (← 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 on Priority Queues (Q2848973) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)