György E. Révész
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.
György E. Révész
Theoretical Computer Science
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007