Abstract is missing.
- Graph expansion and communication costs of fast matrix multiplication: regular submissionGrey Ballard, James Demmel, Olga Holtz, Oded Schwartz. 1-12 [doi]
- Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphsGuy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan. 13-22 [doi]
- Linear-work greedy parallel approximate set cover and variantsGuy E. Blelloch, Richard Peng, Kanat Tangwongsan. 23-32 [doi]
- Parallelism in dynamic well-spaced point setsUmut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu. 33-42 [doi]
- A study of transactional memory vs. locks in practiceVictor Pankratius, Ali-Reza Adl-Tabatabai. 43-52 [doi]
- Optimizing hybrid transactional memory: the importance of nonspeculative operationsTorvald Riegel, Patrick Marlier, Martin Nowack, Pascal Felber, Christof Fetzer. 53-64 [doi]
- Flat-combining NUMA locksDavid Dice, Virendra J. Marathe, Nir Shavit. 65-74 [doi]
- Location-based memory fencesEdya Ladan-Mozes, I.-Ting Angelina Lee, Dmitry Vyukov. 75-84 [doi]
- Filtering: a method for solving graph problems in MapReduceSilvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii. 85-94 [doi]
- Parallelism and data movement characterization of contemporary application classesVictoria Caparrós Cabezas, Phillip Stanley-Marbell. 95-104 [doi]
- Work-stealing for mixed-mode parallelism by deterministic team-buildingMartin Wimmer, Jesper Larsson Träff. 105-116 [doi]
- The pochoir stencil compilerYuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson. 117-128 [doi]
- Brief announcement: full reversal routing as a linear dynamical systemBernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder. 129-130 [doi]
- Brief announcement: better speedups for parallel max-flowGeorge Constantin Caragea, Uzi Vishkin. 131-134 [doi]
- Brief announcement: reclaiming the energy of a schedule, models and algorithmsGuillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert. 135-136 [doi]
- Brief announcement: paging for multicore processorsAlejandro López-Ortiz, Alejandro Salinger. 137-138 [doi]
- A tight runtime bound for synchronous gathering of autonomous robots with limited visibilityBastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer. 139-148 [doi]
- Stabilizing consensus with the power of two choicesBenjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler. 149-158 [doi]
- Convergence of local communication chain strategies via linear transformations: or how to trade locality for speedPeter Kling, Friedhelm Meyer auf der Heide. 159-166 [doi]
- The car sharing problemPatrick Briest, Christoph Raupach. 167-176 [doi]
- Approximation algorithms for secondary spectrum auctionsMartin Hoefer, Thomas Kesselheim, Berthold Vöcking. 177-186 [doi]
- Maximising lifetime for fault-tolerant target coverage in sensor networksThomas Erlebach, Tom Grant, Frank Kammer. 187-196 [doi]
- Convergence to equilibrium of logit dynamics for strategic gamesVincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano. 197-206 [doi]
- On a bounded budget network creation gameShayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee. 207-214 [doi]
- Online packet-routing in grids with bounded buffersGuy Even, Moti Medina. 215-224 [doi]
- Sparse spanners vs. compact routingCyril Gavoille, Christian Sommer 0002. 225-234 [doi]
- Re-Chord: a self-stabilizing chord overlay networkSebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler. 235-244 [doi]
- Recommender systems with non-binary gradesYossi Azar, Aviv Nisgav, Boaz Patt-Shamir. 245-252 [doi]
- Brief announcement: distributed shared memory based on computation migrationMieszko Lis, Keun Sup Shim, Myong Hyon Cho, Christopher W. Fletcher, Michel A. Kinsy, Ilia A. Lebedev, Omer Khan, Srinivas Devadas. 253-256 [doi]
- Brief announcement: communication bounds for heterogeneous architecturesGrey Ballard, James Demmel, Andrew Gearhart. 257-258 [doi]
- Brief announcement: large-scale multimapsMichael T. Goodrich, Michael Mitzenmacher. 259-260 [doi]
- Brief announcement: processor allocation for optimistic parallelization of irregular programsFrancesco Versaci, Keshav Pingali. 261-262 [doi]
- Brief announcement: locality-enhancing loop transformations for tree traversal algorithmsYoungjoon Jo, Milind Kulkarni. 263-264 [doi]
- Brief announcement: program regularization in verifying memory consistencyLei Li, Tianshi Chen, Yunji Chen, Ling Li, Cheng Qian, Weiwu Hu. 265-266 [doi]
- Brief announcement: RedRem: a parallel redundancy removerHrishikesh B. Acharya, Mohamed G. Gouda. 267-268 [doi]
- On a local protocol for concurrent file transfersMohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat. 269-278 [doi]
- On multi-processor speed scaling with migration: extended abstractSusanne Albers, Antonios Antoniadis, Gero Greiner. 279-288 [doi]
- On scheduling in map-reduce and flow-shopsBenjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. 289-298 [doi]
- Finding heavy distinct hitters in data streamsThomas Locher. 299-308 [doi]
- Brief announcement: a partitioned ticket lockDavid Dice. 309-310 [doi]
- Brief announcement: transaction polymorphismVincent Gramoli, Rachid Guerraoui. 311-312 [doi]
- Brief announcement: multilane - a concurrent blocking multisetDavid Dice, Oleksandr Otenko. 313-314 [doi]
- Brief announcement: read invisibility, virtual world consistency and permissiveness are compatibleTyler Crain, Damien Imbs, Michel Raynal. 315-316 [doi]
- Tight bounds for anonymous adopt-commit objectsJames Aspnes, Faith Ellen. 317-324 [doi]
- A highly-efficient wait-free universal constructionPanagiota Fatourou, Nikolaos D. Kallimanis. 325-334 [doi]
- A lock-free algorithm for concurrent bagsHåkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas. 335-344 [doi]
- Understanding bloom filter intersection for lazy address-set disambiguationMark C. Jeffrey, J. Gregory Steffan. 345-354 [doi]
- Scheduling irregular parallel computations on hierarchical cachesGuy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri. 355-366 [doi]
- Sharing-aware algorithms for virtual machine colocationMichael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy. 367-378 [doi]