Computing Weak Consistency in Polynomial Time

DOI10.1145/2767386.2767407zbMath1333.68058OpenAlexW2010898533MaRDI QIDQ2796276

Xiao-Zhou Li, Naomi Nishimura, Wojciech Golab, Alejandro López-Ortiz

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2767386.2767407

zbMATH Keywords

verificationconsistencyatomicitydistributed storage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Information storage and retrieval of data (68P20) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Computing $k$-Atomicity in Polynomial Time

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Computing Weak Consistency in Polynomial Time