Skip to main content
Conference Proceedings

Amortized complexity verified

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9236 310-324
DOI: 10.1007/978-3-319-22102-1_21
18Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A framework for the analysis of the amortized complexity of (functional) data structures is formalized in Isabelle/HOL and applied to a number of standard examples and to three famous non-trivial ones: skew heaps, splay trees and splay heaps.

Cite

CITATION STYLE

APA

Nipkow, T. (2015). Amortized complexity verified. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9236, pp. 310–324). Springer Verlag. https://doi.org/10.1007/978-3-319-22102-1_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free