| 2007 | Bringing order to BGP: decreasing time and message complexity. | Anat Bremler-Barr, Nir Chen, Jussi Kangasharju, Osnat Mokryn, Yuval Shavitt |
| 2007 | An algorithm composition scheme preserving monotonicity. | Davide Bil, Luca Forlizzi, Luciano Gual, Guido Proietti |
| 2007 | Tolerating corrupted communication. | Martin Biely, Josef Widder, Bernadette Charron-Bost, Antoine Gaillard, Martin Hutle, Andr Schiper |
| 2007 | Self-stabilizing counting in mobile sensor networks. | Joffroy Beauquier, Julien Clment, Stphane Messika, Laurent Rosaz, Brigitte Rozoy |
| 2007 | Solvability of geocasting in mobile ad-hoc networks. | Roberto Baldoni, Kleoni Ioannidou, Alessia Milani |
| 2007 | A denial-of-service resistant DHT. | Baruch Awerbuch, Christian Scheideler |
| 2007 | Asynchronous recommendation systems. | Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir |
| 2007 | On cost sharing mechanisms in the network design game. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | Distributed network monitoring and multicommodity flows: a primal-dual approach. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | Greedy distributed optimization of multi-commodity flows. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | The power of DCAS: highly-concurrent software transactional memory. | Hagit Attiya, Eshcar Hillel |
| 2007 | The complexity of updating multi-writer snapshot objects. | Hagit Attiya, Faith Ellen, Panagiota Fatourou |
| 2007 | Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. | Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi |
| 2007 | Remote storage with byzantine servers. | Marcos Kawazoe Aguilera, Ram Swaminathan |
| 2007 | Abortable and query-abortable objects and their efficient implementation. | Marcos Kawazoe Aguilera, Svend Frlund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg |
| 2007 | Reconstructing approximate tree metrics. | Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar |
| 2006 | Life is not a state-machine: the long road from research to production. | Werner Vogels |
| 2006 | Sketching asynchronous streams over a sliding window. | Srikanta Tirthapura, Bojian Xu, Costas Busch |
| 2006 | Possibility and complexity of probabilistic reliable communication in directed networks. | Kannan Srinathan, C. Pandu Rangan |
| 2006 | Irreducibility and additivity of set agreement-oriented failure detector classes. | Achour Mostfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers |
| 2006 | Computing separable functions via gossip. | Damon Mosk-Aoyama, Devavrat Shah |
| 2006 | On the topologies formed by selfish peers. | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer |
| 2006 | When selfish meets evil: byzantine players in a virus inoculation game. | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer |
| 2006 | Peer counting and sampling in overlay networks: random walk methods. | Laurent Massouli, Erwan Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh |