Pages that link to "Item:Q800083"
From MaRDI portal
The following pages link to Partial match retrieval in implicit data structures (Q800083):
Displaying 8 items.
- 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)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- A data structure for lattice representation (Q1392212) (← 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)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
