An implicit data structure for searching a multikey table in logarithmic time
From MaRDI portal
Publication:1186547
DOI10.1016/0022-0000(91)90022-WzbMath0764.68019MaRDI QIDQ1186547
Amos Fiat, Jeanette P. Schmidt, Moni Naor, Alejandro A. Schäffer, J. Ian Munro, Alan R. Siegel
Publication date: 28 June 1992
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)
Related Items (3)
Implicit \(B\)-trees: A new data structure for the dictionary problem ⋮ A bounded-space tree traversal algorithm ⋮ On-the-Fly Array Initialization in Less Space
Cites Work
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Partial match retrieval in implicit data structures
- A tradeoff between search and update time for the implicit dictionary problem
- Implicit data structures for fast search and update
- Storing a sparse table
- On Edge Coloring Bipartite Graphs
- Multidimensional binary search trees used for associative searching
- Using euler partitions to edge color bipartite multigraphs
- On Representatives of Subsets
This page was built for publication: An implicit data structure for searching a multikey table in logarithmic time
