Abstract is missing.
- A distributed perspective on graph connectivity and cutsFabian Kuhn. 1 [doi]
- On dynamic bin packing for resource allocation in the cloudYusen Li, Xueyan Tang, Wentong Cai. 2-11 [doi]
- On the online fault-tolerant server consolidation problemKhuzaima Daudjee, Shahin Kamali, Alejandro López-Ortiz. 12-21 [doi]
- Competitively scheduling tasks with intermediate parallelizabilitySungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng. 22-29 [doi]
- Experimental analysis of space-bounded schedulersHarsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola. 30-41 [doi]
- On computing maximal independent sets of hypergraphs in parallelIoana O. Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan. 42-50 [doi]
- Hierarchical graph partitioningMohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha. 51-60 [doi]
- Simple parallel and distributed algorithms for spectral graph sparsificationIoannis Koutis. 61-66 [doi]
- Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability)Bradley C. Kuszmaul, William Kuszmaul. 67-69 [doi]
- Brief announcement: queue delegation lockingDavid Klaftenegger, Konstantinos F. Sagonas, Kjell Winblad. 70-72 [doi]
- Brief announcement: fast dual ring queuesJoseph Izraelevitz, Michael L. Scott. 73-75 [doi]
- Brief announcement: concurrent data structures for efficient streaming aggregationDaniel Cederman, Vincenzo Gulisano, Yiannis Nikolakopoulos, Marina Papatriantafilou, Philippas Tsigas. 76-78 [doi]
- Brief announcement: cache-oblivious scheduling of streaming pipelinesKunal Agrawal, Jeremy T. Fineman. 79-81 [doi]
- Brief announcement: persistent unfairness arising from cache residency imbalanceDave Dice, Virendra J. Marathe, Nir Shavit. 82-83 [doi]
- Provably good scheduling for parallel programs that use data structures through implicit batchingKunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, Robert Utterback. 84-95 [doi]
- Phase-concurrent hash tables for determinismJulian Shun, Guy E. Blelloch. 96-107 [doi]
- Scheduling selfish jobs on multidimensional parallel machinesLeah Epstein, Elena Kleiman. 108-117 [doi]
- LP rounding and combinatorial algorithms for minimizing active and busy timeJessica Chang, Samir Khuller, Koyel Mukherjee. 118-127 [doi]
- Scheduling shared continuous resources on many-coresAndré Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß. 128-137 [doi]
- A note on multiprocessor speed scaling with precedence constraintsEvripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli. 138-142 [doi]
- A simple and practical linear-work parallel algorithm for connectivityJulian Shun, Laxman Dhulipala, Guy E. Blelloch. 143-153 [doi]
- Executing dynamic data-graph computations deterministically using chromatic schedulingTim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson. 154-165 [doi]
- Ordering heuristics for parallel graph coloringWilliam Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson. 166-177 [doi]
- The PCL theorem: transactions cannot be parallel, consistent and liveVictor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui. 178-187 [doi]
- Adaptive integration of hardware and software lock elision techniquesDave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir. 188-197 [doi]
- Transaction-friendly condition variablesChao Wang, Yujie Liu, Michael F. Spear. 198-207 [doi]
- Brief announcement: fairness-efficiency tradeoffs in tiered storage allocationPeter Varman, Hui Wang. 208-210 [doi]
- Brief announcement: deadline-aware scheduling of big-data processing jobsPeter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv. 211-213 [doi]
- Brief announcement: parallelization of asynchronous variational integrators forshared memory architecturesMuhammad Amber Hassaan, Donald Nguyen, Keshav Pingali. 214-216 [doi]
- Brief annoucement: a distributed minimum cut approximation schemeHsin-Hao Su. 217-219 [doi]
- Brief announcement: amoebot - a new model for programmable matterZahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann. 220-222 [doi]
- Brief announcement: faster 3-periodic merging networksMarek Piotrów. 223-225 [doi]
- Automatic complexity analysis of explicitly parallel programsTorsten Hoefler, Grzegorz Kwasniewski. 226-235 [doi]
- Parallel streaming frequency-based aggregatesKanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu. 236-245 [doi]
- A universal approach to data center network designBruce M. Maggs. 246 [doi]
- Simple dynamics for plurality consensusLuca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan. 247-256 [doi]
- (Near) optimal resource-competitive broadcast with jammingSeth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young. 257-266 [doi]
- Ephemeral networks with random availability of links: diameter and connectivityEleni Ch. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis. 267-276 [doi]
- Locality-based network creation gamesDavide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti. 277-286 [doi]
- Finding approximate partitions and splitters in external memoryXiaocheng Hu, Yufei Tao, Yi Yang, Shuigeng Zhou. 287-295 [doi]
- On characterizing the data movement complexity of computational DAGs for parallel executionVenmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam, P. Sadayappan. 296-306 [doi]
- Tradeoffs between synchronization, communication, and computation in parallel linear algebra computationsEdgar Solomonik, Erin Carson, Nicholas Knight, James Demmel. 307-318 [doi]
- Parallel peeling algorithmsJiayang Jiang, Michael Mitzenmacher, Justin Thaler. 319-330 [doi]
- Balanced allocations and double hashingMichael Mitzenmacher. 331-342 [doi]