Journal: Distributed Computing

Volume 30, Issue 6

391 -- 412George Saad, Jared Saia. A theoretical and empirical evaluation of an algorithm for self-healing computation
413 -- 457Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta. Distributed computing by mobile robots: uniform circle formation
459 -- 468Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. On the uncontended complexity of anonymous agreement

Volume 30, Issue 5

307 -- 0Hagit Attiya. Special issue on DISC 2013, 2014 and PODC 2014
309 -- 323David P. Woodruff, Qin Zhang 0001. When distributed computation is communication expensive
325 -- 338Mika Göös, Juho Hirvonen, Jukka Suomela. Linear-in- $$\varDelta $$ Δ lower bounds in the LOCAL model
339 -- 355Ofer Feinerman, Bernhard Haeupler, Amos Korman. Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
357 -- 372Merav Parter. Vertex fault tolerant additive spanners
373 -- 390Ho-Lin Chen, Rachel Cummings, David Doty, David Soloveichik. Speed faults in computation by chemical reaction networks

Volume 30, Issue 4

231 -- 260Panagiota Fatourou, Nikolaos D. Kallimanis. Lower and upper bounds for single-scanner snapshot implementations
261 -- 280Kai-Min Chung, Seth Pettie, Hsin-Hao Su. Distributed algorithms for the Lovász local lemma and graph coloring
281 -- 291Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro. Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
293 -- 306Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan. Simple dynamics for plurality consensus

Volume 30, Issue 3

149 -- 168Ofer Feinerman, Amos Korman. The ANTS problem
169 -- 191Christoph Lenzen, Nancy A. Lynch, Calvin Newport, Tsvetomira Radeva. Searching without communicating: tradeoffs between performance and selection complexity
193 -- 229Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia, Mahdi Zamani. Secure multi-party computation in large networks

Volume 30, Issue 2

75 -- 86Gabriele Di Stefano, Alfredo Navarra. Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
87 -- 102Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas. Reliable broadcast with respect to topology knowledge
103 -- 125Seth Gilbert, Calvin Newport, Chaodong Zheng. Who are you? Secure identities in single hop ad hoc networks
127 -- 148Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald. The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks

Volume 30, Issue 1

1 -- 16George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. Determining majority in networks with local interactions and very small local memory
17 -- 48Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse. A unified approach for gathering and exclusive searching on rings under weak assumptions
49 -- 73Viveck R. Cadambe, Nancy A. Lynch, Muriel Mèdard, Peter M. Musial. A coded shared atomic memory algorithm for message passing architectures