Implicit data structures for fast search and update
From MaRDI portal
Publication:1146004
DOI10.1016/0022-0000(80)90037-9zbMath0446.68045OpenAlexW1992636056WikidataQ27077565 ScholiaQ27077565MaRDI QIDQ1146004
Publication date: 1980
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(80)90037-9
Related Items
An efficient implicit data structure for relation testing and searching in partially ordered sets, Binary search networks: A new method for key searching, 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, Searching among intervals and compact routing tables, Implicit \(B\)-trees: A new data structure for the dictionary problem, A compact data structure for representing a dynamic multiset, Searching rigid data structures, Implicit data structures for fast search and update, Efficient searching using partial ordering, A characterization of heaps and its applications, A pointer-free data structure for merging heaps and min-max heaps, A path integral approach to data structure evolution, An implicit data structure for searching a multikey table in logarithmic time, A new algorithmic framework for basic problems on binary images, Representing graphs implicitly using almost optimal space, Untangled monotonic chains and adaptive range search, An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time, Partial sums on the ultra-wide word RAM, Computing (and Life) Is All about Tradeoffs, A Survey on Priority Queues, Recursively rotated orders and implicit data structures: A lower bound, Partial match retrieval in implicit data structures, A tradeoff between search and update in dictionaries
Uses Software
Cites Work
