Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTrevor Brown 0001
Person information
- affiliation: University of Waterloo, ON, Canada
- affiliation (former): Institute of Science and Technology, Klosterneuburg, Austria
- affiliation (former): Technion, Haifa, Israel
- affiliation (former): University of Toronto, ON, Canada
Other persons with the same name
- Trevor Brown 0002 — University of Maastricht, The Netherlands
- Trevor Brown 0003
![[0000-0003-0420-058X]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-0420-058X")
— California Polytechnic State University, San Luis Obispo, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b2]Michael L. Scott, Trevor Brown:
Shared-Memory Synchronization, Second Edition. Springer 2024, ISBN 978-3-031-38683-1, pp. 1-217- [j2]Ajay Singh, Trevor Alexander Brown, Ali José Mashtizadeh:
Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization. IEEE Trans. Parallel Distributed Syst. 35(2): 203-220 (2024) - [c30]Daewoo Kim, Trevor Brown, Ajay Singh:
Are Your Epochs Too Epic? Batch Free Can Be Harmful. PPoPP 2024: 30-41 - [c29]Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov:
Practical Hardware Transactional vEB Trees. PPoPP 2024: 215-228 - [i20]Daewoo Kim, Trevor Brown, Ajay Singh:
Are Your Epochs Too Epic? Batch Free Can Be Harmful. CoRR abs/2401.11347 (2024) - 2023
- [c28]Ajay Singh, Trevor Brown, Michael Spear:
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. IPDPS 2023: 112-122 - [c27]Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin:
Unexpected Scaling in Path Copying Trees. PPoPP 2023: 438-440 - [c26]Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi:
The Fence Complexity of Persistent Sets. SSS 2023: 36-51 - [i19]Ajay Singh, Trevor Brown, Michael Spear:
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. CoRR abs/2302.12958 (2023) - [i18]Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi:
The Fence Complexity of Persistent Sets. CoRR abs/2309.05230 (2023) - 2022
- [c25]Rosina Kharal, Trevor Brown:
Performance Anomalies in Concurrent Data Structure Microbenchmarks. OPODIS 2022: 7:1-7:24 - [c24]Trevor Brown, William Sigouin, Dan Alistarh:
PathCAS: an efficient middle ground for concurrent search data structures. PPoPP 2022: 385-399 - [c23]Anubhav Srivastava, Trevor Brown:
Elimination (a, b)-trees with fast, durable updates. PPoPP 2022: 416-430 - [c22]Gaetano C. Coccimiglio, Trevor Alexander Brown, Srivatsan Ravi:
PREP-UC: A Practical Replicated Persistent Universal Construction. SPAA 2022: 217-229 - [c21]Rosina Kharal, Trevor Brown:
Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks. DISC 2022: 45:1-45:3 - [i17]Rosina Kharal, Trevor Brown:
Performance Anomalies in Concurrent Data Structure Microbenchmarks. CoRR abs/2208.08469 (2022) - [i16]Ilya Kokorin, Alexander Fedorov, Trevor Brown, Vitaly Aksenov:
Unexpected Scaling in Path Copying Trees. CoRR abs/2212.00521 (2022) - [i15]Trevor Brown, William Sigouin, Dan Alistarh:
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures. CoRR abs/2212.09851 (2022) - 2021
- [c20]Ajay Singh, Trevor Brown, Ali José Mashtizadeh:
NBR: neutralization based reclamation. PPoPP 2021: 175-190 - [i14]Anubhav Srivastava, Trevor Brown:
Elimination (a, b)-trees with fast, durable updates. CoRR abs/2112.15259 (2021) - 2020
- [c19]Trevor Brown, Aleksandar Prokopec, Dan Alistarh:
Non-blocking interpolation search trees with doubly-logarithmic running time. PPoPP 2020: 276-291 - [c18]Dan Alistarh, Trevor Brown, Nandini Singhal:
Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures. SPAA 2020: 37-49 - [i13]Aleksandar Prokopec, Trevor Brown, Dan Alistarh:
Analysis and Evaluation of Non-Blocking Interpolation Search Trees. CoRR abs/2001.00413 (2020) - [i12]Ajay Singh, Trevor Brown, Ali José Mashtizadeh:
NBR: Neutralization Based Reclamation. CoRR abs/2012.14542 (2020)
2010 – 2019
- 2019
- [i11]Trevor Brown, Srivatsan Ravi:
On the Cost of Concurrency in Hybrid Transactional Memory. CoRR abs/1907.02669 (2019) - 2018
- [c17]Eran Gilad, Trevor Brown, Mark Oskin, Yoav Etsion:
Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. Euro-Par 2018: 465-479 - [c16]Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC 2018: 377-386 - [c15]Maya Arbel-Raviv, Trevor Brown:
Harnessing epoch-based reclamation for efficient range queries. PPoPP 2018: 14-27 - [c14]Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. SPAA 2018: 133-142 - [c13]Maya Arbel-Raviv, Trevor Brown, Adam Morrison:
Getting to the Root of Concurrent Binary Search Tree Performance. USENIX Annual Technical Conference 2018: 295-306 - [i10]Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. CoRR abs/1804.01018 (2018) - [i9]Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. CoRR abs/1808.04155 (2018) - 2017
- [b1]Trevor Alexander Brown:
Techniques for Constructing Efficient Lock-free Data Structures. University of Toronto, Canada, 2017 - [c12]Trevor Brown:
A Template for Implementing Fast Lock-free Trees Using HTM. PODC 2017: 293-302 - [c11]Maya Arbel-Raviv, Trevor Brown:
POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors. PPoPP 2017: 429-430 - [c10]Maya Arbel-Raviv, Trevor Brown:
Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors. DISC 2017: 4:1-4:16 - [c9]Trevor Brown, Srivatsan Ravi:
Cost of Concurrency in Hybrid Transactional Memory. DISC 2017: 9:1-9:16 - [i8]Maya Arbel-Raviv, Trevor Brown:
Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors. CoRR abs/1708.01797 (2017) - [i7]Trevor Brown:
A Template for Implementing Fast Lock-free Trees Using HTM. CoRR abs/1708.04838 (2017) - [i6]Trevor Brown:
Reclaiming memory for lock-free data structures: there has to be a better way. CoRR abs/1712.01044 (2017) - [i5]Trevor Brown:
B-slack trees: Highly Space Efficient B-trees. CoRR abs/1712.05020 (2017) - [i4]Trevor Brown, Hillel Avni:
Range Queries in Non-blocking k-ary Search Trees. CoRR abs/1712.05101 (2017) - [i3]Trevor Brown:
Techniques for Constructing Efficient Lock-free Data Structures. CoRR abs/1712.05406 (2017) - [i2]Trevor Brown, Faith Ellen, Eric Ruppert:
A General Technique for Non-blocking Trees. CoRR abs/1712.06687 (2017) - [i1]Trevor Brown, Faith Ellen, Eric Ruppert:
Pragmatic Primitives for Non-blocking Data Structures. CoRR abs/1712.06688 (2017) - 2016
- [j1]Trevor Brown, Hillel Avni:
PHyTM: Persistent Hybrid Transactional Memory. Proc. VLDB Endow. 10(4): 409-420 (2016) - [c8]Faith Ellen, Trevor Brown:
Concurrent Data Structures. PODC 2016: 151-153 - [c7]Trevor Brown, Alex Kogan, Yossi Lev, Victor Luchangco:
Investigating the Performance of Hardware Transactions on a Multi-Socket Machine. SPAA 2016: 121-132 - 2015
- [c6]Trevor Alexander Brown:
Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way. PODC 2015: 261-270 - 2014
- [c5]Trevor Brown, Faith Ellen, Eric Ruppert:
A general technique for non-blocking trees. PPoPP 2014: 329-342 - [c4]Trevor Brown:
B-slack Trees: Space Efficient B-Trees. SWAT 2014: 122-133 - 2013
- [c3]Trevor Brown, Faith Ellen, Eric Ruppert:
Pragmatic primitives for non-blocking data structures. PODC 2013: 13-22 - 2012
- [c2]Trevor Brown, Hillel Avni:
Range Queries in Non-blocking k-ary Search Trees. OPODIS 2012: 31-45 - 2011
- [c1]Trevor Brown, Joanna Helga:
Non-blocking k-ary Search Trees. OPODIS 2011: 207-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
