Maximum likelihood analysis of algorithms and data structures

DOI10.1016/j.tcs.2009.09.025zbMath1187.68722OpenAlexW2093913026MaRDI QIDQ1041238

Markus E. Nebel, Ulrich Laube

Publication date: 1 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.025

zbMATH Keywords

generating functionssortinganalysis of algorithmsmaximum likelihood methodtriesstochastic context free grammars

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items

Maximum likelihood analysis of the Ford-Fulkerson method on special graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic average-case analysis of algorithms
• R. A. Fisher and the making of maximum likelihood 1912--1922
• On stochastic context-free languages
• Solution of an Open Problem on Probabilistic Grammars
• Singularity Analysis of Generating Functions
• On some applications of formulae of Ramanujan in the analysis of algorithms
• Biological Sequence Analysis
• New results on the size of tries
• Profile of Tries
• Applying Probability Measures to Abstract Languages
• Motzkin numbers
• The stack-size of tries: A combinatorial study