Estimation of search tree size and approximate counting: A likelihood approach

DOI10.1524/stnd.2008.1016zbMath1274.62166OpenAlexW1979056214MaRDI QIDQ5191260

Florian Dennert, Rudolf Grübel

Publication date: 29 July 2009

Published in: Statistics & Decisions (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8d90ac9329ef10d56aa596b4f58f782710196e9c

zbMATH Keywords

confidence intervalsmaximum likelihood estimationbirth processlimit distributiondigital search tree algorithm

Mathematics Subject Classification ID

Parametric tolerance and confidence regions (62F25) Analysis of algorithms and problem complexity (68Q25) Point estimation (62F10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

This page was built for publication: Estimation of search tree size and approximate counting: A likelihood approach