External Links

    Journal: Distributed Computing

    Volume 31, Issue 6

    419 -- 439Valerie King, Seth Pettie, Jared Saia, Maxwell Young. A resource-competitive jamming defense
    441 -- 453Michael Mitzenmacher, Rasmus Pagh. Simple multi-party set reconciliation
    455 -- 469Othon Michail, Paul G. Spirakis. How many cooks spoil the soup?
    471 -- 487Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma. Time-communication impossibility results for distributed transactional memory
    489 -- 501Dan Alistarh, James Aspnes, Valerie King, Jared Saia. Communication-efficient randomized consensus
    503 -- 513Chen Avin, Robert Elsässer. Breaking the $$\log n$$ log n barrier on rumor spreading

    Volume 31, Issue 5

    327 -- 342Mercedes G. Merayo, Robert M. Hierons, Manuel Núñez 0001. Passive testing with asynchronous communications and timestamps
    343 -- 365Othon Michail. Terminating distributed construction of shapes and patterns in a fair solution of automata
    367 -- 388Vincent Gramoli, Rachid Guerraoui, Vasileios Trigonakis. 2C: a software transactional memory for many-cores
    389 -- 417Karolos Antoniadis, Peva Blanchard, Rachid Guerraoui, Julien Stainer. The entropy of a distributed computation random number generation from memory interleaving

    Volume 31, Issue 4

    255 -- 0Yoram Moses. Introduction to the special issue of papers from DISC 2015
    257 -- 271David Doty, David Soloveichik. Stable leader election in population protocols requires linear time
    273 -- 287Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport. Smoothed analysis of dynamic networks
    289 -- 316Éric Goubault, Samuel Mimram, Christine Tasson. Geometric and combinatorial views on asynchronous computability
    317 -- 326Rati Gelashvili. On the optimal space complexity of consensus for anonymous processes

    Volume 31, Issue 3

    167 -- 185Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit. Inherent limitations of hybrid transactional memory
    187 -- 222Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith. Parameterized model checking of rendezvous systems
    223 -- 240Keren Censor Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff. Distributed construction of purely additive spanners
    241 -- 254Adrian Ogierman, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang. Sade: competitive MAC under adversarial SINR

    Volume 31, Issue 2

    83 -- 98Magnús M. Halldórsson, Sven Köhler 0002, Boaz Patt-Shamir, Dror Rawitz. Distributed backup placement in networks
    99 -- 117Zohir Bouzid, Michel Raynal, Pierre Sutra. Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers
    119 -- 137Michael Elkin, Ofer Neiman. On efficient distributed construction of near optimal routing schemes
    139 -- 166Lélia Blin, Sébastien Tixeuil. Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative

    Volume 31, Issue 1

    1 -- 50Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra. Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
    51 -- 67Marco Carbone, Fabrizio Montesi, Carsten Schürmann. Choreographies, logically
    69 -- 82Magnús M. Halldórsson, Christian Konrad. Computing large independent sets in a single round
    runs on