Abstract is missing.
- Time vs. space trade-offs for rendezvous in treesJurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. 1-10 [doi]
- Allowing each node to communicate only once in a distributed system: shared whiteboard modelsFlorent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. 11-17 [doi]
- Optimal and competitive runtime bounds for continuous, local gathering of mobile robotsBarbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide. 18-26 [doi]
- Online multi-robot exploration of grid graphs with rectangular obstaclesChristian Ortolf, Christian Schindelhauer. 27-36 [doi]
- In search of parallel dimensionsRavi Rajwar. 37 [doi]
- Delegation and nesting in best-effort hardware transactional memoryYujie Liu, Stephan Diestelhorst, Michael F. Spear. 38-47 [doi]
- Design, verification and applications of a new read-write lock algorithmJun Shirako, Nick Vrvilo, Eric G. Mercer, Vivek Sarkar. 48-57 [doi]
- A lock-free B+treeAnastasia Braginsky, Erez Petrank. 58-67 [doi]
- Brief announcement: the problem based benchmark suiteJulian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan. 68-70 [doi]
- Brief announcement: subgraph isomorphism on a multithreaded shared memory architectureClaire C. Ralph, Vitus J. Leung, Will McLendon III. 71-73 [doi]
- Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore modelNeeraj Sharma, Sandeep Sen. 74-76 [doi]
- Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower boundsGrey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz. 77-79 [doi]
- Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean planeHenry Lin, Frans Schalekamp. 80-81 [doi]
- Parallel and I/O efficient set covering algorithmsGuy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan. 82-90 [doi]
- A scalable framework for heterogeneous GPU-based clustersFengguang Song, Jack Dongarra. 91-100 [doi]
- Faster and simpler width-independent parallel algorithms for positive semidefinite programmingRichard Peng, Kanat Tangwongsan. 101-108 [doi]
- Deterministic multi-channel information exchangeStephan Holzer, Thomas Locher, Yvonne Anne Pignolet, Roger Wattenhofer. 109-120 [doi]
- High-performance RMA-based broadcast on the intel SCCDarko Petrovic, Omid Shahmirzadi, Thomas Ropars, André Schiper. 121-130 [doi]
- The impact of the power law exponent on the behavior of a dynamic epidemic type processAdrian Ogierman, Robert Elsässer. 131-139 [doi]
- Discovery through gossipBernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun. 140-149 [doi]
- Abstraction failures in concurrent programmingDoug Lea. 150 [doi]
- SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer poolsElad Gidron, Idit Keidar, Dmitri Perelman, Yonathan Perez. 151-160 [doi]
- A non-blocking internal binary search treeShane V. Howley, Jeremy Jones. 161-171 [doi]
- Lower bounds for restricted-use objects: extended abstractJames Aspnes, Hagit Attiya, Keren Censor Hillel, Danny Hendler. 172-181 [doi]
- Brief announcement: towards a communication optimal fast multipole method and its implications at exascaleAparna Chandramowlishwaran, JeeWhan Choi, Kamesh Madduri, Richard W. Vuduc. 182-184 [doi]
- Brief announcement: application-sensitive QoS scheduling in storage serversAhmed Elnably, Peter J. Varman. 185-187 [doi]
- Brief announcement: a GPU accelerated iterated local search TSP solverKamil Rocki, Reiji Suda. 188-189 [doi]
- Brief announcement: speedups for parallel graph triconnectivityJames Alexander Edwards, Uzi Vishkin. 190-192 [doi]
- Communication-optimal parallel algorithm for strassen's matrix multiplicationGrey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz. 193-204 [doi]
- Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network designGuy E. Blelloch, Anupam Gupta, Kanat Tangwongsan. 205-213 [doi]
- A parallel buffer treeNodari Sitchinava, Norbert Zeh. 214-223 [doi]
- (3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasksKlaus Jansen. 224-235 [doi]
- Cache-conscious scheduling of streaming applicationsKunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo. 236-245 [doi]
- Non-clairvoyant weighted flow time scheduling with rejection penaltyHo-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu. 246-254 [doi]
- Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clustersNavendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv. 255-266 [doi]
- Hedonic clustering gamesMoran Feldman, Liane Lewin-Eytan, Joseph Naor. 267-276 [doi]
- Enforcing efficient equilibria in network design games via subsidiesJohn Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis. 277-286 [doi]
- Memory-mapping support for reducer hyperobjectsI.-Ting Angelina Lee, Aamir Shafi, Charles E. Leiserson. 287-297 [doi]
- On the cost of composing shared-memory algorithmsDan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa. 298-307 [doi]
- Greedy sequential maximal independent set and matching are parallel on averageGuy E. Blelloch, Jeremy T. Fineman, Julian Shun. 308-317 [doi]
- Efficient computation of distance sketches in distributed networksAtish Das Sarma, Michael Dinitz, Gopal Pandurangan. 318-326 [doi]
- Scheduling in wireless networks with rayleigh-fading interferenceJohannes Dams, Martin Hoefer, Thomas Kesselheim. 327-335 [doi]