Profile of Tries

DOI10.1007/978-3-540-78773-0_1zbMATH Open1136.68368OpenAlexW2172208172MaRDI QIDQ5458512FDOQ5458512

Authors: Gahyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski Edit this on Wikidata

Publication date: 15 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_1

Recommendations

• Profiles of Tries
• Towards a complete characterization of tries
• Average profiles, from tries to suffix-trees
• Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
• Concentration of Size and Path Length of Tries

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Mellin transforms and asymptotics: Harmonic sums
• Title not available (Why is that?)
• How to select a loser
• Title not available (Why is that?)
• Analytical depoissonization and its applications
• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• Average profiles, from tries to suffix-trees
• Profile of Tries
• Paths in a random digital tree: limiting distributions
• Towards a complete characterization of tries
• Profiles of random trees: plane-oriented recursive trees
• On the number of full levels in tries
• Asymptotic normality of recursive algorithms via martingale difference arrays

Cited In (16)

• Profile of Tries
• Statistical properties of factor oracles
• Statistical Properties of Factor Oracles
• Towards a complete characterization of tries
• The average profile of suffix trees
• Maximum likelihood analysis of algorithms and data structures
• A functional limit theorem for the profile of \(b\)-ary trees
• A generalization of the trie data structure
• Protected node profile of tries
• Renewal theory in the analysis of tries and strings
• Average profiles, from tries to suffix-trees
• Trie structure for graph sequences
• Profiles of Tries
• Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
• Gaussian distribution of trie depth for strongly tame sources
• Average-case analysis of approximate trie search

This page was built for publication: Profile of Tries

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