| 2013 | What can be decided locally without identifiers? | Pierre Fraigniaud, Mika Gs, Amos Korman, Jukka Suomela |
| 2013 | Brief announcement: fair maximal independent sets in trees. | Jeremy T. Fineman, Calvin C. Newport, Tonghe Wang |
| 2013 | Stone age distributed computing. | Yuval Emek, Roger Wattenhofer |
| 2013 | Introducing speculation in self-stabilization: an application to mutual exclusion. | Swan Dubois, Rachid Guerraoui |
| 2013 | Early-deciding consensus is expensive. | Danny Dolev, Christoph Lenzen |
| 2013 | How to meet asynchronously at polynomial cost. | Yoann Dieudonn, Andrzej Pelc, Vincent Villain |
| 2013 | Byzantine renaming in synchronous systems with t<N. | Oksana Denysyuk, Lus E. T. Rodrigues |
| 2013 | Brief announcement: self-stabilizing resource discovery algorithm. | Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman |
| 2013 | Maximal independent sets in multichannel radio networks. | Sebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, Calvin C. Newport |
| 2013 | Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribe. | Chen Chen, Roman Vitenberg, Hans-Arno Jacobsen |
| 2013 | Compact routing schemes with improved stretch. | Shiri Chechik |
| 2013 | Brief announcement: pareto optimal solutions to consensus and set consensus. | Armando Castaeda, Yannai A. Gonczarowski, Yoram Moses |
| 2013 | Pragmatic primitives for non-blocking data structures. | Trevor Brown, Faith Ellen, Eric Ruppert |
| 2013 | Fast byzantine agreement. | Nicolas Braud-Santoni, Rachid Guerraoui, Florian Huc |
| 2013 | Connectivity and aggregation in multihop wireless networks. | Marijke H. L. Bodlaender, Magns M. Halldrsson, Pradipta Mitra |
| 2013 | Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits. | Llia Blin, Sbastien Tixeuil |
| 2013 | Leaplist: lessons learned in designing tm-supported range queries. | Hillel Avni, Nir Shavit, Adi Suissa |
| 2013 | Fast byzantine agreement in dynamic networks. | John Augustine, Gopal Pandurangan, Peter Robinson |
| 2013 | An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. | Hagit Attiya, Danny Hendler, Smadar Levy |
| 2013 | A programming language perspective on transactional memory consistency. | Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky |
| 2013 | Upper bound on the complexity of solving hard renaming. | Hagit Attiya, Armando Castaeda, Maurice Herlihy, Ami Paz |
| 2013 | Randomized loose renaming in | Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel |
| 2013 | Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. | Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel |
| 2013 | A distributed algorithm for gathering many fat mobile robots in the plane. | Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas |
| 2013 | Brief announcement: on minimum interaction time for continuous distributed interactive computing. | Lu Zhang, Xueyan Tang, Bingsheng He |