Automated recurrence analysis for almost-linear expected-runtime bounds

DOI10.1007/978-3-319-63387-9_6zbMath1494.68319arXiv1705.00314OpenAlexW2964180318MaRDI QIDQ2151240

Hongfei Fu, Krishnendu Chatterjee, Aniket Murhekar

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/1705.00314

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Randomized algorithms (68W20)

Related Items (5)

Time-bounded termination analysis for probabilistic programs with delays ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Automatic Analysis of Expected Termination Time for Population Protocols ⋮ Verified analysis of random binary tree structures ⋮ Computing expected runtimes for constant probability programs

This page was built for publication: Automated recurrence analysis for almost-linear expected-runtime bounds