Volume 24, Number 1, September 2011

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

Volume 24, Number 2, October 2011

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

Volume 24, Numbers 3-4, November 2011

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

Volume 24, Number 5, December 2011

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

Volume 24, Number 6, January 2012

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

last updated on Tue May 21 02:52:12 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page