| 2006 | Smooth scheduling under variable rates or the analog-digital confinement game. | Ami Litman, Shiri Moran-Schein |
| 2006 | A performance analysis of local synchronization. | Julia Lipman, Quentin F. Stout |
| 2006 | Parallel depth first vs. work stealing schedulers on CMP architectures. | Vasileios Liaskovitis, Shimin Chen, Phillip B. Gibbons, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Michael Kozuch, Todd C. Mowry, Chris Wilkerson |
| 2006 | Minimizing the stretch when scheduling flows of biological requests. | Arnaud Legrand, Alan Su, Frdric Vivien |
| 2006 | A general approach for partitioning N-dimensional parallel nested loops with conditionals. | Arun Kejariwal, Alexandru Nicolau, Hideki Saito, Xinmin Tian, Milind Girkar, Utpal Banerjee, Constantine D. Polychronopoulos |
| 2006 | The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. | Alexis C. Kaporis, Paul G. Spirakis |
| 2006 | An empirical study to compare two parallel programming models. | Lorin Hochstein, Victor R. Basili |
| 2006 | Translating between itanium and sparc memory consistency models. | Lisa Higham, LillAnne Jackson |
| 2006 | Semi-oblivious routing. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton |
| 2006 | Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. | Michael T. Goodrich, Daniel S. Hirschberg |
| 2006 | On the price of heterogeneity in parallel systems. | Brighten Godfrey, Richard M. Karp |
| 2006 | Fault-tolerant semifast implementations of atomic read/write registers. | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman |
| 2006 | A distributed | Joachim Gehweiler, Christiane Lammersen, Christian Sohler |
| 2006 | Exponential separation of quantum and classical online space complexity. | Franois Le Gall |
| 2006 | The cache complexity of multithreaded cache oblivious algorithms. | Matteo Frigo, Volker Strumpen |
| 2006 | On the communication complexity of randomized broadcasting in random-like graphs. | Robert Elssser |
| 2006 | Towards small world emergence. | Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel |
| 2006 | The FG programming environment: good and good for you. | Elena Riccio Davidson |
| 2006 | The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. | Rezaul Alam Chowdhury, Vijaya Ramachandran |
| 2006 | Network design with weighted players. | Ho-Lin Chen, Tim Roughgarden |
| 2006 | Playing push vs pull: models and algorithms for disseminating dynamic data in networks. | R. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman |
| 2006 | Power-aware scheduling for makespan and flow. | David P. Bunde |
| 2006 | Fair online load balancing. | Niv Buchbinder, Joseph Naor |
| 2006 | An envolutionary path towards virtual shared memory with random access. | Jonathan Leighton Brown, Sue Goudy, Mike Heroux, Shan Shan Huang, Zhaofang Wen |
| 2006 | Compact routing with additive stretch using distance labelings. | Arthur Brady, Lenore Cowen |