On the complexity of commutativity analysis

DOI10.1007/3-540-61332-3_166zbMath1529.68119OpenAlexW1522837769MaRDI QIDQ6184677

Martin C. Rinard, Pedro C. Diniz, Oscar H. Ibarra

Publication date: 29 January 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_166

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• On the complexity of simple arithmetic expressions
• On the zero-inequivalence problem for loop programs
• A note on the complexity of program evaluation
• On the Simplification and Equivalence Problems for Straight-Line Programs
• Commutativity-based concurrency control for abstract data types
• The Complexity of the Equivalence Problem for Simple Programs
• The Complexity of the Equivalence Problem for Simple Loop-Free Programs
• Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

This page was built for publication: On the complexity of commutativity analysis