| 2012 | Brief announcement: a tight RMR lower bound for randomized mutual exclusion. | George Giakkoupis, Philipp Woelfel |
| 2012 | On the time and space complexity of randomized test-and-set. | George Giakkoupis, Philipp Woelfel |
| 2012 | Collaborative search on the plane without communication. | Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sbastien Sereni |
| 2012 | Brief announcement: on the resilience of routing tables. | Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla |
| 2012 | Brief announcement: an obstacle to scalability in wireless networks. | Andrs Farag |
| 2012 | Generalized lattice agreement. | Jose M. Faleiro, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani |
| 2012 | Universal constructions that ensure disjoint-access parallelism and wait-freedom. | Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers |
| 2012 | The communication complexity of distributed task allocation. | Andrew Drucker, Fabian Kuhn, Rotem Oshman |
| 2012 | Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faults. | Oksana Denysyuk, Lus E. T. Rodrigues |
| 2012 | Wait-freedom with advice. | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
| 2012 | Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers. | Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman |
| 2012 | Leader election in shared spectrum radio networks. | Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport |
| 2012 | Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary. | Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia |
| 2012 | Aggregation in dynamic networks. | Alejandro Cornejo, Seth Gilbert, Calvin C. Newport |
| 2012 | Coalescing random walks and voting on graphs. | Colin Cooper, Robert Elssser, Hirotaka Ono, Tomasz Radzik |
| 2012 | Asynchronous failure detectors. | Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry |
| 2012 | On the (limited) power of non-equivocation. | Allen Clement, Flavio Junqueira, Aniket Kate, Rodrigo Rodrigues |
| 2012 | Information spreading in dynamic graphs. | Andrea Clementi, Riccardo Silvestri, Luca Trevisan |
| 2012 | Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics. | Evgenia Christoforou, Antonio Fernndez Anta, Chryssis Georgiou, Miguel A. Mosteiro, ngel Snchez |
| 2012 | Brief announcement: efficient optimally resilient statistical AVSS and its applications. | Ashish Choudhury, Arpita Patra |
| 2012 | Brief announcement: optimal amortized secret sharing with cheater identification. | Ashish Choudhury |
| 2012 | The cost of fault tolerance in multi-party communication complexity. | Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons |
| 2012 | Distributed algorithms for scheduling on line and tree networks. | Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal |
| 2012 | Brief announcement: waiting in dynamic networks. | Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita |
| 2012 | Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. | Armando Castaeda, Sergio Rajsbaum, Michel Raynal |