Result 1 to 20 of 481 total
From a store-collect object and $Ω$ to efficient asynchronous consensus. (English)
Kaklamanis, Christos (ed.) et al., Euro-Par 2012 parallel processing. 18th international conference, Euro-Par 2012, Rhodes Island, Greece, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32819-0/pbk). Lecture Notes in Computer Science 7484, 427-438 (2012).
1
Concurrent programming: Algorithms, principles, and foundations. (to appear). (English)
Berlin: Springer (ISBN 978-3-642-32026-2/hbk). xix, 417~p. EUR~59.95/net; SFR~80.00; \sterling~53.99/hbk (2012).
2
Increasing the power of the iterated immediate snapshot model with failure detectors. (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, 231-242 (2012).
3
Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations). (English)
Theor. Comput. Sci. 444, 113-127 (2012).
4
Towards a universal construction for transaction-based multiprocess programs. (English)
Bononi, Luciano (ed.) et al., Distributed computing and networking. 13th international conference, ICDCN 2012, Hong Kong, China, January 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-25958-6/pbk). Lecture Notes in Computer Science 7129, 61-75 (2012).
5
From the happened-before relation to the causal ordered set abstraction. (English)
J. Parallel Distrib. Comput. 72, No. 6, 791-795 (2012).
6
Renaming is weaker than set agreement but for perfect renaming: A map of sub-consensus tasks. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 145-156 (2012).
7
No double discount: condition-based simultaneity yields limited gain. (English)
Inf. Comput. 214, 47-58 (2012).
8
Help when needed, but no more: efficient read/write partial snapshot. (English)
J. Parallel Distrib. Comput. 72, No. 1, 1-12 (2012).
9
Implementing a regular register in an eventually synchronous distributed system prone to continuous churn (English)
IEEE Trans. Parallel Distrib. Syst. 23, No. 1, 102-109 (2012).
10
A liveness condition for concurrent objects: $x$-wait-freedom. (English)
Concurrency Comput. Pract. Exp. 23, No. 17, 2154-2166 (2011).
11
On the implementation of concurrent objects. (English)
Jones, Cliff B. (ed.) et al., Dependable and historic computing. Essays dedicated to Brian Randell on the occasion of his 75th birthday. Berlin: Springer (ISBN 978-3-642-24540-4/pbk). Lecture Notes in Computer Science 6875, 453-478 (2011).
12
Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. (English)
Xiang, Yang (ed.) et al., Algorithms and architectures for parallel processing. 11th international conference, ICA3PP 2011, Melbourne, Australia, October 24‒26, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-24649-4/pbk). Lecture Notes in Computer Science 7016, 244-257 (2011).
13
Relations linking failure detectors associated with $k$-set agreement in message-passing systems. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 341-355 (2011).
14
The weakest failure detector to implement a register in asynchronous systems with hybrid communication. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 268-282 (2011).
15
Looking for efficient implementations of concurrent objects. (English)
Malyshkin, Victor (ed.), Parallel computing technologies. 11th international conference, PaCT 2011, Kazan, Russia, September 19-23, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23177-3/pbk). Lecture Notes in Computer Science 6873, 74-87 (2011).
16
Brief announcement: $ΔΩ$ ‒ specifying an eventual leader service for dynamic systems. (English)
Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 328-329 (2011).
17
The universe of symmetry breaking tasks. (English)
Kosowski, Adrian (ed.) et al., Structural information and communication complexity. 18th international colloquium, SIROCCO 2011, Gdańsk, Poland, June 26‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22211-5/pbk). Lecture Notes in Computer Science 6796, 66-77 (2011).
18
A survey on some recent advances in shared memory models. (English)
Kosowski, Adrian (ed.) et al., Structural information and communication complexity. 18th international colloquium, SIROCCO 2011, Gdańsk, Poland, June 26‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22211-5/pbk). Lecture Notes in Computer Science 6796, 17-28 (2011).
19
On the road to the weakest failure detector for $k$-set agreement in message-passing systems. (English)
Theor. Comput. Sci. 412, No. 33, 4273-4284 (2011).
20
Result 1 to 20 of 481 total
Start
Contact
Print
General Help
