External Links

    Journal: Distributed Computing

    Volume 25, Issue 6

    411 -- 425Yehuda Afek, Petr Kuznetsov, Israel Nir. Renaming and the weakest family of failure detectors
    427 -- 450Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry. Leader election using loneliness detection
    451 -- 460Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita. On space complexity of self-stabilizing leader election in mediated population protocol
    461 -- 472Dmitry N. Kozlov. Gathering identical autonomous systems on a circle using stigmergy

    Volume 25, Issue 5

    335 -- 357Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern. Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
    359 -- 370Martin Hoefer, Siddharth Suri. Dynamics in network interaction games
    371 -- 381Marcos K. Aguilera, Sam Toueg. The correctness proof of Ben-Or's randomized consensus algorithm
    383 -- 409Borzoo Bonakdarpour, Marius Bozga, Mohamad Jaber, Jean Quilbeuf, Joseph Sifakis. A framework for automated distributed implementation of component-based models

    Volume 25, Issue 4

    261 -- 278Thomas P. Hayes, Jared Saia, Amitabh Trehan. The Forgiving Graph: a distributed data structure for low stretch under adversarial attack
    279 -- 296Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks. Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
    297 -- 311Jérémie Chalopin, Emmanuel Godard, Yves Métivier. Election in partially anonymous networks with arbitrary knowledge in message passing systems
    313 -- 333Scott M. Pike, Srikanth Sastry, Jennifer L. Welch. Failure detectors encapsulate fairness

    Volume 25, Issue 3

    189 -- 205Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings
    207 -- 224Sven Köhler 0002, Volker Turau. Fault-containing self-stabilization in asynchronous systems with constant fault-gap
    225 -- 248Gokarna Sharma, Costas Busch. Window-based greedy contention management for transactional memory: theory and practice
    249 -- 260Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. Partial synchrony based on set timeliness

    Volume 25, Issue 2

    109 -- 162Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel. RMR-efficient implementations of comparison primitives using read and write operations
    163 -- 0Rachid Guerraoui. Special section with selected papers from PODC 2010
    165 -- 178Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. How to meet when you forget: log-space rendezvous in arbitrary graphs
    179 -- 188James Aspnes. A modular approach to shared-memory consensus, with applications to the probabilistic-write model

    Volume 25, Issue 1

    1 -- 0Hagit Attiya. Announcement: best reviewer award 2011
    3 -- 4Davide Sangiorgi. Concurrency theory: timed automata, testing, program synthesis
    5 -- 33Catalin Dima, Ruggero Lanotte. A study on shuffle, stopwatches and independently evolving clocks
    35 -- 62Robert M. Hierons, Mercedes G. Merayo, Manuel Núñez. Implementation relations and test generation for systems with distributed interfaces
    63 -- 81Robert M. Hierons. Overcoming controllability problems in distributed testing from an input output transition system
    83 -- 108Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abujarad. Symbolic synthesis of masking fault-tolerant distributed programs
    runs on