On the public citation graph
Dynamical sources in information theory: A general analysis of trie structures
0 signed · 142 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/(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
inferredcites →https://doi.org/10.1007/3-540-63397-9_37openalex-snapshot
Algorithms for computing signs of 2 x 2 determinants: Dynamics and average-case analysis
inferredcites →https://doi.org/10.1007/978-3-642-53393-8openalex-snapshot
Perturbation theory for linear operators
inferredcites →https://doi.org/10.1007/978-3-642-61310-4_2openalex-snapshot
Asymptotic Methods in Analysis
inferredcites →https://doi.org/10.1007/978-3-642-66282-9openalex-snapshot
Perturbation Theory for Linear Operators
inferredcites →https://doi.org/10.1007/bf00264248openalex-snapshot
A probabilistic analysis of the height of tries and of the complexity of triesort
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf01232667openalex-snapshot
Dynamics of the continued fraction map and the spectral theory of SL (2, Z)
inferredcites →https://doi.org/10.1007/bf01562537openalex-snapshot
Spectral properties of certain composition operators arising in statistical mechanics
inferredcites →https://doi.org/10.1007/bf01759045openalex-snapshot
On the height of digital trees and related problems
inferredcites →https://doi.org/10.1007/bf02679622openalex-snapshot
Dynamical sources in information theory: Fundamental intervals and word prefixes
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.1007/bfb0022669openalex-snapshot
Trie partitioning process: Limiting distributions
inferredcites →https://doi.org/10.1007/pl00009246openalex-snapshot
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
inferredcites →https://doi.org/10.1016/0012-365x(95)00141-iopenalex-snapshot
Combinatorics of geometrically distributed random variables: Left-to-right maxima
inferredcites →https://doi.org/10.1016/0020-0190(80)90008-3openalex-snapshot
A note on the analysis of extendible hashing
inferredcites →https://doi.org/10.1016/0020-0190(81)90033-8openalex-snapshot
On the average height of trees in digital search and dynamic hashing
inferredcites →https://doi.org/10.1016/0022-1236(80)90004-xopenalex-snapshot
On composition operators on Banach spaces of holomorphic functions
inferredcites →https://doi.org/10.1016/0097-3165(94)90065-5openalex-snapshot
Autocorrelation on words and its applications
inferredcites →https://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferredcites →https://doi.org/10.1016/0167-2789(93)90199-bopenalex-snapshot
Quantum maps from transfer operators
inferredcites →https://doi.org/10.1016/0196-6774(88)90039-9openalex-snapshot
Some results on V-ary asymmetric tries
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(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferredcites →https://doi.org/10.1016/s0304-3975(97)00123-0openalex-snapshot
Continued fraction algorithms, functional operators, and structure constants
inferredcites →https://doi.org/10.1016/s0304-3975(97)00167-9openalex-snapshot
Analytical depoissonization and its applications
inferredcites →https://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
inferredcites →https://doi.org/10.1017/cbo9780511629563.015openalex-snapshot
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS
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/s0143385700002327openalex-snapshot
A complex Ruelle-Perron-Frobenius theorem and two counterexamples
inferredcites →https://doi.org/10.1017/s0963548397003258openalex-snapshot
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
inferredcites →https://doi.org/10.1090/crmm/004openalex-snapshot
Dynamical Zeta Functions for Piecewise Monotone Maps of the Interval
inferredcites →https://doi.org/10.1090/memo/0016openalex-snapshot
Produits tensoriels topologiques et espaces nucléaires
inferredcites →https://doi.org/10.1090/s0002-9939-1987-0883400-9openalex-snapshot
Compact Composition Operators on Spaces of Boundary-Regular Holomorphic Functions
inferredcites →https://doi.org/10.1109/18.133271openalex-snapshot
Analysis of digital tries with Markovian dependency
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.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/321958.321965openalex-snapshot
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
inferredcites →https://doi.org/10.1145/322092.322094openalex-snapshot
Self-Organizing Binary Search Trees
inferredcites →https://doi.org/10.1145/363958.363987openalex-snapshot
Randomized binary searching with tree structures
inferredcites →https://doi.org/10.1145/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
inferredcites →https://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.1512/iumj.1974.23.23041openalex-snapshot
Compact, Nuclear, and Hilbert-Schmidt Composition Operators on H^2
inferredcites →https://doi.org/10.2307/2316070openalex-snapshot
Positive Solutions of Operator Equations.
inferredcites →https://doi.org/10.4064/aa-61-1-13-34openalex-snapshot
Distribution of Lévy constants for quadratic numbers
inferredcites →https://doi.org/10.4064/aa-81-2-101-144openalex-snapshot
Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes d'Euclide et de Gauss
inferredcites →https://doi.org/10.5555/314161.314321openalex-snapshot
Fast algorithms for sorting and searching strings
inferredcites →https://doi.org/10.5555/314613.314840openalex-snapshot
The analysis of hybrid trie structures
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.10015openalex-snapshot
Size and path length of Patricia tries: Dynamical sources context
inferred← citeshttps://doi.org/10.1006/jagm.2001.1158openalex-snapshot
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
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/11682462_24openalex-snapshot
Pattern Matching Statistics on Correlated Sources
inferred← citeshttps://doi.org/10.1007/978-0-8176-4799-5_4openalex-snapshot
Number of Frequent Patterns in Random Databases
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_8openalex-snapshot
Upper Tail Analysis of Bucket Sort and Random Tries
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_22openalex-snapshot
An Average-Case Analysis of Basic Parameters of the Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_15openalex-snapshot
Generalized Pattern Matching Statistics
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-02927-1_62openalex-snapshot
The Number of Symbol Comparisons in QuickSort and QuickSelect
inferred← citeshttps://doi.org/10.1007/978-3-642-27461-9_1openalex-snapshot
Context Trees, Variable Length Markov Chains and Dynamical Sources
inferred← citeshttps://doi.org/10.1007/978-3-662-44994-3_6openalex-snapshot
Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory
inferred← citeshttps://doi.org/10.1007/s00224-015-9633-5openalex-snapshot
Towards a Realistic Analysis of the QuickSelect Algorithm
inferred← citeshttps://doi.org/10.1007/s00236-008-0069-0openalex-snapshot
Weighted height of random trees
inferred← citeshttps://doi.org/10.1007/s00285-007-0109-3openalex-snapshot
Multiple pattern matching: a Markov chain approach
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/s00605-022-01805-yopenalex-snapshot
Lochs-type theorems beyond positive entropy
inferred← citeshttps://doi.org/10.1007/s00778-010-0183-9openalex-snapshot
Engineering scalable, cache and space efficient tries for strings
inferred← citeshttps://doi.org/10.1007/s11390-016-1632-8openalex-snapshot
Content-Based Publish/Subscribe System for Web Syndication
inferred← citeshttps://doi.org/10.1016/j.ic.2010.07.001openalex-snapshot
About randomised distributed graph colouring and graph partition algorithms
inferred← citeshttps://doi.org/10.1016/j.spa.2018.03.009openalex-snapshot
Process convergence for the complexity of Radix Selection on Markov sources
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/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/jpr.2025.10034openalex-snapshot
Central limit theorems for additive functionals of patricia tries
inferred← citeshttps://doi.org/10.1017/s000186780000639xopenalex-snapshot
Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect
inferred← citeshttps://doi.org/10.1017/s0963548304006200openalex-snapshot
Concentration of Size and Path Length of Tries
inferred← citeshttps://doi.org/10.1017/s0963548307008796openalex-snapshot
An Analysis of the Height of Tries with Random Weights on the Edges
inferred← citeshttps://doi.org/10.1017/s0963548314000649openalex-snapshot
Towards a Realistic Analysis of Some Popular Sorting Algorithms
inferred← citeshttps://doi.org/10.1017/s0963548314000741openalex-snapshot
Gaussian Distribution of Trie Depth for Strongly Tame Sources
inferred← citeshttps://doi.org/10.1051/ita:2001114openalex-snapshot
On the Stack-Size of General Tries
inferred← citeshttps://doi.org/10.1109/geoinformatics.2015.7378655openalex-snapshot
An effective data indexing method for POI data
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00389openalex-snapshot
RadixKV: A Memory Efficient and High Performance Key-Value Store
inferred← citeshttps://doi.org/10.1109/iisa59645.2023.10345901openalex-snapshot
Design of Real-Time Multiplayer Word Game for the Android Platform Using Firebase and Fuzzy Logic
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.80openalex-snapshot
K-Selection Protocols from Energetic Complexity Perspective
inferred← citeshttps://doi.org/10.1109/itw.2006.1633790openalex-snapshot
Statistics for dynamical sources
inferred← citeshttps://doi.org/10.1109/tkde.2012.132openalex-snapshot
The BoND-Tree: An Efficient Indexing Method for Box Queries in Nonordered Discrete Data Spaces
inferred← citeshttps://doi.org/10.1137/1.9781611973082.15openalex-snapshot
On Buffon Machines and Numbers
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.1145/1125857.1125860openalex-snapshot
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces
inferred← citeshttps://doi.org/10.1145/1138394.1138395openalex-snapshot
Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach
inferred← citeshttps://doi.org/10.1145/1671970.1921704openalex-snapshot
Redesigning the string hash table, burst trie, and BST to exploit cache
inferred← citeshttps://doi.org/10.1145/2247596.2247634openalex-snapshot
Subscription indexes for web syndication systems
inferred← citeshttps://doi.org/10.1145/3105831.3105840openalex-snapshot
Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data Spaces
inferred← citeshttps://doi.org/10.1214/105051605000000494openalex-snapshot
A probabilistic analysis of some tree algorithms
inferred← citeshttps://doi.org/10.1214/12-aap866openalex-snapshot
Distributional convergence for the number of symbol comparisons used by QuickSort
inferred← citeshttps://doi.org/10.1214/ejp.v17-1723openalex-snapshot
Novel characteristics of split trees by use of renewal theory
inferred← citeshttps://doi.org/10.1239/aap/1370870125openalex-snapshot
Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect
inferred← citeshttps://doi.org/10.1504/ijdmmm.2011.041809openalex-snapshot
Hybrid index-based image search from the web
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_111openalex-snapshot
k-Selection Protocols from Energetic Complexity Perspective
inferred← citeshttps://doi.org/10.22215/etd/2006-06665openalex-snapshot
Tries in data retrieval and syntactic pattern recognition
inferred← citeshttps://doi.org/10.25335/c1t3-f115openalex-snapshot
Techniques for efficient k-Nearest Neighbor searching in non-ordered discrete and hybrid data spaces
inferred← citeshttps://doi.org/10.25335/hbxb-4g33openalex-snapshot
Indexing of multidimensional discrete data spaces and hybrid extensions
inferred← citeshttps://doi.org/10.29252/mmr.2.2.39openalex-snapshot
Study of Random Biased d-ary Tries Model
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.4204/eptcs.63.26openalex-snapshot
Information theory: Sources, Dirichlet series, and realistic analyses of data structures
inferred← citeshttps://doi.org/10.4230/lipics.aofa.2018.35openalex-snapshot
The Depoissonisation Quintet: Rice-Poisson-Mellin-Newton-Laplace
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.598openalex-snapshot
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
inferred← citeshttps://doi.org/10.46298/dmtcs.2765openalex-snapshot
Renewal theory in analysis of tries and strings: Extended abstract
inferred← citeshttps://doi.org/10.46298/dmtcs.2799openalex-snapshot
Digital Trees and Memoryless Sources: from Arithmetics to Analysis
inferred← citeshttps://doi.org/10.46298/dmtcs.2800openalex-snapshot
Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort (Extended Abstract)
inferred← citeshttps://doi.org/10.46298/dmtcs.301openalex-snapshot
The Stack-Size of Combinatorial Tries Revisited
inferred← citeshttps://doi.org/10.46298/dmtcs.3011openalex-snapshot
Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study
inferred← citeshttps://doi.org/10.46298/dmtcs.329openalex-snapshot
Statistical properties of general Markov dynamical sources: applications to information theory
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.2003.04101openalex-snapshot
Smoothed Analysis of Trie Height by Star-like PFAs
inferred← citeshttps://doi.org/10.5555/2627817.2627880openalex-snapshot
Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
inferred← citeshttps://doi.org/10.70675/096fe2acz6474z4e10za2b3z181d6f8689f8openalex-snapshot
Indexation pour la recherche par le contenu textuel de flux RSS
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.