
TL;DR
This paper introduces todolists, a novel variant of skiplists that achieves improved search comparison bounds and efficient updates, with experimental results showing competitive insertion times and superior search performance.
Contribution
We propose todolists, a new skiplist variant with better theoretical comparison bounds and practical efficiency, especially in search operations.
Findings
Todolists perform comparably to standard dictionaries in insertions.
Todolists outperform other structures in search times.
Achieves near-optimal comparison bounds for searches.
Abstract
We describe todolists (top-down skiplists), a variant of skiplists (Pugh 1990) that can execute searches using at most binary comparisons per search and that have amortized update time . A variant of todolists, called working-todolists, can execute a search for any element using binary comparisons and have amortized search time . Here, is the "working-set number" of . No previous data structure is known to achieve a bound better than comparisons. We show through experiments that, if implemented carefully, todolists are comparable to other common dictionary implementations in terms of insertion times and outperform them in terms of search times.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWeb Data Mining and Analysis · Algorithms and Data Compression · Natural Language Processing Techniques
