default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuanhao Wei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Naama Ben-David
, Guy E. Blelloch, Yuanhao Wei:
Lock-Free Locks Revisited (Abstract). HOPC@SPAA 2024- [c18]Guy E. Blelloch, Yuanhao Wei:
VERLIB: Concurrent Versioned Pointers. PPoPP 2024: 200-214 - [i15]Younghun Roh, Yuanhao Wei, Eric Ruppert, Panagiota Fatourou, Siddhartha Jayanti, Julian Shun:
Aggregating Funnels for Faster Fetch&Add and Queues. CoRR abs/2411.14420 (2024) - 2023
- [c17]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). HOPC@SPAA 2023: 9-10 - [c16]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP 2023: 66-78 - [d3]Guy E. Blelloch, Yuanhao Wei:
VERLIB: Concurrent Versioned Pointers. Zenodo, 2023
- [d2]Guy E. Blelloch, Yuanhao Wei:
VERLIB: Concurrent Versioned Pointers. Zenodo, 2023 - 2022
- [c15]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning manual concurrent memory reclamation into automatic reference counting. PLDI 2022: 61-75 - [c14]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Lock-free locks revisited. PPoPP 2022: 278-293 - [c13]Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank:
FliT: a library for simple and efficient persistent algorithms. PPoPP 2022: 309-321 - [c12]Naama Ben-David, Michal Friedman, Yuanhao Wei:
Brief Announcement: Survey of Persistent Memory Correctness Conditions. DISC 2022: 41:1-41:4 - [d1]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact). Zenodo, 2022 - [i14]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Lock-Free Locks Revisited. CoRR abs/2201.00813 (2022) - [i13]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting. CoRR abs/2204.05985 (2022) - [i12]Naama Ben-David, Michal Friedman, Yuanhao Wei:
Survey of Persistent Memory Correctness Conditions. CoRR abs/2208.11114 (2022) - [i11]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR abs/2212.13557 (2022) - 2021
- [c11]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Concurrent deferred reference counting with constant-time overhead. PLDI 2021: 526-541 - [c10]Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun:
Constant-time snapshots with applications to concurrent data structures. PPoPP 2021: 31-46 - [c9]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. DISC 2021: 12:1-12:20 - [i10]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. CoRR abs/2108.02775 (2021) - [i9]Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank:
FliT: A Library for Simple and Efficient Persistent Algorithms. CoRR abs/2108.04202 (2021) - 2020
- [j1]Tian Ze Chen, Yuanhao Wei:
Step-optimal implementations of large single-writer registers. Theor. Comput. Sci. 826-827: 40-50 (2020) - [c8]Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank:
NVTraverse: in NVRAM data structures, the destination is more important than the journey. PLDI 2020: 377-392 - [c7]Guy E. Blelloch, Yuanhao Wei:
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. DISC 2020: 5:1-5:17 - [c6]Guy E. Blelloch, Yuanhao Wei:
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. DISC 2020: 51:1-51:3 - [i8]Guy E. Blelloch, Yuanhao Wei:
Concurrent Reference Counting and Resource Management in Wait-free Constant Time. CoRR abs/2002.07053 (2020) - [i7]Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank:
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. CoRR abs/2004.02841 (2020) - [i6]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR abs/2007.02372 (2020) - [i5]Guy E. Blelloch, Yuanhao Wei:
Concurrent Fixed-Size Allocation and Free in Constant Time. CoRR abs/2008.04296 (2020)
2010 – 2019
- 2019
- [c5]Ian Mertz, Toniann Pitassi, Yuanhao Wei:
Short Proofs Are Hard to Find. ICALP 2019: 84:1-84:16 - [c4]Naama Ben-David, Guy E. Blelloch, Michal Friedman, Yuanhao Wei:
Making concurrent algorithms detectable: poster. PPoPP 2019: 419-420 - [c3]Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei:
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. SPAA 2019: 241-252 - [c2]Naama Ben-David, Guy E. Blelloch, Michal Friedman, Yuanhao Wei:
Delay-Free Concurrency on Faulty Persistent Memory. SPAA 2019: 253-264 - [i4]Guy E. Blelloch, Yuanhao Wei:
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS. CoRR abs/1911.09671 (2019) - 2018
- [i3]Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei:
Efficient Single Writer Concurrency. CoRR abs/1803.08617 (2018) - [i2]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Making Concurrent Algorithms Detectable. CoRR abs/1806.04780 (2018) - [i1]Yuanhao Wei:
Space Complexity of Implementing Large Shared Registers. CoRR abs/1808.00481 (2018) - 2016
- [c1]Tian Ze Chen, Yuanhao Wei:
Step Optimal Implementations of Large Single-Writer Registers. OPODIS 2016: 32:1-32:16
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 2025-01-22 21:34 CET 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:
