Charles H. Bennett, Aram W. Harrow, et al.
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.
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Fan Zhang, Junwei Cao, et al.
IEEE TETC