The stack-size of tries: A combinatorial study

DOI10.1016/S0304-3975(00)00416-3zbMath0988.68137MaRDI QIDQ5958316

Markus E. Nebel

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

average case analysiscombinatorial structuresstack-sizetries

Mathematics Subject Classification ID

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

Related Items (2)

On the Stack-Size of General Tries ⋮ Maximum likelihood analysis of algorithms and data structures

Cites Work

• The average height of r-tuply rooted planted plane trees
• Singularity Analysis of Generating Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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