Abstract is missing.
- Sorting with Asymmetric Read and Write CostsGuy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun. 1-12 [doi]
- Practical Massively Parallel SortingMichael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz 0003. 13-23 [doi]
- A Top-Down Parallel SemisortYan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch. 24-34 [doi]
- Matrix Multiplication I/O-Complexity by Path RoutingJacob Scott, Olga Holtz, Oded Schwartz. 35-45 [doi]
- Online Caching with Convex Costs: Extended AbstractIshai Menache, Mohit Singh. 46-54 [doi]
- Myths and Misconceptions about ThreadsHans-Juergen Boehm. 55 [doi]
- Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & BeyondRajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh. 56-58 [doi]
- Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant DegreesReut Levi, Ronitt Rubinfeld, Anak Yodpinyanee. 59-61 [doi]
- Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest PathsLongkun Guo, Kewen Liao, Hong Shen, Peng Li. 62-64 [doi]
- Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center ClusteringSungjin Im, Benjamin Moseley. 65-67 [doi]
- Brief Announcement: Fair Adaptive Parallelism for Concurrent Transactional Memory ApplicationsAmin Mohtasham, João Barreto. 68-70 [doi]
- Brief Announcement: Managing Resource Limitation of Best-Effort HTMMohamed Mohamedin, Roberto Palmieri, Ahmed Hassan, Binoy Ravindran. 71-73 [doi]
- Brief Announcement: On Scheduling Best-Effort HTM TransactionsMohamed Mohamedin, Roberto Palmieri, Binoy Ravindran. 74-76 [doi]
- Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay NetworksAndreas Koutsopoulos, Christian Scheideler, Thim Strothmann. 77-79 [doi]
- Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority QueuesHamza Rihani, Peter Sanders, Roman Dementiev. 80-82 [doi]
- Brief Announcement: A Compiler-Runtime Application Binary Interface for Pipe-While LoopsJim Sukha. 83-85 [doi]
- Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix MultiplicationGrey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz. 86-88 [doi]
- The Cilkprof Scalability ProfilerTao B. Schardl, Bradley C. Kuszmaul, I-Ting Angelina Lee, William M. Leiserson, Charles E. Leiserson. 89-100 [doi]
- Race Detection in Two DimensionsDimitar Dimitrov, Martin T. Vechev, Vivek Sarkar. 101-110 [doi]
- Efficiently Detecting Races in Cilk Programs That Use Reducer HyperobjectsI-Ting Angelina Lee, Tao B. Schardl. 111-122 [doi]
- ThreadScan: Automatic and Scalable Memory ReclamationDan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit. 123-132 [doi]
- Speed Scaling in the Non-clairvoyant ModelYossi Azar, Nikhil R. Devanur, Zhiyi Huang 0002, Debmalya Panigrahi. 133-142 [doi]
- Cost-Oblivious Reallocation for Scheduling and PlanningMichael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert. 143-154 [doi]
- Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow TimeSungjin Im, Janardhan Kulkarni, Benjamin Moseley. 155-160 [doi]
- Scheduling Non-Unit Jobs to Minimize CalibrationsJeremy T. Fineman, Brendan Sheridan. 161-170 [doi]
- Scheduling in Bandwidth Constrained Tree NetworksSungjin Im, Benjamin Moseley. 171-180 [doi]
- The Revolution in Graph Theoretic Optimization ProblemsGary L. Miller. 181 [doi]
- Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter ApproximationMatteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. 182-191 [doi]
- Improved Parallel Algorithms for Spanners and HopsetsGary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu. 192-201 [doi]
- Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource ConstraintsKook Jin Ahn, Sudipto Guha. 202-211 [doi]
- Branch-Avoiding Graph AlgorithmsOded Green, Marat Dukhan, Richard W. Vuduc. 212-223 [doi]
- Seer: Probabilistic Scheduling for Hardware Transactional MemoryNuno Diegues, Paolo Romano, Stoyan Garbatov. 224-233 [doi]
- Conflict Reduction in Hardware Transactions Using Advisory LocksLingxiang Xiang, Michael L. Scott. 234-243 [doi]
- Transactional Acceleration of Concurrent Data StructuresYujie Liu, Tingzhe Zhou, Michael F. Spear. 244-253 [doi]
- Efficient Memory Management for Lock-Free Data Structures with Optimistic AccessNachshon Cohen, Erez Petrank. 254-263 [doi]
- Fault Tolerant BFS Structures: A Reinforcement-Backup TradeoffMerav Parter, David Peleg. 264-273 [doi]
- Distributed Backup Placement in NetworksMagnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz. 274-283 [doi]
- Better Deterministic Online Packet Routing on GridsGuy Even, Moti Medina, Boaz Patt-Shamir. 284-293 [doi]
- Minimizing the Total Weighted Completion Time of Coflows in Datacenter NetworksZhen Qiu, Cliff Stein, Yuan Zhong. 294-303 [doi]
- Electing a Leader in Wireless Networks Quickly Despite JammingMarek Klonowski, Dominik Pajak. 304-312 [doi]
- Communication-Efficient Computation on Distributed Noisy DatasetsQin Zhang. 313-322 [doi]
- Parallel Computation of Persistent Homology using the Blowup ComplexRyan Lewis, Dmitriy Morozov. 323-331 [doi]
- Self-Stabilizing Repeated Balls-into-BinsLuca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta. 332-339 [doi]
- Randomized Local Network ComputingLaurent Feuilloley, Pierre Fraigniaud. 340-349 [doi]