Abstract
The unified property specifies that a comparison-based search structure can quickly find an element nearby a recently accessed element. lacono [Iac01] introduced this property and developed a static search structure that achieves the bound. We present a dynamic search structure that achieves the unified property and that is simpler than Iacono's structure. Among all comparison-based dynamic search structures, our structure has the best proved bound on running time. © Springer-Verlag 2004.
Cite
CITATION STYLE
Bǎdoiu, M., & Demaine, E. D. (2004). A simplified and dynamic unified structure. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 466–473. https://doi.org/10.1007/978-3-540-24698-5_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
