Result 1 to 20 of 340 total
Generating fast indulgent algorithms. (English)
Theory Comput. Syst. 51, No. 4, 404-424 (2012).
1
Early deciding synchronous renaming in $O( \log f )$ rounds or less. (English)
Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30‒July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 195-206 (2012).
2
Of choices, failures and asynchrony: the many faces of set agreement. (English)
Algorithmica 62, No. 1-2, 595-629 (2012).
3
Decentralized polling with respectable participants. (English)
J. Parallel Distrib. Comput. 72, No. 1, 13-26 (2012).
4
Verification of STM on relaxed memory models. (English)
Form. Methods Syst. Des. 39, No. 3, 297-331 (2011).
5
The disagreement power of an adversary. (English)
Distrib. Comput. 24, No. 3-4, 137-147 (2011).
6
Democratizing transactional programming. (English)
Kon, Fabio (ed.) et al., Middleware 2011. ACM/IFIP/USENIX 12th international middleware conference, Lisbon, Portugal, December 12‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25820-6/pbk). Lecture Notes in Computer Science 7049, 1-19 (2011).
7
Generalized universality. (English)
Katoen, Joost-Pieter (ed.) et al., CONCUR 2011 ‒ concurrency theory. 22nd international conference, CONCUR 2011, Aachen, Germany, September 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23216-9/pbk). Lecture Notes in Computer Science 6901, 17-27 (2011).
8
Special issue: Stability, safety, and security of distributed systems (SSS 2009). Selected papers based on the presentations at the 11th international symposium, Lyon, France, November 3‒6, 2009. (English)
Theor. Comput. Sci. 412, No. 33, 4227-4371 (2011).
9
The impossibility of boosting distributed service resilience. (English)
Inf. Comput. 209, No. 6, 927-950 (2011).
10
The complexity of early deciding set agreement. (English)
SIAM J. Comput. 40, No. 1, 63-78 (2011).
11
Why STM can be more than a research toy. (English)
Commun. ACM 54, No. 4, 70-77 (2011).
12
Introduction to reliable and secure distributed programming. 2nd ed. (English)
Berlin: Springer (ISBN 978-3-642-15259-7/hbk; 978-3-642-15260-3/ebook). xix, 367~p. EUR~54.95/net; SFR~79.00; \sterling~49.99; \$~69.95 (2011).
13
Generating fast indulgent algorithms. (English)
Aguilera, Marcos K. (ed.) et al., Distributed computing and networking. 12th international conference, ICDCN 2011, Bangalore, India, January 2‒5, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-17678-4/pbk). Lecture Notes in Computer Science 6522, 41-52 (2011).
14
The failure detector abstraction (English)
ACM Comput. Surv. 43, No. 2, 9 (2011).
15
Introduction to reliable and secure distributed programming (2. Ed.) (English)
Introduction to reliable and secure distributed programming (2. Ed.), I-XIX, 1-367 (2011).
16
Generalized universality (English)
CONCUR, 17-27 (2011).
17
Generating fast indulgent algorithms (English)
ICDCN, 41-52 (2011).
18
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (English)
POPL, 487-498 (2011).
19
Brief announcement: transaction polymorphism (English)
SPAA, 311-312 (2011).
20
Result 1 to 20 of 340 total
Start
Contact
Print
General Help
