| 2026 | PPoPP | Multiverse: Transactional Memory with Dynamic Multiversioning. | Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi |
| 2025 | ICDE | More Bang for Your Buck(et): Fast and Space-Efficient Hardware-Accelerated Coarse-Granular Indexing on GPUs. | Justus Henneberg, Felix Martin Schuhknecht, Rosina Kharal, Trevor Brown |
| 2025 | PPoPP | Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures. | Ajay Singh, Trevor Brown |
| 2025 | SPAA | Persistent HyTM via Fast Path Fine-Grained Locking. | Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi |
| 2024 | PPoPP | Practical Hardware Transactional vEB Trees. | Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov |
| 2024 | PPoPP | Are Your Epochs Too Epic? Batch Free Can Be Harmful. | Daewoo Kim, Trevor Brown, Ajay Singh |
| 2023 | PPoPP | Unexpected Scaling in Path Copying Trees. | Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin |
| 2023 | SSS | The Fence Complexity of Persistent Sets. | Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi |
| 2022 | OPODIS | Performance Anomalies in Concurrent Data Structure Microbenchmarks. | Rosina Kharal, Trevor Brown |
| 2022 | PPoPP | PathCAS: an efficient middle ground for concurrent search data structures. | Trevor Brown, William Sigouin, Dan Alistarh |
| 2022 | PPoPP | Elimination (a, b)-trees with fast, durable updates. | Anubhav Srivastava, Trevor Brown |
| 2021 | PPoPP | NBR: neutralization based reclamation. | Ajay Singh, Trevor Brown, Ali Jos Mashtizadeh |
| 2020 | PPoPP | Non-blocking interpolation search trees with doubly-logarithmic running time. | Trevor Brown, Aleksandar Prokopec, Dan Alistarh |
| 2020 | SPAA | Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures. | Dan Alistarh, Trevor Brown, Nandini Singhal |
| 2019 | iLRN | Immersive Learning for Scale and Order of Magnitude in Newtonian Mechanics. | Trevor Brown, Jason Lomsdalen, Irene Humer, Christian Eckhardt |
| 2018 | EuroPar | Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. | Eran Gilad, Trevor Brown, Mark Oskin, Yoav Etsion |
| 2018 | PODC | Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. | Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze |
| 2018 | PPoPP | Harnessing epoch-based reclamation for efficient range queries. | Maya Arbel-Raviv, Trevor Brown |
| 2018 | USENIX | Getting to the Root of Concurrent Binary Search Tree Performance. | Maya Arbel-Raviv, Trevor Brown, Adam Morrison |
| 2018 | SPAA | Distributionally Linearizable Data Structures. | Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze |
| 2017 | PODC | A Template for Implementing Fast Lock-free Trees Using HTM. | Trevor Brown |
| 2017 | PPoPP | POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors. | Maya Arbel-Raviv, Trevor Brown |
| 2016 | PODC | Concurrent Data Structures. | Faith Ellen, Trevor Brown |
| 2016 | SPAA | Investigating the Performance of Hardware Transactions on a Multi-Socket Machine. | Trevor Brown, Alex Kogan, Yossi Lev, Victor Luchangco |
| 2014 | PPoPP | A general technique for non-blocking trees. | Trevor Brown, Faith Ellen, Eric Ruppert |
| 2013 | PODC | Pragmatic primitives for non-blocking data structures. | Trevor Brown, Faith Ellen, Eric Ruppert |
| 2012 | OPODIS | Range Queries in Non-blocking | Trevor Brown, Hillel Avni |
| 2011 | OPODIS | Non-blocking k-ary Search Trees. | Trevor Brown, Joanna Helga |