Recursively rotated orders and implicit data structures: A lower bound
From MaRDI portal
Publication:792764
DOI10.1016/0304-3975(84)90013-6zbMath0537.68060OpenAlexW2043343347MaRDI QIDQ792764
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90013-6
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)
Related Items
A pointer-free data structure for merging heaps and min-max heaps ⋮ An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
Cites Work