| 2010 | Brief announcement: self-monitoring in dynamic wireless networks. | Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer |
| 2010 | Partial information spreading with application to distributed maximum coverage. | Keren Censor-Hillel, Hadas Shachnai |
| 2010 | The topology of shared-memory adversaries. | Maurice Herlihy, Sergio Rajsbaum |
| 2010 | Adaptive randomized mutual exclusion in sub-logarithmic expected time. | Danny Hendler, Philipp Woelfel |
| 2010 | Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? | Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse |
| 2010 | Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper. | Fabola Greve, Sbastien Tixeuil |
| 2010 | Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors. | Wojciech M. Golab |
| 2010 | Meeting the deadline: on the complexity of fault-tolerant continuous gossip. | Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski |
| 2010 | Brief announcement: on L-resilience, hitting sets, and colorless tasks. | Eli Gafni, Petr Kuznetsov |
| 2010 | Brief announcement: deterministic dominating set construction in networks with bounded degree. | Roy Friedman, Alex Kogan |
| 2010 | Distributed computational complexities: are you volvo-addicted or nascar-obsessed? | Pierre Fraigniaud |
| 2010 | Brief announcement: distributed almost stable marriage. | Patrik Floren, Petteri Kaski, Valentin Polishchuk, Jukka Suomela |
| 2010 | Distributed data classification in sensor networks. | Ittay Eyal, Idit Keidar, Raphael Rom |
| 2010 | Efficient threshold detection in a distributed environment: extended abstract. | Yuval Emek, Amos Korman |
| 2010 | Online set packing and competitive scheduling of multi-part tasks. | Yuval Emek, Magns M. Halldrsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz |
| 2010 | Discrete load balancing is (almost) as easy as continuous load balancing. | Robert Elssser, Thomas Sauerwald |
| 2010 | Non-blocking binary search trees. | Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel |
| 2010 | Purifying data by machine learning with certainty levels. | Shlomi Dolev, Guy Leshem, Reuven Yagel |
| 2010 | Brief announcement: swarming secrets. | Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov |
| 2010 | Brief announcement: leader election vs pattern formation. | Yoann Dieudonn, Franck Petit, Vincent Villain |
| 2010 | Optimal exploration of small rings. | Stphane Devismes |
| 2010 | Accessing probabilistic quorums in dynamic networks. | Oksana Denysyuk, Lus E. T. Rodrigues |
| 2010 | On the computational power of oblivious robots: forming a series of geometric patterns. | Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita |
| 2010 | The | Robert Danek |
| 2010 | How to meet when you forget: log-space rendezvous in arbitrary graphs. | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |