On the public citation graph
Trie partitioning process: Limiting distributions
0 signed · 97 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10885-8_45openalex-snapshot
The grid file: An adaptable, symmetric multi-key file structure
inferredcites →https://doi.org/10.1007/3-540-12727-5_13openalex-snapshot
Digital search trees and the generation of an exponentially distributed variate
inferredcites →https://doi.org/10.1007/978-3-642-50824-0openalex-snapshot
Vorlesungen über Differenzenrechnung
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_16openalex-snapshot
Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bfb0012773openalex-snapshot
A branching process arising in dynamic hashing, trie searching and polynomial factorization
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/s0304-0208(08)73107-4openalex-snapshot
Algebraic Methods for Trie Statistics
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1109/sfcs.1983.79openalex-snapshot
Tree structures for partial match retrieval
inferredcites →https://doi.org/10.1109/tit.1985.1057014openalex-snapshot
Analysis of a stack algorithm for random multiple-access communication
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/1909504openalex-snapshot
An Introduction to Probability Theory and its Applications. Vol. 1, 2nd Edition
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(199612)9:4<379::aid-rsa3>3.0.co;2-uopenalex-snapshot
Analysis of a splitting process arising in probabilistic counting and other related algorithms
inferred← citeshttps://doi.org/10.1002/rsa.10015openalex-snapshot
Size and path length of Patricia tries: Dynamical sources context
inferred← citeshttps://doi.org/10.1002/rsa.20023openalex-snapshot
On the number of full levels in tries
inferred← citeshttps://doi.org/10.1002/rsa.20067openalex-snapshot
Probabilistic behavior of asymmetric level compressed tries
inferred← citeshttps://doi.org/10.1002/rsa.3240030209openalex-snapshot
A note on the probabilistic analysis of patricia trees
inferred← citeshttps://doi.org/10.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferred← citeshttps://doi.org/10.1002/rsa.3240050505openalex-snapshot
Trie size in a dynamic list structure
inferred← citeshttps://doi.org/10.1007/10719839_31openalex-snapshot
Heights in Generalized Tries and PATRICIA Tries
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_17openalex-snapshot
Discs and other related data structures
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_18openalex-snapshot
Digital data structures and order statistics
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_100openalex-snapshot
Trie size in a dynamic list structure
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_58openalex-snapshot
The analysis of linear probing hashing with buckets
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0openalex-snapshot
Arbres pour l’Algorithmique
inferred← citeshttps://doi.org/10.1007/978-3-642-13911-6_3openalex-snapshot
Advancing Search Query Autocompletion Services with More and Better Suggestions
inferred← citeshttps://doi.org/10.1007/978-3-642-86726-2_13openalex-snapshot
Analytic Models for Tree Communication Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_7openalex-snapshot
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms
inferred← citeshttps://doi.org/10.1007/bf01759045openalex-snapshot
On the height of digital trees and related problems
inferred← citeshttps://doi.org/10.1007/bf02574372openalex-snapshot
Search costs in quadtrees and singularity perturbation asymptotics
inferred← citeshttps://doi.org/10.1007/bf02679623openalex-snapshot
Dynamical sources in information theory: A general analysis of trie structures
inferred← citeshttps://doi.org/10.1007/bfb0028265openalex-snapshot
What can we learn about suffix trees from independent tries?
inferred← citeshttps://doi.org/10.1007/pl00009208openalex-snapshot
The Analysis of Linear Probing Hashing with Buckets
inferred← citeshttps://doi.org/10.1007/s00026-009-0002-4openalex-snapshot
On Tries, Contention Trees and Their Analysis
inferred← citeshttps://doi.org/10.1007/s00236-004-0148-9openalex-snapshot
The size of random bucket trees via urn models
inferred← citeshttps://doi.org/10.1007/s002360050173openalex-snapshot
Analytic variations on bucket selection and sorting
inferred← citeshttps://doi.org/10.1007/s00453-004-1137-7openalex-snapshot
Universal Asymptotics for Random Tries and PATRICIA Trees
inferred← citeshttps://doi.org/10.1007/s00453-006-0106-8openalex-snapshot
Asymptotics of the Moments of Extreme-Value Related Distribution Functions
inferred← citeshttps://doi.org/10.1007/s10959-016-0700-xopenalex-snapshot
On the Variety of Shapes in Digital Trees
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90065-5openalex-snapshot
Autocorrelation on words and its applications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00306-4openalex-snapshot
On the variance of a class of inductive valuations of data structures for digital search
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.04.001openalex-snapshot
The expected profile of digital search trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.007openalex-snapshot
Renewal theory in the analysis of tries and strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.024openalex-snapshot
An analytic approach to the asymptotic variance of trie statistics and related structures
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00365-2openalex-snapshot
Expected worst-case partial match in random quadtries
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00210-9openalex-snapshot
A multivariate view of random bucket digital search trees
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00212-2openalex-snapshot
Limit laws for the height in PATRICIA tries
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00415-7openalex-snapshot
Some results on tries with adaptive branching
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00167-9openalex-snapshot
Analytical depoissonization and its applications
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00458-7openalex-snapshot
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
inferred← citeshttps://doi.org/10.1017/jpr.2017.56openalex-snapshot
Dependence between path-length and size in random digital trees
inferred← citeshttps://doi.org/10.1017/s0963548304006200openalex-snapshot
Concentration of Size and Path Length of Tries
inferred← citeshttps://doi.org/10.1023/a:1023837529522openalex-snapshot
On Time-Space Efficiency of Digital Trees with Adaptive Multidigit Branching
inferred← citeshttps://doi.org/10.1109/18.133271openalex-snapshot
Analysis of digital tries with Markovian dependency
inferred← citeshttps://doi.org/10.1109/18.370149openalex-snapshot
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
inferred← citeshttps://doi.org/10.1109/dcc.2002.999975openalex-snapshot
Improved behaviour of tries by the "symmetrization" of the source
inferred← citeshttps://doi.org/10.1137/0218054openalex-snapshot
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
inferred← citeshttps://doi.org/10.1137/0406016openalex-snapshot
Limiting Distribution for the Depth in PATRICIA Tries
inferred← citeshttps://doi.org/10.1137/1.9781611973082.15openalex-snapshot
On Buffon Machines and Numbers
inferred← citeshttps://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferred← citeshttps://doi.org/10.1142/9789812835291_0018openalex-snapshot
ON SOME NON-LINEAR RECURRENCES THAT ARISE IN COMPUTER SCIENCE
inferred← citeshttps://doi.org/10.1145/1103963.1103965openalex-snapshot
Exact distribution of individual displacements in linear probing hashing
inferred← citeshttps://doi.org/10.1214/105051605000000106openalex-snapshot
The oscillatory distribution of distances in random tries
inferred← citeshttps://doi.org/10.1214/105051605000000494openalex-snapshot
A probabilistic analysis of some tree algorithms
inferred← citeshttps://doi.org/10.1214/aoap/1035463332openalex-snapshot
On the distribution for the duration of a randomized leader election algorithm
inferred← citeshttps://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
inferred← citeshttps://doi.org/10.37236/1302openalex-snapshot
Analysis of an Asymmetric Leader Election Algorithm
inferred← citeshttps://doi.org/10.37236/1517openalex-snapshot
A Note on the Asymptotic Behavior of the Heights in $b$-Tries for $b$ Large
inferred← citeshttps://doi.org/10.46298/dmtcs.301openalex-snapshot
The Stack-Size of Combinatorial Tries Revisited
inferred← citeshttps://doi.org/10.46298/dmtcs.3376openalex-snapshot
Analysis of tree algorithm for collision resolution
inferred← citeshttps://doi.org/10.46298/dmtcs.3386openalex-snapshot
Distributional analysis of Robin Hood linear probing hashing with buckets
inferred← citeshttps://doi.org/10.46298/dmtcs.519openalex-snapshot
Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets
inferred← citeshttps://doi.org/10.46298/dmtcs.555openalex-snapshot
The Variance of the Profile in Digital Search Trees
inferred← citeshttps://doi.org/10.48550/arxiv.0912.2174openalex-snapshot
Renewal theory in analysis of tries and strings
inferred← citeshttps://doi.org/10.48550/arxiv.1604.08658openalex-snapshot
Dependence between External Path-Length and Size in Random Tries
inferred← citeshttps://doi.org/10.5555/1283383.1283479openalex-snapshot
Multiple choice tries and distributed hash tables
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.