Trevor Brown - RankMe

59 papers A* 5A 4B 19C 1Journal 26Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Multiverse: Transactional Memory with Dynamic Multiversioning. PPoPP Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2026	J	`jnl`	Multiverse: Transactional Memory with Dynamic Multiversioning. CoRR Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2025	A*	`conf`	More Bang for Your Buck(et): Fast and Space-Efficient Hardware-Accelerated Coarse-Granular Indexing on GPUs. ICDE Justus Henneberg, Felix Martin Schuhknecht, Rosina Kharal, Trevor Brown
2025	B	`conf`	Persistent HyTM via Fast Path Fine-Grained Locking. SPAA Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2025	J	`jnl`	Persistent HyTM via Fast Path Fine-Grained Locking. CoRR Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2025	J	`jnl`	Privacy-Preserving Vertical K-Means Clustering. CoRR Federico Mazzone, Trevor Brown, Florian Kerschbaum, Kevin H. Wilson, Maarten H. Everts, Florian Hahn, Andreas Peter
2025	B	`conf`	Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures. PPoPP Ajay Singh, Trevor Brown
2025	J	`jnl`	Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures. CoRR Ajay Singh, Trevor Brown
2024	B	`conf`	Are Your Epochs Too Epic? Batch Free Can Be Harmful. PPoPP Daewoo Kim, Trevor Brown, Ajay Singh
2024	J	`jnl`	Are Your Epochs Too Epic? Batch Free Can Be Harmful. CoRR Daewoo Kim, Trevor Brown, Ajay Singh
2024	J	`jnl`	More Bang For Your Buck(et): Fast and Space-efficient Hardware-accelerated Coarse-granular Indexing on GPUs. CoRR Justus Henneberg, Felix Schuhknecht, Rosina Kharal, Trevor Brown
2024	B	`conf`	Practical Hardware Transactional vEB Trees. PPoPP Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov
2024	—	`book`	Shared-Memory Synchronization, Second Edition Michael L. Scott, Trevor Brown
2023	A	`conf`	Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. IPDPS Ajay Singh, Trevor Brown, Michael Spear
2023	J	`jnl`	Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. CoRR Ajay Singh, Trevor Brown, Michael Spear
2023	C	`conf`	The Fence Complexity of Persistent Sets. SSS Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2023	J	`jnl`	The Fence Complexity of Persistent Sets. CoRR Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2023	B	`conf`	Unexpected Scaling in Path Copying Trees. PPoPP Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin
2022	A	`conf`	Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks. DISC Rosina Kharal, Trevor Brown
2022	B	`conf`	Elimination (a, b)-trees with fast, durable updates. PPoPP Anubhav Srivastava, Trevor Brown
2022	J	`jnl`	PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures. CoRR Trevor Brown, William Sigouin, Dan Alistarh
2022	B	`conf`	PathCAS: an efficient middle ground for concurrent search data structures. PPoPP Trevor Brown, William Sigouin, Dan Alistarh
2022	B	`conf`	Performance Anomalies in Concurrent Data Structure Microbenchmarks. OPODIS Rosina Kharal, Trevor Brown
2022	J	`jnl`	Performance Anomalies in Concurrent Data Structure Microbenchmarks. CoRR Rosina Kharal, Trevor Brown
2022	J	`jnl`	Unexpected Scaling in Path Copying Trees. CoRR Ilya Kokorin, Alexander Fedorov, Trevor Brown, Vitaly Aksenov
2021	J	`jnl`	Elimination (a, b)-trees with fast, durable updates. CoRR Anubhav Srivastava, Trevor Brown
2021	B	`conf`	NBR: neutralization based reclamation. PPoPP Ajay Singh, Trevor Brown, Ali José Mashtizadeh
2020	J	`jnl`	Analysis and Evaluation of Non-Blocking Interpolation Search Trees. CoRR Aleksandar Prokopec, Trevor Brown, Dan Alistarh
2020	B	`conf`	Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures. SPAA Dan Alistarh, Trevor Brown, Nandini Singhal
2020	J	`jnl`	NBR: Neutralization Based Reclamation. CoRR Ajay Singh, Trevor Brown, Ali José Mashtizadeh
2020	B	`conf`	Non-blocking interpolation search trees with doubly-logarithmic running time. PPoPP Trevor Brown, Aleksandar Prokopec, Dan Alistarh
2019	J	`jnl`	On the Cost of Concurrency in Hybrid Transactional Memory. CoRR Trevor Brown, Srivatsan Ravi
2018	B	`conf`	Distributionally Linearizable Data Structures. SPAA Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze
2018	J	`jnl`	Distributionally Linearizable Data Structures. CoRR Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze
2018	—	`conf`	Getting to the Root of Concurrent Binary Search Tree Performance. USENIX ATC Maya Arbel-Raviv, Trevor Brown, Adam Morrison
2018	B	`conf`	Harnessing epoch-based reclamation for efficient range queries. PPoPP Maya Arbel-Raviv, Trevor Brown
2018	A*	`conf`	Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
2018	J	`jnl`	Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. CoRR Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
2018	—	`conf`	Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. Euro-Par Eran Gilad, Trevor Brown, Mark Oskin, Yoav Etsion
2017	J	`jnl`	A General Technique for Non-blocking Trees. CoRR Trevor Brown, Faith Ellen, Eric Ruppert
2017	A*	`conf`	A Template for Implementing Fast Lock-free Trees Using HTM. PODC Trevor Brown
2017	J	`jnl`	A Template for Implementing Fast Lock-free Trees Using HTM. CoRR Trevor Brown
2017	J	`jnl`	B-slack trees: Highly Space Efficient B-trees. CoRR Trevor Brown
2017	A	`conf`	Cost of Concurrency in Hybrid Transactional Memory. DISC Trevor Brown, Srivatsan Ravi
2017	B	`conf`	POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors. PPoPP Maya Arbel-Raviv, Trevor Brown
2017	J	`jnl`	Pragmatic Primitives for Non-blocking Data Structures. CoRR Trevor Brown, Faith Ellen, Eric Ruppert
2017	J	`jnl`	Range Queries in Non-blocking k-ary Search Trees. CoRR Trevor Brown, Hillel Avni
2017	J	`jnl`	Reclaiming memory for lock-free data structures: there has to be a better way. CoRR Trevor Brown
2017	A	`conf`	Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors. DISC Maya Arbel-Raviv, Trevor Brown
2017	J	`jnl`	Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors. CoRR Maya Arbel-Raviv, Trevor Brown
2017	J	`jnl`	Techniques for Constructing Efficient Lock-free Data Structures. CoRR Trevor Brown
2016	A*	`conf`	Concurrent Data Structures. PODC Faith Ellen, Trevor Brown
2016	B	`conf`	Investigating the Performance of Hardware Transactions on a Multi-Socket Machine. SPAA Trevor Brown, Alex Kogan, Yossi Lev, Victor Luchangco
2016	J	`jnl`	PHyTM: Persistent Hybrid Transactional Memory. Proc. VLDB Endow. Trevor Brown, Hillel Avni
2014	B	`conf`	A general technique for non-blocking trees. PPoPP Trevor Brown, Faith Ellen, Eric Ruppert
2014	—	`conf`	B-slack Trees: Space Efficient B-Trees. SWAT Trevor Brown
2013	A*	`conf`	Pragmatic primitives for non-blocking data structures. PODC Trevor Brown, Faith Ellen, Eric Ruppert
2012	B	`conf`	Range Queries in Non-blocking OPODIS Trevor Brown, Hillel Avni
2011	B	`conf`	Non-blocking k-ary Search Trees. OPODIS Trevor Brown, Joanna Helga