The stack-size of combinatorial tries revisited

MaRDI QIDQ2768447zbMATH OpenFDO

Authors Markus Nebel

Publication date 23 April 2002

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/122089, http://www.emis.de/journals/DMTCS/volumes/abstracts/dm050101.abs.html

zbMATH Keywords

analytical combinatoricsblockcodes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The stack-size of tries: A combinatorial study
• New results on the size of tries
• On the stack-size of general tries
• Concentration of Size and Path Length of Tries
• Towards a complete characterization of tries

Cited in

(6)

• On the lexicographical generation of compressed codes
• On the stack-size of general tries
• scientific article; zbMATH DE number 1156488 (Why is no real title available?)
• Passing through a stack k times
• On the Horton-Strahler Number for Combinatorial Tries
• The stack-size of tries: A combinatorial study

This page was built for publication: The stack-size of combinatorial tries revisited

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