Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A note on the asymptotic behavior of the depth of tries

From MaRDI portal
Publication:1277381
Jump to:navigation, search

DOI10.1007/PL00009239zbMATH Open0914.68150MaRDI QIDQ1277381

Charles Knessl

Publication date: 21 June 1999

Published in: Algorithmica (Search for Journal in Brave)




zbMATH Keywords

triesdigital trees


Mathematics Subject Classification ID

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



Related Items (5)

Some results on V-ary asymmetric tries ⋮ On the stack-size of general tries ⋮ Concentration of Size and Path Length of Tries ⋮ On the average depth of asymmetric LC-tries ⋮ On the Horton-Strahler number for random tries






This page was built for publication: A note on the asymptotic behavior of the depth of tries

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1277381&oldid=13378259"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 10:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki