Digital data structures and order statistics

DOI10.1007/3-540-51542-9_18MaRDI QIDQ4028887zbMATH OpenFDO

Authors Wojciech Szpankowski

Publication date 28 March 1993

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

Full work available at URL https://doi.org/10.1007/3-540-51542-9_18

zbMATH Keywords

alignment matrixdigital treesheightlongest common prefix

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the height of digital trees and related problems
• Heigths in generalized tries and PATRICIA tries
• On the stack-size of general tries
• What can we learn about suffix trees from independent tries!
• The Ubiquitous Digital Tree

Cited in

(7)

• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• Expected worst-case partial match in random quadtries
• The Distribution of Prefix Overlap in Consecutive Dictionary Entries
• Self-alignments in words and their applications
• Discs and other related data structures
• Smoothed heights of tries and patricia tries
• On the height of digital trees and related problems

This page was built for publication: Digital data structures and order statistics

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