From Shapes to Amortized Complexity

DOI10.1007/978-3-319-73721-8_10MaRDI QIDQ3296329zbMATH OpenOpenAlexFDO

Authors Tomáš Fiedor, Lukáš Holik, Adam Rogalewicz, M. Sinn, Tomáš Vojnar, Florian Zuleger

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

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

Recommendations

• Triangulation and shape-complexity
• Exploring 2D Shape Complexity
• Structured discrete shape approximation: theoretical complexity and practical algorithm
• Complexity of Shapes Embedded in Z ⁿ With a Bias Towards Squares
• Shape simplification through graph sparsification
• A geometric approach to complexity
• Amortized Computational Complexity
• scientific article; zbMATH DE number 5302815

Cited in

(7)

• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
• Selectively-amortized resource bounding
• A transformational approach to resource analysis with typed-norms
• A transformational approach to resource analysis with typed-norms inference
• Exploring 2D Shape Complexity
• Type-based analysis of logarithmic amortised complexity
• ATLAS: automated amortised complexity analysis of self-adjusting data structures

This page was built for publication: From Shapes to Amortized Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296329)