Online List Labeling with Near-Logarithmic Writes
Martin P. Seybold

TL;DR
This paper introduces a skip-list based algorithm for online list labeling that achieves near-logarithmic expected amortized writes per update, improving efficiency in dynamic ordered data management.
Contribution
It presents a novel skip-list based approach for online list labeling with near-logarithmic write complexity, a significant improvement over previous methods.
Findings
Expected amortized writes are $O(rac{1}{ ext{epsilon}} imes ext{log}(n) imes ext{poly}( ext{log} ext{log} n))$ per update.
The algorithm maintains order against an oblivious adversary efficiently.
Provides theoretical bounds on write complexity for dynamic list management.
Abstract
In the Online List Labeling problem, a set of elements from a totally ordered universe must be stored in sorted order in an array with slots, where is constant, while an adversary chooses elements that must be inserted and deleted from the set. We devise a skip-list based algorithm for maintaining order against an oblivious adversary and show that the expected amortized number of writes is per update.
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
TopicsGraph Labeling and Dimension Problems
