Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Open Access
- 3 November 2010
- journal article
- research article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 25 (6) , 1305-1320
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Quantitative Analysis With the Probabilistic Model Checker PRISMElectronic Notes in Theoretical Computer Science, 2006
- Probabilistic guarded commands mechanized in HOLTheoretical Computer Science, 2005
- Abstraction and refinement in probabilistic systemsACM SIGMETRICS Performance Evaluation Review, 2005
- Model-checking algorithms for continuous-time markov chainsIEEE Transactions on Software Engineering, 2003
- A Randomized Parallel Algorithm for Planar Graph IsomorphismJournal of Algorithms, 1998
- Automatic average-case analysis of algorithmsTheoretical Computer Science, 1991
- A probabilistic PDLJournal of Computer and System Sciences, 1985
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- Mathematical GamesScientific American, 1960
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940