| 2013 | A distributed algorithm for gathering many fat mobile robots in the plane. Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas |
| 2013 | A programming language perspective on transactional memory consistency. Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky |
| 2013 | ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013 Panagiota Fatourou, Gadi Taubenfeld |
| 2013 | An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. Hagit Attiya, Danny Hendler, Smadar Levy |
| 2013 | Athena lecture: distributed computing theory for wireless networks and mobile systems. Nancy A. Lynch |
| 2013 | Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks. Wojciech Wawrzyniak |
| 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 | Brief announcement: a simple stretch 2 distance oracle. Rachit Agarwal, Philip Brighten Godfrey |
| 2013 | Brief announcement: an asymmetric flat-combining based queue algorithm. Michael Gorelik, Danny Hendler |
| 2013 | Brief announcement: brokerage and closure in a strategic model of social capital. Samuel D. Johnson, Raissa M. D'Souza |
| 2013 | Brief announcement: byzantine agreement with a strong adversary in polynomial expected time. Valerie King, Jared Saia |
| 2013 | Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe. Chen Chen, Roman Vitenberg, Hans-Arno Jacobsen |
| 2013 | Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. Lélia Blin, Sébastien Tixeuil |
| 2013 | Brief announcement: fair maximal independent sets in trees. Jeremy T. Fineman, Calvin C. Newport, Tonghe Wang |
| 2013 | Brief announcement: on minimum interaction time for continuous distributed interactive computing. Lu Zhang, Xueyan Tang, Bingsheng He |
| 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: pareto optimal solutions to consensus and set consensus. Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses |
| 2013 | Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel |
| 2013 | Brief announcement: scalable anonymous communication with byzantine adversary. Josh R. Karlin, Joud S. Khoury, Jared Saia, Mahdi Zamani |
| 2013 | Brief announcement: self-stabilizing resource discovery algorithm. Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman |
| 2013 | Brief announcement: techniques for programmatically troubleshooting distributed systems. Sam Whitlock, Colin Scott, Scott Shenker |
| 2013 | Brief announcement: threshold load balancing in networks. Martin Hoefer, Thomas Sauerwald |
| 2013 | Byzantine renaming in synchronous systems with t<N. Oksana Denysyuk, Luís E. T. Rodrigues |
| 2013 | Byzantine vector consensus in complete graphs. Nitin H. Vaidya, Vijay K. Garg |
| 2013 | Compact routing schemes with improved stretch. Shiri Chechik |
| 2013 | Connectivity and aggregation in multihop wireless networks. Marijke H. L. Bodlaender, Magnús M. Halldórsson, Pradipta Mitra |
| 2013 | Delegation of computation with verification outsourcing: curious verifiers. Gang Xu, George T. Amariucai, Yong Guan |
| 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 | Early-deciding consensus is expensive. Danny Dolev, Christoph Lenzen |
| 2013 | Efficient distributed source detection with limited bandwidth. Christoph Lenzen, David Peleg |
| 2013 | Fair and resilient incentive tree mechanisms. Yuezhou Lv, Thomas Moscibroda |
| 2013 | Fast byzantine agreement in dynamic networks. John Augustine, Gopal Pandurangan, Peter Robinson |
| 2013 | Fast byzantine agreement. Nicolas Braud-Santoni, Rachid Guerraoui, Florian Huc |
| 2013 | Feedback from nature: an optimal distributed algorithm for maximal independent set selection. Alex Scott, Peter Jeavons, Lei Xu |
| 2013 | Highly dynamic distributed computing with byzantine failures. Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec |
| 2013 | How to meet asynchronously at polynomial cost. Yoann Dieudonné, Andrzej Pelc, Vincent Villain |
| 2013 | Introducing speculation in self-stabilization: an application to mutual exclusion. Swan Dubois, Rachid Guerraoui |
| 2013 | Leaplist: lessons learned in designing tm-supported range queries. Hillel Avni, Nir Shavit, Adi Suissa |
| 2013 | Maximal independent sets in multichannel radio networks. Sebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, Calvin C. Newport |
| 2013 | On deterministic abortable objects. Vassos Hadzilacos, Sam Toueg |
| 2013 | On the complexity of asynchronous agreement against powerful adversaries. Allison B. Lewko, Mark Lewko |
| 2013 | On the complexity of universal leader election. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan |
| 2013 | Optimal deterministic routing and sorting on the congested clique. Christoph Lenzen |
| 2013 | Plenary talk. Michael Merritt |
| 2013 | Pragmatic primitives for non-blocking data structures. Trevor Brown, Faith Ellen, Eric Ruppert |
| 2013 | Programming models for extreme-scale computing. Marc Snir |
| 2013 | Randomized broadcast in radio networks with collision detection. Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian |
| 2013 | Randomized loose renaming in Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel |
| 2013 | Stable and scalable universal swarms. Ji Zhu, Stratis Ioannidis, Nidhi Hegde, Laurent Massoulié |
| 2013 | Stone age distributed computing. Yuval Emek, Roger Wattenhofer |
| 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 Mostéfaoui |
| 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 | The cost of radio network broadcast for different models of unreliable links. Mohsen Ghaffari, Nancy A. Lynch, Calvin C. Newport |
| 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 | Upper bound on the complexity of solving hard renaming. Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz |
| 2013 | What can be decided locally without identifiers? Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela |
| 2013 | What's a little collusion between friends? Edmund L. Wong, Lorenzo Alvisi |