Implicit data structures for fast search and update
From MaRDI portal
Cites work
Cited in
(26)- Binary search networks: A new method for key searching
- Untangled monotonic chains and adaptive range search
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- A path integral approach to data structure evolution
- Searching rigid data structures
- A compact data structure for representing a dynamic multiset
- Implicit data structures for fast search and update
- A characterization of heaps and its applications
- Recursively rotated orders and implicit data structures: A lower bound
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- A pointer-free data structure for merging heaps and min-max heaps
- Efficient searching using partial ordering
- Searching among intervals and compact routing tables
- Designing networks with compact routing tables
- A tradeoff between search and update time for the implicit dictionary problem
- An implicit data structure for searching a multikey table in logarithmic time
- Representing graphs implicitly using almost optimal space
- A tradeoff between search and update in dictionaries
- Partial sums on the ultra-wide word RAM
- Searching among intervals and compact routing tables
- Computing (and Life) Is All about Tradeoffs
- Partial match retrieval in implicit data structures
- Tables
- A survey on priority queues
- An efficient implicit data structure for relation testing and searching in partially ordered sets
- A new algorithmic framework for basic problems on binary images
This page was built for publication: Implicit data structures for fast search and update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146004)
