In this comprehensive survey, skiplists are praised for their simplicity, ease of implementation, and ability to match tree-based structures in performance. Various use cases for skiplists are explored, including their adaptation for multi-dimensional spaces, network overlays, and database indexing. The study also delves into systems that incorporate the probabilistic skip pattern of skiplists into their designs. This research sheds light on the versatility and efficiency of skiplists in modern applications. (Word count: 93)
https://arxiv.org/abs/2403.04582