Stopping Times, Metrics and Approximate Counting

DOI10.1007/11786986_11zbMath1223.68075WikidataQ56323910 ScholiaQ56323910MaRDI QIDQ3613753

Martin Dyer, Magnus Bordewich, Marek Karpinski

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_11

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C80: Random graphs (graph-theoretic aspects)

60G40: Stopping times; optimal stopping problems; gambling theory

68W20: Randomized algorithms

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)