External Links

    Journal: Distributed Computing

    Volume 24, Issue 6

    271 -- 297Yong-Jik Kim, James H. Anderson. A time complexity lower bound for adaptive mutual exclusion
    299 -- 321Josef Widder, Martin Biely, Günther Gridling, Bettina Weiss, Jean-Paul Blanquart. Consensus in the presence of mortal Byzantine faulty processes
    323 -- 355Matthias Függer, Ulrich Schmid. Reconciling fault-tolerant distributed computing and systems-on-chip

    Volume 24, Issue 5

    207 -- 222Ittay Eyal, Idit Keidar, Raphael Rom. Distributed data clustering in sensor networks
    223 -- 244Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski. Meeting the deadline: on the complexity of fault-tolerant continuous gossip
    245 -- 254Angelo Fanelli, Luca Moscardelli. On best response dynamics in weighted congestion games with polynomial delays
    255 -- 269Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. The minimum information about failures for solving non-local tasks in message-passing systems

    Volume 24, Issue 3-4

    135 -- 136Idit Keidar. Special issue with selected papers from DISC 2009
    137 -- 147Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. The disagreement power of an adversary
    149 -- 163Eli Gafni, Petr Kuznetsov. On set consensus numbers
    165 -- 175Henrique Moniz, Nuno Ferreira Neves, Miguel Correia, Paulo Veríssimo. Randomization can be a healer: consensus with dynamic omission failures
    177 -- 186Yuval Emek, Amos Korman. New bounds for the controller problem
    187 -- 206Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport. The abstract MAC layer

    Volume 24, Issue 2

    65 -- 78Emanuele G. Fusco, Andrzej Pelc. How much memory is needed for leader election
    79 -- 89Zvika Brakerski, Boaz Patt-Shamir. Distributed discovery of large near-cliques
    91 -- 99Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski. Derandomizing random walks in undirected graphs using locally fair exploration strategies
    101 -- 118Calvin C. Newport, Nancy A. Lynch. Modeling radio networks
    119 -- 134Alex Brodsky, Faith Ellen, Philipp Woelfel. Fully-adaptive algorithms for long-lived renaming

    Volume 24, Issue 1

    1 -- 0Lorenzo Alvisi. Special issue on PODC 2009
    3 -- 19Danny Hendler, Philipp Woelfel. Randomized mutual exclusion with sub-logarithmic RMR-complexity
    21 -- 29Robert Kleinberg, Georgios Piliouras, Éva Tardos. Load balancing without regret in the bulletin board model
    31 -- 44Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud. Parsimonious flooding in dynamic graphs
    45 -- 63Christos Koufogiannakis, Neal E. Young. Distributed algorithms for covering, packing and maximum weighted matching
    runs on