| 2013 | Brief announcement: a simple stretch 2 distance oracle. | Rachit Agarwal, Philip Brighten Godfrey |
| 2012 | Brief announcement: a calculus of policy-based routing systems. | Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov |
| 2012 | Brief announcement: live streaming with utilities, quality and cost. | Ymir Vigfusson, Ken Birman, Daniel A. Freedman, Qi Huang, Kristjn Valur Jnsson, Gunnar Sigurbjrnsson |
| 2012 | Brief announcement: delay or deliver dilemma in organization networks. | Shailesh Vaya |
| 2012 | Iterative approximate byzantine consensus in arbitrary directed graphs. | Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang |
| 2012 | A closer look at fault tolerance. | Gadi Taubenfeld |
| 2012 | Brief announcement: maintaining large dense subgraphs on dynamic networks. | Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan |
| 2012 | Competitive and fair throughput for co-existing networks under adversarial interference. | Andra W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang |
| 2012 | Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors. | Michel Raynal, Julien Stainer |
| 2012 | Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectors. | Nuno M. Preguia, Carlos Baquero, Paulo Srgio Almeida, Victor Fonte, Ricardo Gonalves |
| 2012 | Brief announcement: tolerating permanent and transient value faults. | Zarko Milosevic, Martin Hutle, Andr Schiper |
| 2012 | Brief announcement: network-destabilizing attacks. | Robert Lychev, Sharon Goldberg, Michael Schapira |
| 2012 | Byzantine broadcast in point-to-point networks using local linear coding. | Guanfeng Liang, Nitin H. Vaidya |
| 2012 | Dynamic packet scheduling in wireless networks. | Thomas Kesselheim |
| 2012 | On the price of equivocation in byzantine agreement. | Alexander Jaffe, Thomas Moscibroda, Siddhartha Sen |
| 2012 | Optimal distributed all pairs shortest paths and applications. | Stephan Holzer, Roger Wattenhofer |
| 2012 | Distributed maximal matching: greedy is optimal. | Juho Hirvonen, Jukka Suomela |
| 2012 | Simulations and reductions for colorless tasks. | Maurice Herlihy, Sergio Rajsbaum |
| 2012 | Strongly linearizable implementations: possibilities and impossibilities. | Maryam Helmi, Lisa Higham, Philipp Woelfel |
| 2012 | Weak models of distributed computing, with connections to modal logic. | Lauri Hella, Matti Jrvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema |
| 2012 | Distributed connectivity of wireless networks. | Magns M. Halldrsson, Pradipta Mitra |
| 2012 | Brief announcement: network formation games can give rise to realistic networks. | Andrs Gulys, Attila Korsi, Gbor Rtvri, Jzsef Br, Dvid Szab |
| 2012 | Brief announcement: From sequential to concurrent: correctness and relative efficiency. | Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi |
| 2012 | Lower bounds for local approximation. | Mika Gs, Juho Hirvonen, Jukka Suomela |
| 2012 | Making evildoers pay: resource-competitive broadcast in sensor networks. | Seth Gilbert, Maxwell Young |