| Duet Benchmarking: Improving Measurement Accuracy in the Cloud | 1 | 0.35 | 2020 |
| Non-blocking interpolation search trees with doubly-logarithmic running time. | 1 | 0.36 | 2020 |
| An optimization-driven incremental inline substitution algorithm for just-in-time compilers | 0 | 0.34 | 2019 |
| Renaissance: benchmarking suite for parallel applications on the JVM | 4 | 0.44 | 2019 |
| On Evaluating the Renaissance Benchmarking Suite: Variety, Performance, and Complexity. | 0 | 0.34 | 2019 |
| Renaissance: a modern benchmark suite for parallel applications on the JVM | 1 | 0.35 | 2019 |
| Pluggable scheduling for the reactor programming model. | 4 | 0.42 | 2018 |
| Cache-tries: concurrent lock-free hash tries with constant-time operations. | 1 | 0.35 | 2018 |
| On the Soundness of Coroutines with Snapshots. | 0 | 0.34 | 2018 |
| Efficient Lock-Free Removing and Compaction for the Cache-Trie Data Structure. | 0 | 0.34 | 2018 |
| Theory and Practice of Coroutines with Snapshots. | 1 | 0.36 | 2018 |
| Cache-Aware Lock-Free Concurrent Hash Tries | 5 | 0.55 | 2017 |
| Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations. | 0 | 0.34 | 2017 |
| Making collection operations optimal with aggressive JIT compilation. | 4 | 0.40 | 2017 |
| Encoding the building blocks of communication. | 2 | 0.36 | 2017 |
| Accelerating by Idling: How Speculative Delays Improve Performance of Message-Oriented Systems. | 1 | 0.35 | 2017 |
| Efficient Lock-Free Work-Stealing Iterators for Data-Parallel Collections | 2 | 0.37 | 2015 |
| Isolates, channels, and event streams for composable distributed programming | 8 | 0.51 | 2015 |
| SnapQueue: lock-free queue with constant time snapshots | 7 | 0.46 | 2015 |
| Conc-Trees for Functional and Parallel Programming | 5 | 0.41 | 2015 |
| Containers and aggregates, mutators and isolates for reactive programming | 7 | 0.51 | 2014 |
| Composition and reuse with compiled domain-specific languages | 26 | 0.94 | 2013 |
| Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads. | 5 | 0.48 | 2013 |
| FlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction. | 12 | 0.74 | 2012 |
| Concurrent tries with efficient non-blocking snapshots | 49 | 1.85 | 2012 |
| Lock-Free Resizeable Concurrent Tries. | 5 | 0.47 | 2011 |
| A generic parallel collection framework | 12 | 0.83 | 2011 |
