Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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.
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev