On the public citation graph
Digital Search Trees Revisited
0 signed · 130 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/978-1-4757-1640-5openalex-snapshot
Problems and Theorems in Analysis
inferredcites →https://doi.org/10.1007/978-1-4757-5512-1openalex-snapshot
Integral Transforms and Their Applications
inferredcites →https://doi.org/10.1007/bf01934993openalex-snapshot
Approximate counting: A detailed analysis
inferredcites →https://doi.org/10.1016/0012-365x(73)90114-3openalex-snapshot
A note on growing binary trees
inferredcites →https://doi.org/10.1016/0304-3975(79)90009-4openalex-snapshot
The number of registers required for evaluating arithmetic expressions
inferredcites →https://doi.org/10.1145/362686.362693openalex-snapshot
File structures using hashing functions
inferredcites →https://doi.org/10.2307/2311171openalex-snapshot
An Introduction to the Theory of Numbers.
inferredcites →https://doi.org/10.2307/3609182openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
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(199701/03)10:1/2<157::aid-rsa8>3.0.co;2-uopenalex-snapshot
Probabilistic analysis of adaptative sampling
inferred← citeshttps://doi.org/10.1002/mma.1085openalex-snapshot
On the shape of the fringe of various types of random trees
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.3240050112openalex-snapshot
Multidimensional digital searching—alternative data structures
inferred← citeshttps://doi.org/10.1007/11534273_7openalex-snapshot
Analysis of a Class of Tries with Adaptive Multi-digit Branching
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_67openalex-snapshot
Some further results on digital search trees
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_44openalex-snapshot
Average complexity of additive properties for multiway tries: A unified approach
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_13openalex-snapshot
On an alternative sum useful in the analysis of some data structures
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_124openalex-snapshot
Do we really need to balance patricia tries?
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_15openalex-snapshot
Some Results on Tries with Adaptive Branching
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_18openalex-snapshot
Index Structures for Path Expressions
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_74openalex-snapshot
Analytic analysis of algorithms
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_76openalex-snapshot
The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0openalex-snapshot
Arbres pour l’Algorithmique
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/978-94-011-2058-6_47openalex-snapshot
How to Advance on a Stairway by Coin Flippings
inferred← citeshttps://doi.org/10.1007/bf00264363openalex-snapshot
An analysis of a contention resolution algorithm
inferred← citeshttps://doi.org/10.1007/bf01178735openalex-snapshot
The path length of random skip lists
inferred← citeshttps://doi.org/10.1007/bf02243826openalex-snapshot
A result in order statistics related to probabilistic counting
inferred← citeshttps://doi.org/10.1007/bfb0096984openalex-snapshot
On the analysis of probabilistic counting
inferred← citeshttps://doi.org/10.1007/pl00000132openalex-snapshot
Divide-and-conquer recurrences — classification of asymptotics
inferred← citeshttps://doi.org/10.1007/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/s00236-006-0019-7openalex-snapshot
Distances in random digital search trees
inferred← citeshttps://doi.org/10.1007/s002360050173openalex-snapshot
Analytic variations on bucket selection and sorting
inferred← citeshttps://doi.org/10.1007/s00453-001-0102-yopenalex-snapshot
An Experimental Study of Compression Methods for Dynamic Tries
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/s10955-006-9193-9openalex-snapshot
Phase Transition in a Generalized Eden Growth Model on a Tree
inferred← citeshttps://doi.org/10.1007/s11280-006-8557-zopenalex-snapshot
Answering XML Queries Using Path-Based Indexes: A Survey
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00141-iopenalex-snapshot
Combinatorics of geometrically distributed random variables: Left-to-right maxima
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90068-kopenalex-snapshot
Improved behaviour of tries by adaptive branching
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90070-popenalex-snapshot
A note on binomial recurrences arising in the analysis of algorithms
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90050-4openalex-snapshot
On the variance of the external path length in a symmetric digital trie
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90039-9openalex-snapshot
Some results on V-ary asymmetric tries
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90023-0openalex-snapshot
Further results on digital search trees
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90115-1openalex-snapshot
On the balance property of Patricia tries: External path length viewpoint
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90050-copenalex-snapshot
A characterization of digital search trees from the successful search viewpoint
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90262-eopenalex-snapshot
Probabilistic modeling of data structures on words
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00281-mopenalex-snapshot
Mellin transforms and asymptotics: Finite differences and Rice's integrals
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
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/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.aml.2011.11.017openalex-snapshot
Notes on protected nodes in digital search trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.06.008openalex-snapshot
On the average depth of asymmetric LC-tries
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00111-8openalex-snapshot
An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00101-3openalex-snapshot
On the average redundancy rate of the Lempel–Ziv code with the k-error protocol
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/s0304-3975(01)00415-7openalex-snapshot
Some results on tries with adaptive branching
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/s0306-4379(98)00029-5openalex-snapshot
The suffix-signature method for searching for phrases in text
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/s0963548314000741openalex-snapshot
Gaussian Distribution of Trie Depth for Strongly Tame Sources
inferred← citeshttps://doi.org/10.1023/a:1008801319428openalex-snapshot
Priority and Collision Detection with Active Signaling - The Channel Access Mechanism of HIPERLAN
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.1051/ita/1987210404791openalex-snapshot
Exact and asymptotic distributions in digital and binary search trees
inferred← citeshttps://doi.org/10.1051/ita/1991250100431openalex-snapshot
Approximate counting : an alternative approach
inferred← citeshttps://doi.org/10.1051/ita/1992260201631openalex-snapshot
On a tree collision resolution algorithm in presence of capture
inferred← citeshttps://doi.org/10.1051/ita/1996300605071openalex-snapshot
Digital search trees with keys of variable length
inferred← citeshttps://doi.org/10.1103/physreve.68.026103openalex-snapshot
Traveling front solutions to directed diffusion-limited aggregation, digital search trees, and the Lempel-Ziv data compression algorithm
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.1995.515516openalex-snapshot
Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile
inferred← citeshttps://doi.org/10.1109/dcc.2000.838177openalex-snapshot
On the average redundancy rate of the Lempel-Ziv code with k-error protocol
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.1109/iccsa.2009.27openalex-snapshot
Exploiting Path Indexes to Answer Complex Queries in Ontology Repository
inferred← citeshttps://doi.org/10.1109/iccvw.2011.6130219openalex-snapshot
Compressing Feature Sets with Digital Search Trees
inferred← citeshttps://doi.org/10.1109/isit.1995.531116openalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees
inferred← citeshttps://doi.org/10.1109/isit.2011.6033752openalex-snapshot
Codes for unordered sets of words
inferred← citeshttps://doi.org/10.1109/ivs.2009.5164480openalex-snapshot
Retrieval method of enormous POI in vehicle navigation system
inferred← citeshttps://doi.org/10.1112/s0025579300006409openalex-snapshot
On some applications of formulae of Ramanujan in the analysis of algorithms
inferred← citeshttps://doi.org/10.1137/0221069openalex-snapshot
External Internal Nodes in Digital Search Trees via Mellin Transforms
inferred← citeshttps://doi.org/10.1137/1.9781611973204.1openalex-snapshot
Typical Depth of a Digital Search Tree built on a general source
inferred← citeshttps://doi.org/10.1137/140977989openalex-snapshot
The Wiener Index of Random Digital Trees
inferred← citeshttps://doi.org/10.1137/s0097539790189368openalex-snapshot
Digital Search Trees Again Revisited: The Internal Path Length Perspective
inferred← citeshttps://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferred← citeshttps://doi.org/10.1137/s0097539796301811openalex-snapshot
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1142/9789812567673_0016openalex-snapshot
Applications of Stein's method in the analysis of random binary search trees
inferred← citeshttps://doi.org/10.1142/s0129054193000055openalex-snapshot
MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/195058.195456openalex-snapshot
A functional equation often arising in the analysis of algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/225058.225287openalex-snapshot
A fully-dynamic data structure for external substring search
inferred← citeshttps://doi.org/10.1214/aoap/1034968150openalex-snapshot
The number of winners in a discrete geometrically distributed sample
inferred← citeshttps://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
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.3115/980451.980885openalex-snapshot
PAT-trees with the deletion function as the learning device for linguistic patterns
inferred← citeshttps://doi.org/10.3115/980845.980885openalex-snapshot
PAT-trees with the deletion function as the learning device for linguistic patterns
inferred← citeshttps://doi.org/10.37236/1231openalex-snapshot
A Symmetric Functions Approach to Stockhausen's Problem
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.281openalex-snapshot
Asymptotic normality of recursive algorithms via martingale difference arrays
inferred← citeshttps://doi.org/10.46298/dmtcs.2980openalex-snapshot
Approximate Counting via the Poisson-Laplace-Mellin Method
inferred← citeshttps://doi.org/10.46298/dmtcs.498openalex-snapshot
Asymptotic variance of random symmetric digital search trees
inferred← citeshttps://doi.org/10.46298/dmtcs.557openalex-snapshot
Digital search trees with m trees: Level polynomials and insertion costs
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1471openalex-snapshot
On protected nodes in Digital Search Trees
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00578openalex-snapshot
Errata and Addenda to Mathematical Constants
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15791openalex-snapshot
Philippe Flajolet's early work in combinatorics
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.5220/0001336100610068openalex-snapshot
ON DIGITAL SEARCH TREES - A Simple Method for Constructing Balanced Binary Trees
inferred← citeshttps://doi.org/10.5281/zenodo.23138274openalex-snapshot
An integer-visiting process with real multipliers: coverage and rates
inferred← citeshttps://doi.org/10.5445/ir/1000085031openalex-snapshot
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
inferred← citeshttps://doi.org/10.54550/eca2022v2s1h1openalex-snapshot
Philippe Flajolet's early work in combinatorics
inferred← citeshttps://doi.org/10.5555/338219.338251openalex-snapshot
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
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.