From Shapes to Amortized Complexity

DOI10.1007/978-3-319-73721-8_10zbMath1446.68030OpenAlexW2779724286MaRDI QIDQ3296329

Moritz Sinn, Adam Rogalewicz, Lukáš Holík, Florian Zuleger, Tomáš Fiedor, Tomáš Vojnar

Publication date: 7 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3626

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

ATLAS: automated amortised complexity analysis of self-adjusting data structures, Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free, Type-based analysis of logarithmic amortised complexity