| 2012 | Scheduling in wireless networks with rayleigh-fading interference. | Johannes Dams, Martin Hoefer, Thomas Kesselheim |
| 2012 | Time vs. space trade-offs for rendezvous in trees. | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
| 2012 | Brief announcement: towards a communication optimal fast multipole method and its implications at exascale. | Aparna Chandramowlishwaran, JeeWhan Choi, Kamesh Madduri, Richard W. Vuduc |
| 2012 | Non-clairvoyant weighted flow time scheduling with rejection penalty. | Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu |
| 2012 | A lock-free B+tree. | Anastasia Braginsky, Erez Petrank |
| 2012 | Parallel and I/O efficient set covering algorithms. | Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan |
| 2012 | Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. | Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan |
| 2012 | Greedy sequential maximal independent set and matching are parallel on average. | Guy E. Blelloch, Jeremy T. Fineman, Julian Shun |
| 2012 | Allowing each node to communicate only once in a distributed system: shared whiteboard models. | Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan |
| 2012 | Communication-optimal parallel algorithm for strassen's matrix multiplication. | Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz |
| 2012 | Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. | Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz |
| 2012 | Enforcing efficient equilibria in network design games via subsidies. | John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis |
| 2012 | Lower bounds for restricted-use objects: extended abstract. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler |
| 2012 | On the cost of composing shared-memory algorithms. | Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa |
| 2012 | Cache-conscious scheduling of streaming applications. | Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo |
| 2011 | Work-stealing for mixed-mode parallelism by deterministic team-building. | Martin Wimmer, Jesper Larsson Trff |
| 2011 | Brief announcement: processor allocation for optimistic parallelization of irregular programs. | Francesco Versaci, Keshav Pingali |
| 2011 | The pochoir stencil compiler. | Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson |
| 2011 | A lock-free algorithm for concurrent bags. | Hkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas |
| 2011 | Sharing-aware algorithms for virtual machine colocation. | Michael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy |
| 2011 | Optimizing hybrid transactional memory: the importance of nonspeculative operations. | Torvald Riegel, Patrick Marlier, Martin Nowack, Pascal Felber, Christof Fetzer |
| 2011 | A study of transactional memory vs. locks in practice. | Victor Pankratius, Ali-Reza Adl-Tabatabai |
| 2011 | On scheduling in map-reduce and flow-shops. | Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tams Sarls |
| 2011 | Brief announcement: paging for multicore processors. | Alejandro Lpez-Ortiz, Alejandro Salinger |
| 2011 | Finding heavy distinct hitters in data streams. | Thomas Locher |