1. Special issue on PODC 2008

   • Boaz Patt-Shamir

   OriginalPaper 09 June 2010 Pages: 285 - 285

2. New combinatorial topology bounds for renaming: the lower bound

   • Armando Castañeda
   • Sergio Rajsbaum

   OriginalPaper 09 June 2010 Pages: 287 - 301

3. Adaptive progress: a gracefully-degrading liveness property

   • Marcos K. Aguilera
   • Sam Toueg

   OriginalPaper 25 June 2010 Pages: 303 - 334

4. Anti-Ω: the weakest failure detector for set agreement

   • Piotr Zieliński

   OriginalPaper 14 April 2010 Pages: 335 - 348

5. An optimal maximal independent set algorithm for bounded-independence graphs

   • Johannes Schneider
   • Roger Wattenhofer

   OriginalPaper 10 March 2010 Pages: 349 - 361

6. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

   • Leonid Barenboim
   • Michael Elkin

   OriginalPaper 03 September 2009 Pages: 363 - 379

7. The impact of randomization in smoothing networks

   • Marios Mavronicolas
   • Thomas Sauerwald

   OriginalPaper 10 September 2009 Pages: 381 - 411