Trie size in a dynamic list structure

DOI10.1007/3-540-56610-4_100MaRDI QIDQ5044775zbMATH OpenOpenAlexFDO

Authors Guy Louchard

Publication date 2 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56610-4_100

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Dynamical sources in information theory: A general analysis of trie structures
• Concentration of Size and Path Length of Tries
• New results on the size of tries
• Towards a complete characterization of tries
• Profiles of Tries

Cites work

• Brownian motion and algorithm complexity
• Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
• scientific article; zbMATH DE number 3978406 (Why is no real title available?)
• scientific article; zbMATH DE number 3548141 (Why is no real title available?)
• New results on the size of tries
• On the joint distribution of the maximum and its location for a linear diffusion
• Paths in a random digital tree: limiting distributions
• Random walks, Gaussian processes and list structures
• Sequence of operations analysis for dynamic data structures
• The analysis of simple list structures
• The first-passage density of a continuous gaussian process to a general boundary
• The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres
• The maximum of a random walk whose mean path has a maximum

Cited in

(1)

• The stack-size of tries: A combinatorial study

This page was built for publication: Trie size in a dynamic list structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044775)