| 2010 | Parallel approximation algorithms for facility-location problems. | Guy E. Blelloch, Kanat Tangwongsan |
| 2010 | Low depth cache-oblivious algorithms. | Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri |
| 2010 | Balls into bins with related random choices. | Petra Berenbrink, Andr Brinkmann, Tom Friedetzky, Lars Nagel |
| 2010 | Computing the throughput of probabilistic and replicated streaming applications. | Anne Benoit, Fanny Dufoss, Matthieu Gallet, Yves Robert, Bruno Gaujal |
| 2010 | Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory. | Michela Becchi, Surendra Byna, Srihari Cadambi, Srimat T. Chakradhar |
| 2010 | Implementing and evaluating nested parallel transactions in software transactional memory. | Woongki Baek, Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun |
| 2010 | Brief announcement: combine -- an improved directory-based consistency protocol. | Hagit Attiya, Vincent Gramoli, Alessia Milani |
| 2010 | Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. | Matti strand, Jukka Suomela |
| 2010 | Low-contention data structures. | James Aspnes, David Eisenstat, Yitong Yin |
| 2010 | Basic network creation games. | Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton |
| 2010 | Securing every bit: authenticated broadcast in radio networks. | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, Calvin C. Newport |
| 2010 | Database systems in the multicore era. | Anastasia Ailamaki |
| 2010 | Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages. | Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha |
| 2009 | Dynamic external hashing: the limit of buffering. | Zhewei Wei, Ke Yi, Qin Zhang |
| 2009 | NZTM: nonblocking zero-indirection transactional memory. | Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang |
| 2009 | Brief announcement: a lower bound for depth-restricted work stealing. | Jim Sukha |
| 2009 | Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. | Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper |
| 2009 | Towards transactional memory semantics for C++. | Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert Geva, Yang Ni, Adam Welc |
| 2009 | The weakest failure detector for wait-free dining under eventual weak exclusion. | Srikanth Sastry, Scott M. Pike, Jennifer L. Welch |
| 2009 | Approximation algorithms for time-constrained scheduling on line networks. | Harald Rcke, Adi Rosn |
| 2009 | Classifying peer-to-peer network coding schemes. | Christian Ortolf, Christian Schindelhauer, Arne Vater |
| 2009 | Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. | Melih Onus, Andra W. Richa |
| 2009 | A lightweight in-place implementation for software thread-level speculation. | Cosmin E. Oancea, Alan Mycroft, Tim Harris |
| 2009 | Finding similar users in social networks: extended abstract. | Aviv Nisgav, Boaz Patt-Shamir |
| 2009 | Power-aware online file allocation in mobile ad hoc networks: [extended abstract]. | Jan Mehler, Friedhelm Meyer auf der Heide |