1. How much memory is needed for leader election

   • Emanuele G. Fusco
   • Andrzej Pelc

   OriginalPaper 09 April 2011 Pages: 65 - 78

2. Distributed discovery of large near-cliques

   • Zvika Brakerski
   • Boaz Patt-Shamir

   OriginalPaper 26 April 2011 Pages: 79 - 89

3. Derandomizing random walks in undirected graphs using locally fair exploration strategies

   • Colin Cooper
   • David Ilcinkas
   • Adrian Kosowski

   OriginalPaper 11 September 2011 Pages: 91 - 99

4. Modeling radio networks

   • Calvin Newport
   • Nancy Lynch

   OriginalPaper 06 July 2011 Pages: 101 - 118

5. Fully-adaptive algorithms for long-lived renaming

   • Alex Brodsky
   • Faith Ellen
   • Philipp Woelfel

   OriginalPaper 15 September 2011 Pages: 119 - 134