Patricia tries again revisited

DOI10.1145/96559.214080zbMATH Open0711.68065OpenAlexW1998556530WikidataQ128524538 ScholiaQ128524538MaRDI QIDQ3495658FDOQ3495658

Authors: Wojciech Szpankowski 

Publication date: 1990

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1542&context=cstech

Recommendations

• scientific article; zbMATH DE number 4072401
• On the balance property of Patricia tries: External path length viewpoint
• Profiles of PATRICIA tries
• Limiting Distribution for the Depth in PATRICIA Tries
• Publication:4508387

zbMATH Keywords

data structuresprobabilistic analysis of algorithmsdigital search treesbalanced treesPatricia trieunsuccessful searchsuccessful search

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)

Cited In (24)

• A note on binomial recurrences arising in the analysis of algorithms
• On the balance property of Patricia tries: External path length viewpoint
• A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.
• Analysis of random LC tries
• Mellin transforms and asymptotics: Harmonic sums
• A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Title not available (Why is that?)
• Analytical depoissonization and its applications
• Asymmetric Rényi problem
• A characterization of digital search trees from the successful search viewpoint
• On the smoothed heights of trie and patricia index trees
• Optimizing registration based encryption
• How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• Renewal theory in the analysis of tries and strings
• Size and path length of Patricia tries: Dynamical sources context
• Julia and John revisited
• PATRICIA bridges
• Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
• Title not available (Why is that?)
• Profiles of PATRICIA tries
• On unary nodes in tries
• Analytic analysis of algorithms

This page was built for publication: Patricia tries again revisited

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