Amortized Complexity Verified

 Title: Amortized Complexity Verified Author: Tobias Nipkow Submission date: 2014-07-07 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 the folowing non-trivial ones: skew heaps, splay trees, splay heaps and pairing heaps. A preliminary version of this work (without pairing heaps) is described in a paper published in the proceedings of the conference on Interactive Theorem Proving ITP 2015. An extended version of this publication is available here. Change history: [2015-03-17]: Added pairing heaps by Hauke Brinkop. [2016-07-12]: Moved splay heaps from here to Splay_Tree [2016-07-14]: Moved pairing heaps from here to the new Pairing_Heap BibTeX: @article{Amortized_Complexity-AFP, author = {Tobias Nipkow}, title = {Amortized Complexity Verified}, journal = {Archive of Formal Proofs}, month = jul, year = 2014, note = {\url{https://isa-afp.org/entries/Amortized_Complexity.html}, Formal proof development}, ISSN = {2150-914x}, } License: BSD License Depends on: Pairing_Heap, Skew_Heap, Splay_Tree Used by: Dynamic_Tables, Root_Balanced_Tree Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.