default search action
Distributed Computing, Volume 25
Volume 25, Number 1, March 2012
- Hagit Attiya:
Announcement: best reviewer award 2011. 1 - Davide Sangiorgi:
Concurrency theory: timed automata, testing, program synthesis. 3-4 - Catalin Dima
, Ruggero Lanotte
A study on shuffle, stopwatches and independently evolving clocks. 5-33 - Robert M. Hierons
Implementation relations and test generation for systems with distributed interfaces. 35-62 - Robert M. Hierons
Overcoming controllability problems in distributed testing from an input output transition system. 63-81 - Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abujarad:
Symbolic synthesis of masking fault-tolerant distributed programs. 83-108
Volume 25, Number 2, May 2012
- Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel:
RMR-efficient implementations of comparison primitives using read and write operations. 109-162 - Rachid Guerraoui
Special section with selected papers from PODC 2010. 163 - Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
How to meet when you forget: log-space rendezvous in arbitrary graphs. 165-178 - James Aspnes:
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. 179-188
Volume 25, Number 3, June 2012
- Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan
Efficient distributed approximation algorithms via probabilistic tree embeddings. 189-205 - Sven Köhler, Volker Turau:
Fault-containing self-stabilization in asynchronous systems with constant fault-gap. 207-224 - Gokarna Sharma, Costas Busch:
Window-based greedy contention management for transactional memory: theory and practice. 225-248 - Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Partial synchrony based on set timeliness. 249-260
Volume 25, Number 4, August 2012
- Thomas P. Hayes, Jared Saia, Amitabh Trehan
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. 261-278 - Antonio Fernández Anta
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. 279-296 - Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Election in partially anonymous networks with arbitrary knowledge in message passing systems. 297-311 - Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Failure detectors encapsulate fairness. 313-333
Volume 25, Number 5, October 2012
- Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern:
Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion. 335-357 - Martin Hoefer, Siddharth Suri:
Dynamics in network interaction games. 359-370 - Marcos K. Aguilera, Sam Toueg:
The correctness proof of Ben-Or's randomized consensus algorithm. 371-381 - Borzoo Bonakdarpour, Marius Bozga, Mohamad Jaber, Jean Quilbeuf, Joseph Sifakis:
A framework for automated distributed implementation of component-based models. 383-409
Volume 25, Number 6, December 2012
- Yehuda Afek, Petr Kuznetsov, Israel Nir:
Renaming and the weakest family of failure detectors. 411-425 - Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry:
Leader election using loneliness detection. 427-450 - Ryu Mizoguchi, Hirotaka Ono
On space complexity of self-stabilizing leader election in mediated population protocol. 451-460 - Dmitry N. Kozlov
Gathering identical autonomous systems on a circle using stigmergy. 461-472
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-17 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: