default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Yu Cheng Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Benyamin Bashari, David Yu Cheng Chan, Philipp Woelfel:
A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory. DISC 2024: 7:1-7:22- 2023
- [c9]David Yu Cheng Chan
, George Giakkoupis, Philipp Woelfel:
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. PODC 2023: 79-89 - 2021
- [c8]David Yu Cheng Chan, Philipp Woelfel:
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. PODC 2021: 533-543 - [i3]David Yu Cheng Chan, Shucheng Chi, Vassos Hadzilacos, Sam Toueg:
Differentiated nonblocking: a new progress condition and a matching queue algorithm. CoRR abs/2103.11926 (2021) - [i2]David Yu Cheng Chan, Philipp Woelfel:
Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion. CoRR abs/2106.03185 (2021) - [i1]David Yu Cheng Chan, Vassos Hadzilacos, Xing Hu, Sam Toueg:
An Impossibility Result on Strong Linearizability in Message-Passing Systems. CoRR abs/2108.01651 (2021) - 2020
- [j3]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life beyond set agreement. Distributed Comput. 33(3-4): 255-277 (2020) - [j2]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Bounded disagreement. Theor. Comput. Sci. 826-827: 12-24 (2020) - [c7]David Yu Cheng Chan, Philipp Woelfel:
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. PODC 2020: 181-190
2010 – 2019
- 2019
- [b1]David Yu Cheng Chan:
Classifications of Asynchronous Shared Memory Objects. University of Toronto, Canada, 2019 - 2018
- [c6]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Classification of Deterministic Objects via Set Agreement Power. PODC 2018: 71-80 - 2017
- [c5]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life Beyond Set Agreement. PODC 2017: 345-354 - [c4]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. DISC 2017: 12:1-12:14 - 2016
- [c3]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Bounded Disagreement. OPODIS 2016: 5:1-5:16 - [c2]Naama Ben-David, David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
k-Abortable Objects: Progress Under High Contention. DISC 2016: 298-312 - 2014
- [j1]David Yu Cheng Chan, David G. Kirkpatrick:
Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience. Theor. Comput. Sci. 553: 74-90 (2014) - 2012
- [c1]David Yu Cheng Chan, David G. Kirkpatrick:
Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. ALGOSENSORS 2012: 42-53
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-10-25 21:17 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:
