Result 1 to 18 of 18 total
SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. (English)
Lecture Notes in Computer Science 6543. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). xiv, 572~p. EUR~74.90 (2011).
1
Minimizing retrieval latency for content cloud (English)
INFOCOM, 1080-1088 (2011).
2
Robust data sharing with key-value stores (English)
PODC, 221-222 (2011).
3
The complexity of robust atomic storage (English)
PODC, 59-68 (2011).
4
Fast access to distributed atomic memory. (English)
SIAM J. Comput. 39, No. 8, 3752-3783 (2010).
5
The origin of quorum systems. (English)
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 101, 125-147 (2010).
6
Refined quorum systems. (English)
Distrib. Comput. 23, No. 1, 1-42 (2010).
7
Design and implementation of a key-lifecycle management system. (English)
Sion, Radu (ed.), Financial cryptography and data security. 14th international conference, FC 2010, Tenerife, Canary Islands, January 25‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-14576-6/pbk). Lecture Notes in Computer Science 6052, 160-174 (2010).
8
The byzantine empire in the intercloud (English)
SIGACT News 41, No. 3, 105-111 (2010).
9
Design and implementation of a key-lifecycle management system (English)
Financial Cryptography, 160-174 (2010).
10
The next 700 BFT protocols (English)
EuroSys, 363-376 (2010).
11
Reliable distributed storage (English)
IEEE Computer 42, No. 4, 60-67 (2009).
12
A scalable and oblivious atomicity assertion. (English)
van Breugel, Franck (ed.) et al., CONCUR 2008 ‒ concurrency theory. 19th international conference, CONCUR 2008, Toronto, Canada, August 19‒22, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85360-2/pbk). Lecture Notes in Computer Science 5201, 52-66 (2008).
13
A scalable and oblivious atomicity assertion (English)
CONCUR, 52-66 (2008).
14
Refined quorum systems (English)
PODC, 119-128 (2007).
15
Lucky Read/write access to robust atomic storage (English)
DSN, 125-136 (2006).
16
How fast can a very robust Read be? (English)
PODC, 248-257 (2006).
17
Gracefully degrading fair exchange with security modules (English)
EDCC, 55-71 (2005).
18
Result 1 to 18 of 18 total