| Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting | 0 | 0.34 | 2022 |
| Fast and Fair Randomized Wait-Free Locks | 0 | 0.34 | 2022 |
| Parallel block-delayed sequences | 0 | 0.34 | 2022 |
| Lock-free locks revisited | 0 | 0.34 | 2022 |
| Joinable Parallel Balanced Binary Trees | 0 | 0.34 | 2022 |
| PaC-Trees: Supporting Parallel and Compressed Purely-Functional Collections | 0 | 0.34 | 2022 |
| Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms | 0 | 0.34 | 2021 |
| SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures | 0 | 0.34 | 2021 |
| The Read-Only Semi-External Model | 1 | 0.36 | 2021 |
| Space and Time Bounded Multiversion Garbage Collection. | 0 | 0.34 | 2021 |
| Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. | 0 | 0.34 | 2020 |
| Parallelism in Randomized Incremental Algorithms | 0 | 0.34 | 2020 |
| Brief Announcement - Concurrent Fixed-Size Allocation and Free in Constant Time. | 0 | 0.34 | 2020 |
| Randomized Incremental Convex Hull is Highly Parallel | 1 | 0.34 | 2020 |
| LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS | 0 | 0.34 | 2020 |
| Parallel Batch-Dynamic Trees via Change Propagation. | 0 | 0.34 | 2020 |
| NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey | 2 | 0.36 | 2020 |
| Parallel Range, Segment and Rectangle Queries with Augmented Maps. | 0 | 0.34 | 2019 |
| Implementing parallel and concurrent tree structures. | 1 | 0.37 | 2019 |
| Batch-Parallel Euler Tour Trees. | 0 | 0.34 | 2019 |
| PAM: Parallel Augmented Maps. | 1 | 0.34 | 2018 |
| Making Concurrent Algorithms Detectable. | 0 | 0.34 | 2018 |
| Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. | 8 | 0.44 | 2018 |
| Efficient Single Writer Concurrency. | 1 | 0.37 | 2018 |
| Technical Perspective: Functional compilers. | 0 | 0.34 | 2017 |
| Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction. | 5 | 0.43 | 2017 |
| Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies | 0 | 0.34 | 2017 |
| Parallel Algorithms for Asymmetric Read-Write Costs. | 9 | 0.51 | 2016 |
| A New Efficient Construction on Probabilistic Tree Embeddings. | 1 | 0.34 | 2016 |
| Parallel Ordered Sets Using Join. | 0 | 0.34 | 2016 |
| Sorting with Asymmetric Read and Write Costs. | 11 | 0.55 | 2016 |
| Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm | 1 | 0.35 | 2015 |
| Cache efficient functional algorithms | 0 | 0.34 | 2015 |
| Sequential random permutation, list contraction and tree contraction are highly parallel | 8 | 0.50 | 2015 |
| Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest | 2 | 0.37 | 2014 |
| Phase-concurrent hash tables for determinism | 11 | 0.48 | 2014 |
| Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data. | 0 | 0.34 | 2013 |
| Cache and I/O efficent functional algorithms | 6 | 0.52 | 2013 |
| Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). | 0 | 0.34 | 2013 |
| Efficient BVH construction via approximate agglomerative clustering | 23 | 0.79 | 2013 |
| Greedy sequential maximal independent set and matching are parallel on average | 18 | 0.62 | 2012 |
| Problem Based Benchmarks. | 0 | 0.34 | 2012 |
| Internally deterministic parallel algorithms can be fast | 39 | 1.22 | 2012 |
| Parallel and I/O efficient set covering algorithms | 14 | 0.88 | 2012 |
| Brief announcement: the problem based benchmark suite | 77 | 2.25 | 2012 |
| Introduction to special issue ALENEX'10. | 0 | 0.34 | 2011 |
| A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. | 5 | 0.46 | 2011 |
| Scheduling irregular parallel computations on hierarchical caches | 28 | 0.92 | 2011 |
| Generalized buneman pruning for inferring the most parsimonious multi-state phylogeny. | 5 | 0.47 | 2011 |
| Linear-work greedy parallel approximate set cover and variants | 23 | 0.91 | 2011 |
