A lower bound on wait-free counting

• 1 January 1993
• conference paper
• Published by Association for Computing Machinery (ACM)
• Vol. 24  (1) , 251-259
• https://doi.org/10.1145/164051.164079

Abstract

Keywords

• READ MODIFY WRITE
• SHARED MEMORY
• SATISFIABILITY
• LOWER BOUND