| 2013 | Programming models for extreme-scale computing. | Marc Snir |
| 2013 | Feedback from nature: an optimal distributed algorithm for maximal independent set selection. | Alex Scott, Peter Jeavons, Lei Xu |
| 2013 | Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. | Michel Raynal, Julien Stainer |
| 2013 | The SkipTrie: low-depth concurrent search without rebalancing. | Rotem Oshman, Nir Shavit |
| 2013 | Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks. | Calvin C. Newport |
| 2013 | Plenary talk. | Michael Merritt |
| 2013 | Athena lecture: distributed computing theory for wireless networks and mobile systems. | Nancy A. Lynch |
| 2013 | Fair and resilient incentive tree mechanisms. | Yuezhou Lv, Thomas Moscibroda |
| 2013 | On the complexity of asynchronous agreement against powerful adversaries. | Allison B. Lewko, Mark Lewko |
| 2013 | Efficient distributed source detection with limited bandwidth. | Christoph Lenzen, David Peleg |
| 2013 | Optimal deterministic routing and sorting on the congested clique. | Christoph Lenzen |
| 2013 | On the complexity of universal leader election. | Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan |
| 2013 | Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits. | Dariusz R. Kowalski, Achour Mostfaoui |
| 2013 | The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. | Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald |
| 2013 | Brief announcement: byzantine agreement with a strong adversary in polynomial expected time. | Valerie King, Jared Saia |
| 2013 | Brief announcement: scalable anonymous communication with byzantine adversary. | Josh R. Karlin, Joud S. Khoury, Jared Saia, Mahdi Zamani |
| 2013 | Brief announcement: brokerage and closure in a strategic model of social capital. | Samuel D. Johnson, Raissa M. D'Souza |
| 2013 | Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction. | Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder |
| 2013 | Brief announcement: threshold load balancing in networks. | Martin Hoefer, Thomas Sauerwald |
| 2013 | Distributed algorithms for barrier coverage using relocatable sensors. | Mohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende |
| 2013 | On deterministic abortable objects. | Vassos Hadzilacos, Sam Toueg |
| 2013 | Highly dynamic distributed computing with byzantine failures. | Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec |
| 2013 | Brief announcement: an asymmetric flat-combining based queue algorithm. | Michael Gorelik, Danny Hendler |
| 2013 | The cost of radio network broadcast for different models of unreliable links. | Mohsen Ghaffari, Nancy A. Lynch, Calvin C. Newport |
| 2013 | Randomized broadcast in radio networks with collision detection. | Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian |