scientific article; zbMATH DE number 777288

zbMATH Open0826.68037MaRDI QIDQ4840164FDOQ4840164

Authors: Günter Hotz 

Publication date: 20 July 1995

Title of this publication is not available (Why is that?)

Recommendations

• Typical depth of a digital search tree built on a general source
• An estimate of mean efficiency of search trees for arbitrary sets of binary words
• A universal finite memory source
• Dynamical sources in information theory: A general analysis of trie structures
• Average size of a suffix tree for Markov sources

zbMATH Keywords

search problemsearch tree approaches

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cited In (2)

• Optimal parameters for search using a barrier tree Markov model
• Markov incremental constructions

This page was built for publication:

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