Thomas M. Cover
IEEE Trans. Inf. Theory
We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency. © 2008 Elsevier B.V. All rights reserved.
Thomas M. Cover
IEEE Trans. Inf. Theory
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Rolf Clauberg
IBM J. Res. Dev