An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
From MaRDI portal
Publication:579942
DOI10.1016/0022-0000(86)90043-7zbMath0625.68044OpenAlexW2156305878MaRDI QIDQ579942
Publication date: 1986
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(86)90043-7
Related Items (27)
Optimal In-place Algorithms for Basic Graph Problems ⋮ An efficient implicit data structure for relation testing and searching in partially ordered sets ⋮ Sorting multisets stably in minimum space ⋮ In-place algorithms for computing (Layers of) maxima ⋮ A Distribution-Sensitive Dictionary with Low Space Overhead ⋮ Line-segment intersection made in-place ⋮ Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ Implicit \(B\)-trees: A new data structure for the dictionary problem ⋮ On compressing and indexing repetitive sequences ⋮ Space-efficient data-analysis queries on grids ⋮ A distribution-sensitive dictionary with low space overhead ⋮ 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 ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ A bounded-space tree traversal algorithm ⋮ Representing graphs implicitly using almost optimal space ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Sorting multisets stably in minimum space ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Computing (and Life) Is All about Tradeoffs ⋮ A Survey on Priority Queues ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ On-the-Fly Array Initialization in Less Space ⋮ A tradeoff between search and update in dictionaries
Uses Software
Cites Work
This page was built for publication: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
