On the public citation graph
Asymptotic variance of random symmetric digital search trees
0 signed · 95 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.1002/9781118032770openalex-snapshot
Average Case Analysis of Algorithms on Sequences
inferredcites →https://doi.org/10.1002/mma.1085openalex-snapshot
On the shape of the fringe of various types of random trees
inferredcites →https://doi.org/10.1002/rsa.10010openalex-snapshot
On a multivariate contraction method for random recursive structures with applications to Quicksort
inferredcites →https://doi.org/10.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferredcites →https://doi.org/10.1006/eujc.1997.0179openalex-snapshot
On Convergence Rates in the Central Limit Theorems for Combinatorial Structures
inferredcites →https://doi.org/10.1007/3-540-16761-7_67openalex-snapshot
Some further results on digital search trees
inferredcites →https://doi.org/10.1007/978-3-211-75357-6openalex-snapshot
Random trees : an interplay between combinatorics and probability
inferredcites →https://doi.org/10.1007/bf00318784openalex-snapshot
A diffusion limit for a class of randomly-growing binary trees
inferredcites →https://doi.org/10.1007/s00453-001-0053-3openalex-snapshot
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
inferredcites →https://doi.org/10.1007/s10955-006-9193-9openalex-snapshot
Phase Transition in a Generalized Eden Growth Model on a Tree
inferredcites →https://doi.org/10.1007/s236-002-8034-5openalex-snapshot
The variance of the height of digital search trees
inferredcites →https://doi.org/10.1016/0012-365x(73)90114-3openalex-snapshot
A note on growing binary trees
inferredcites →https://doi.org/10.1016/0016-0032(54)90080-0openalex-snapshot
Higher transcendental functions
inferredcites →https://doi.org/10.1016/0020-0190(88)90137-8openalex-snapshot
The evaluation of an alternative sum with applications to the analysis of some data structures
inferredcites →https://doi.org/10.1016/0167-7136(83)90284-6openalex-snapshot
The complexity of generating an exponentially distributed variate
inferredcites →https://doi.org/10.1016/0196-6774(86)90014-3openalex-snapshot
The complexity of generating an exponentially distributed variate
inferredcites →https://doi.org/10.1016/0304-3975(88)90023-0openalex-snapshot
Further results on digital search trees
inferredcites →https://doi.org/10.1016/0304-3975(91)90050-copenalex-snapshot
A characterization of digital search trees from the successful search viewpoint
inferredcites →https://doi.org/10.1016/0304-3975(92)90371-lopenalex-snapshot
Hypothetical analyses: approximate counting in the style of Knuth, path length in the style of Flajolet
inferredcites →https://doi.org/10.1016/0304-3975(94)00281-mopenalex-snapshot
Mellin transforms and asymptotics: Finite differences and Rice's integrals
inferredcites →https://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
inferredcites →https://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
inferredcites →https://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferredcites →https://doi.org/10.1016/s0196-6774(02)00208-0openalex-snapshot
An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
inferredcites →https://doi.org/10.1016/s0196-6774(02)00210-9openalex-snapshot
A multivariate view of random bucket digital search trees
inferredcites →https://doi.org/10.1016/s0196-6774(02)00293-6openalex-snapshot
Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
inferredcites →https://doi.org/10.1016/s0304-3975(97)00167-9openalex-snapshot
Analytical depoissonization and its applications
inferredcites →https://doi.org/10.1016/s0304-3975(98)00213-8openalex-snapshot
On the variance of the internal path length of generalized digital trees – The Mellin convolution approach
inferredcites →https://doi.org/10.1016/s0304-3975(98)00220-5openalex-snapshot
Singularity analysis and asymptotics of Bernoulli sums
inferredcites →https://doi.org/10.1017/s0001867800015603openalex-snapshot
Paths in a random digital tree: limiting distributions
inferredcites →https://doi.org/10.1017/s0001867800015846openalex-snapshot
On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
inferredcites →https://doi.org/10.1017/s0080456800012163openalex-snapshot
XV.—The Correlation between Relatives on the Supposition of Mendelian Inheritance.
inferredcites →https://doi.org/10.1038/106531c0openalex-snapshot
A Course of Modern Analysis: An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions
inferredcites →https://doi.org/10.1051/ita/1987210404791openalex-snapshot
Exact and asymptotic distributions in digital and binary search trees
inferredcites →https://doi.org/10.1103/physrevb.31.4319openalex-snapshot
Directed aggregation on the Bethe lattice: Scaling, mappings, and universality
inferredcites →https://doi.org/10.1109/18.370149openalex-snapshot
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
inferredcites →https://doi.org/10.1109/18.52494openalex-snapshot
Analysis of a stack algorithm for CSMA-CD random length packet communication
inferredcites →https://doi.org/10.1112/s0025579300006409openalex-snapshot
On some applications of formulae of Ramanujan in the analysis of algorithms
inferredcites →https://doi.org/10.1137/0221069openalex-snapshot
External Internal Nodes in Digital Search Trees via Mellin Transforms
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.1137/1.9781611973068.15openalex-snapshot
(Un)Expected Behavior of Digital Search Tree Profile
inferredcites →https://doi.org/10.1137/s0097539790189368openalex-snapshot
Digital Search Trees Again Revisited: The Internal Path Length Perspective
inferredcites →https://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferredcites →https://doi.org/10.1137/s0097539796301811openalex-snapshot
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
inferredcites →https://doi.org/10.1137/s0097539799356812openalex-snapshot
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
inferredcites →https://doi.org/10.1145/1240233.1240235openalex-snapshot
Phase changes in random point quadtrees
inferredcites →https://doi.org/10.1145/362686.362693openalex-snapshot
File structures using hashing functions
inferredcites →https://doi.org/10.1201/9781439864548openalex-snapshot
Asymptotics and Special Functions
inferredcites →https://doi.org/10.1214/009117906000000232openalex-snapshot
Rounding of continuous random variables and oscillatory asymptotics
inferredcites →https://doi.org/10.1214/105051606000000862openalex-snapshot
Renewals for exponentially increasing lifetimes, with an application to digital search trees
inferredcites →https://doi.org/10.1214/aoap/1075828056openalex-snapshot
A general limit theorem for recursive algorithms and combinatorial structures
inferredcites →https://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
inferredcites →https://doi.org/10.1214/ejp.v6-76openalex-snapshot
Limit Theorems for the Number of Maxima in Random Samples from Planar Regions
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2972291openalex-snapshot
A Course of Modern Analysis. An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions.
inferredcites →https://doi.org/10.46298/dmtcs.281openalex-snapshot
Asymptotic normality of recursive algorithms via martingale difference arrays
inferredcites →https://doi.org/10.46298/dmtcs.369openalex-snapshot
A survey of multivariate aspects of the contraction method
inferredcites →https://doi.org/10.5555/1496770.1496785openalex-snapshot
Un)expected behavior of digital search tree profile
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20979openalex-snapshot
Node profiles of symmetric digital search trees: Concentration properties
inferred← citeshttps://doi.org/10.1007/s10959-016-0700-xopenalex-snapshot
On the Variety of Shapes in Digital Trees
inferred← citeshttps://doi.org/10.1007/s40009-018-0778-zopenalex-snapshot
Leaves in a Particular Class of Trees
inferred← citeshttps://doi.org/10.1016/j.aml.2011.11.017openalex-snapshot
Notes on protected nodes in digital search trees
inferred← citeshttps://doi.org/10.1016/j.indag.2012.11.001openalex-snapshot
Words with a generalized restricted growth property
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.016openalex-snapshot
Approximate counting with m counters: A detailed analysis
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/j.tcs.2016.02.007openalex-snapshot
On 2-protected nodes in random digital trees
inferred← citeshttps://doi.org/10.1017/jpr.2016.96openalex-snapshot
From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
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.1051/ita/2017002openalex-snapshot
Analysis of digital search trees incorporated with paging
inferred← citeshttps://doi.org/10.1137/1.9781611973761.9openalex-snapshot
Variance of Size in Regular Graph Tries
inferred← citeshttps://doi.org/10.1137/1.9781611974775.12openalex-snapshot
External Profile of Symmetric Digital Search Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1137/130916357openalex-snapshot
Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
inferred← citeshttps://doi.org/10.1137/140977989openalex-snapshot
The Wiener Index of Random Digital Trees
inferred← citeshttps://doi.org/10.1145/3009909openalex-snapshot
Generating Random Permutations by Coin Tossing
inferred← citeshttps://doi.org/10.1239/jap/1421763322openalex-snapshot
A Binomial Splitting Process in Connection with Corner Parking Problems
inferred← citeshttps://doi.org/10.13069/jacodesmath.36015openalex-snapshot
Approximate counting with m counters: A probabilistic analysis
inferred← citeshttps://doi.org/10.21248/gups.62402openalex-snapshot
On rates of convergence in the probabilistic analysis of algorithms
inferred← citeshttps://doi.org/10.2298/aadm150619013fopenalex-snapshot
Limit behavior of maxima in geometric words representing set partitions
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-12openalex-snapshot
Protected node profile of Tries
inferred← citeshttps://doi.org/10.37236/3763openalex-snapshot
A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries
inferred← citeshttps://doi.org/10.4213/tvp5455openalex-snapshot
Normal limit law for protected node profile of random recursive trees
inferred← citeshttps://doi.org/10.4230/lipics.aofa.2018.35openalex-snapshot
The Depoissonisation Quintet: Rice-Poisson-Mellin-Newton-Laplace
inferred← citeshttps://doi.org/10.46298/dmtcs.2980openalex-snapshot
Approximate Counting via the Poisson-Laplace-Mellin Method
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1471openalex-snapshot
On protected nodes in Digital Search Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1505.07321openalex-snapshot
A Limit Theorem for Radix Sort and Tries with Markovian Input
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.48550/arxiv.2001.00578openalex-snapshot
Errata and Addenda to Mathematical Constants
inferred← citeshttps://doi.org/10.48550/arxiv.2002.02809openalex-snapshot
Recursive PGFs for BSTs and DSTs
inferred← citeshttps://doi.org/10.5281/zenodo.23138274openalex-snapshot
An integer-visiting process with real multipliers: coverage and rates
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.