On the public citation graph

The path length of random skip lists

0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferredcites →https://doi.org/10.1007/bf01994884openalex-snapshot
Average search and update costs in skip lists
inferredcites →https://doi.org/10.1007/bf02241658openalex-snapshot
Yet another application of a binomial recurrence order statistics
inferredcites →https://doi.org/10.1007/bf02243826openalex-snapshot
A result in order statistics related to probabilistic counting
inferredcites →https://doi.org/10.1007/bfb0078599openalex-snapshot
Zur Auswertung Gewisser Numerischer Reihen Mit Hilfe Modularer Funktionen
inferredcites →https://doi.org/10.1016/0166-218x(89)90050-4openalex-snapshot
On the variance of the external path length in a symmetric digital trie
inferredcites →https://doi.org/10.1016/0304-3975(89)90115-1openalex-snapshot
On the balance property of Patricia tries: External path length viewpoint
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferredcites →https://doi.org/10.1017/9781009004091openalex-snapshot
A Course of Modern Analysis
inferredcites →https://doi.org/10.1021/ja02004a022openalex-snapshot
A COURSE IN MODERN ANALYSIS.
inferredcites →https://doi.org/10.1137/0215054openalex-snapshot
Digital Search Trees Revisited
inferredcites →https://doi.org/10.1137/s0097539790189368openalex-snapshot
Digital Search Trees Again Revisited: The Internal Path Length Perspective
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.1214/aoap/1177005651openalex-snapshot
A Limit Theory for Random Skip Lists

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<319::aid-rsa7>3.0.co;2-yopenalex-snapshot
Normal approximations of the number of records in geometrically distributed random variables
inferred← citeshttps://doi.org/10.1007/10719839_45openalex-snapshot
Run Statistics for Geometrically Distributed Random Variables
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_7openalex-snapshot
Words, Permutations, and Representations of Numbers
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_170openalex-snapshot
The binomial transform and its application to the analysis of skip lists
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_4openalex-snapshot
Parallel Update and Search in Skip Lists
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_35openalex-snapshot
The Number of Descents in Samples of Geometric Random Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_8openalex-snapshot
On the Cost of Persistence and Authentication in Skip Lists
inferred← citeshttps://doi.org/10.1007/s00026-001-8010-zopenalex-snapshot
Combinatorics of Geometrically Distributed Random Variables: Inversions and a Parameter of Knuth
inferred← citeshttps://doi.org/10.1007/s13369-016-2288-yopenalex-snapshot
Fair Priority Scheduling (FPS): A Process Scheduling Algorithm Based on Skip Ring Data Structure
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00288-6openalex-snapshot
A design of a parallel dictionary using skip lists
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00296-uopenalex-snapshot
Analysis of an optimized search algorithm for skip lists
inferred← citeshttps://doi.org/10.1016/j.spl.2008.11.008openalex-snapshot
The average position of the dth maximum in a sample of geometric random variables
inferred← citeshttps://doi.org/10.1016/j.spl.2017.01.017openalex-snapshot
Geometric random variables: Descents following maxima
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.041openalex-snapshot
The binomial transform and the analysis of skip lists
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00641-2openalex-snapshot
Combinatorics of geometrically distributed random variables: run statistics
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00465-4openalex-snapshot
Runs of geometrically distributed random variables: a probabilistic analysis
inferred← citeshttps://doi.org/10.1051/ita/1997310302511openalex-snapshot
Skip trees, an alternative data structure to skip lists in a concurrent approach
inferred← citeshttps://doi.org/10.1080/00150517.1994.12429189openalex-snapshot
Some Information about the Binomial Transform
inferred← citeshttps://doi.org/10.1089/cmb.2013.0032openalex-snapshot
Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures
inferred← citeshttps://doi.org/10.1093/comjnl/40.4.183openalex-snapshot
Contemporary Access Structures Under Mixed Workloads
inferred← citeshttps://doi.org/10.1142/s0218126618502183openalex-snapshot
Pyramid Search: Skip Ring Data Structure-Based New Searching Algorithm
inferred← citeshttps://doi.org/10.1145/1011767.1011785openalex-snapshot
Load balancing and locality in range-queriable data structures
inferred← citeshttps://doi.org/10.1145/1290672.1290674openalex-snapshot
Skip graphs
inferred← citeshttps://doi.org/10.1145/2902251.2902276openalex-snapshot
Anti-Persistence on Persistent Storage
inferred← citeshttps://doi.org/10.1145/299649.299679openalex-snapshot
Using randomization in the teaching of data structures and algorithms
inferred← citeshttps://doi.org/10.1145/3034786.3056117openalex-snapshot
Write-Optimized Skip Lists
inferred← citeshttps://doi.org/10.1201/9780203323687.ch40openalex-snapshot
Distributed Data Structures for Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070220openalex-snapshot
Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search
inferred← citeshttps://doi.org/10.15215/aupress/9781927356388.01openalex-snapshot
Open Data Structures: An Introduction
inferred← citeshttps://doi.org/10.15215/aupress/9781927356395.01openalex-snapshot
Open Data Structures: An Introduction
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2705092/v1openalex-snapshot
Skip (Insertion) Sort, Skip List Based New and Very Efficient Sorting Algorithm
inferred← citeshttps://doi.org/10.2298/aadm0802234popenalex-snapshot
Records in geometrically distributed words: Sum of positions
inferred← citeshttps://doi.org/10.3390/math10132313openalex-snapshot
Multiple q-Integral and Records from Geometrically Distributed Sequences
inferred← citeshttps://doi.org/10.37236/1231openalex-snapshot
A Symmetric Functions Approach to Stockhausen's Problem
inferred← citeshttps://doi.org/10.37236/1265openalex-snapshot
A Note on Alternating Sums
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2018.9openalex-snapshot
Lock-Free Search Data Structures: Throughput Modeling with Poisson Processes
inferred← citeshttps://doi.org/10.46298/dmtcs.3476openalex-snapshot
Analysis of a new skip list variant
inferred← citeshttps://doi.org/10.46298/dmtcs.363openalex-snapshot
The first descent in samples of geometric random variables and permutations
inferred← citeshttps://doi.org/10.46298/dmtcs.386openalex-snapshot
A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
inferred← citeshttps://doi.org/10.48550/arxiv.math-ph/0608049openalex-snapshot
A Set of Identities for a Class of Alternating Binomial Sums Arising in Computing Applications
inferred← citeshttps://doi.org/10.5120/ijca2017913112openalex-snapshot
A New Improved Circular Skip List with Priority Search
inferred← citeshttps://doi.org/10.6688/jise.2011.27.3.14openalex-snapshot
Alternating Runs of Geometrically Distributed Random Variables
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.