How much memory is needed for leader election Emanuele G. FuscoAndrzej Pelc OriginalPaper 09 April 2011 Pages: 65 - 78
Distributed discovery of large near-cliques Zvika BrakerskiBoaz Patt-Shamir OriginalPaper 26 April 2011 Pages: 79 - 89
Derandomizing random walks in undirected graphs using locally fair exploration strategies Colin CooperDavid IlcinkasAdrian Kosowski OriginalPaper 11 September 2011 Pages: 91 - 99
Fully-adaptive algorithms for long-lived renaming Alex BrodskyFaith EllenPhilipp Woelfel OriginalPaper 15 September 2011 Pages: 119 - 134