A limit theory for random skip lists
From MaRDI portal
Recommendations
- On Limit Distributions of Randomly Indexed Random Sequences
- On limit distributions of randomly indexed random sequences
- SOME RESULTS FOR SKIP-FREE RANDOM WALK
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations
- scientific article; zbMATH DE number 714511
- scientific article; zbMATH DE number 3883310
Cited in
(18)- The binomial transform and its application to the analysis of skip lists
- Average search and update costs in skip lists
- Skip lift: a probabilistic alternative to red-black trees
- Gap-free compositions and gap-free samples of geometric random variables
- Skip trees, an alternative data structure to skip lists in a concurrent approach
- Combinatorics of geometrically distributed random variables: Left-to-right maxima
- Analysis of the expected search cost in skip lists
- A design of a parallel dictionary using skip lists
- From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
- On the search path length of random binary skip graphs
- Visibility problems related to skip lists
- Asymptotic properties of a leader election algorithm
- The number of distinct values in a geometrically distributed sample
- Formal verification of skiplists with arbitrary many levels
- Analysis of a new skip list variant
- Combinatorics of geometrically distributed random variables: Run statistics
- The binomial transform and the analysis of skip lists
- Analysis of an optimized search algorithm for skip lists
This page was built for publication: A limit theory for random skip lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201316)
