| Parallel Shortest Paths with Negative Edge Weights | 0 | 0.34 | 2022 |
| Smoothed Analysis of Information Spreading in Dynamic Networks. | 0 | 0.34 | 2022 |
| Brief Announcement: Nested Active-Time Scheduling | 0 | 0.34 | 2022 |
| Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm | 0 | 0.34 | 2021 |
| Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths | 1 | 0.35 | 2020 |
| Contention Resolution with Message Deadlines | 0 | 0.34 | 2020 |
| Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths | 0 | 0.34 | 2020 |
| Nearly Work-Efficient Parallel Algorithm for Digraph Reachability. | 1 | 0.35 | 2020 |
| I/O-Efficient Algorithms for Topological Sort and Related Problems. | 0 | 0.34 | 2019 |
| Efficient Race Detection with Futures. | 1 | 0.36 | 2019 |
| Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. | 2 | 0.38 | 2019 |
| Optimal Parallel Algorithms in the Binary-Forking Model. | 0 | 0.34 | 2019 |
| Implicit Decomposition for Write-Efficient Connectivity Algorithms | 4 | 0.38 | 2018 |
| Race Detection and Reachability in Nearly Series-Parallel DAGs. | 1 | 0.35 | 2018 |
| Cross-Referenced Dictionaries and the Limits of Write Optimization. | 1 | 0.36 | 2017 |
| File Maintenance: When in Doubt, Change the Layout! | 0 | 0.34 | 2017 |
| The Online House Numbering Problem: Min-Max Online List Labeling. | 0 | 0.34 | 2017 |
| Nearly work-efficient parallel algorithm for digraph reachability | 2 | 0.39 | 2017 |
| Parallel Algorithms for Asymmetric Read-Write Costs. | 9 | 0.51 | 2016 |
| Contention Resolution on Multiple Channels with Collision Detection. | 5 | 0.38 | 2016 |
| Cache-Adaptive Analysis. | 2 | 0.37 | 2016 |
| Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs. | 8 | 0.43 | 2016 |
| Sorting with Asymmetric Read and Write Costs. | 11 | 0.55 | 2016 |
| A case for distributed work-stealing in regular applications | 0 | 0.34 | 2016 |
| Contention Resolution on a Fading Channel. | 7 | 0.72 | 2016 |
| How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. | 12 | 0.47 | 2016 |
| Cost-Oblivious Reallocation for Scheduling and Planning | 2 | 0.37 | 2015 |
| Smoothed Analysis of Dynamic Networks | 1 | 0.36 | 2015 |
| Resource-Competitive Algorithms | 5 | 0.39 | 2015 |
| Scheduling Non-Unit Jobs to Minimize Calibrations | 4 | 0.60 | 2015 |
| Sequential random permutation, list contraction and tree contraction are highly parallel | 8 | 0.50 | 2015 |
| Efficient Algorithms under Asymmetric Read and Write Costs | 1 | 0.34 | 2015 |
| Cache-conscious scheduling of streaming pipelines on parallel machines with private caches | 1 | 0.35 | 2014 |
| NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World. | 0 | 0.34 | 2014 |
| Cache-Oblivious Persistence. | 0 | 0.34 | 2014 |
| Cost-oblivious storage reallocation | 4 | 0.42 | 2014 |
| Fair Maximal Independent Sets | 0 | 0.34 | 2014 |
| Brief announcement: cache-oblivious scheduling of streaming pipelines | 0 | 0.34 | 2014 |
| Provably good scheduling for parallel programs that use data structures through implicit batching | 3 | 0.39 | 2014 |
| Cache-adaptive algorithms | 1 | 0.35 | 2014 |
| Reallocation problems in scheduling | 7 | 0.45 | 2013 |
| Brief announcement: fair maximal independent sets in trees | 0 | 0.34 | 2013 |
| Reducing contention through priority updates | 8 | 0.44 | 2013 |
| Program-centric cost models for locality | 0 | 0.34 | 2013 |
| Greedy sequential maximal independent set and matching are parallel on average | 18 | 0.62 | 2012 |
| Internally deterministic parallel algorithms can be fast | 39 | 1.22 | 2012 |
| Brief announcement: the problem based benchmark suite | 77 | 2.25 | 2012 |
| Cache-conscious scheduling of streaming applications | 6 | 0.58 | 2012 |
| Scheduling irregular parallel computations on hierarchical caches | 28 | 0.92 | 2011 |
| A New Approach to Incremental Cycle Detection and Related Problems | 12 | 0.68 | 2011 |
