default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuan He 0003
Person information
- affiliation: University of California at Los Angeles, CA, USA
Other persons with the same name
- Yuan He — disambiguation page
- Yuan He 0001 — Fujitsu R&D Center, Beijing, China
- Yuan He 0002
![[0000-0002-4087-8905]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4087-8905")
— RIKEN Center for Computational Science, Japan (and 4 more) - Yuan He 0004 — Tsinghua University, School of Software / TNLIST, Beijing, China (and 1 more)
- Yuan He 0005 — Kunming University of Science and Technology, Department of Mathematics, Yunnan, China
- Yuan He 0006 — Tongji University, Department of Computer Science and Engineering, Shanghai, China
- Yuan He 0007 — Delft University of Technology, Netherlands
- Yuan He 0008 — University of Oxford, UK
- Yuan He 0009 — Beijing University of Posts and Telecommunications, Beijing, China
- Yuan He 0010 — Southeast University, Nanjing, China
- Yuan He 0011 — Alibaba Group, China
- Yuan He 0012 — Sichuan University, Business School, Chengdu, China
- Yuan He 0013 — Beijing Normal University, Beijing, China
- Yuan He 0014 — Wuhan University, School of Remote Sensing and Information Engineering, China
- Yuan He 0015 — Cornell University, School of Electrical and Computer Engineering, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[b1]Yuan He:
Topological Characterization of Distributed Computability. University of California, Los Angeles, USA, 2021- 2020
- [i3]Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. CoRR abs/2004.08348 (2020)
2010 – 2019
- 2018
- [j1]Yuan He, Krishnan Gopalakrishnan, Eli Gafni:
Group mutual exclusion in linear time and space. Theor. Comput. Sci. 709: 31-47 (2018) - [c4]Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. PODC 2018: 387-396 - 2017
- [c3]Petr Kuznetsov, Thibault Rieutord, Yuan He:
Brief Announcement: Compact Topology of Shared-Memory Adversaries. DISC 2017: 56:1-56:4 - 2016
- [c2]Yuan He, Krishnan Gopalakrishnan, Eli Gafni:
Group mutual exclusion in linear time and space. ICDCN 2016: 22:1-22:10 - [c1]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. OPODIS 2016: 6:1-6:17 - [i2]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. CoRR abs/1610.01423 (2016) - 2014
- [i1]Yuan He, Krishnan Gopalakrishnan:
Group Mutual Exclusion in Linear Time and Space. CoRR abs/1403.5605 (2014)
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-11-22 20:38 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:
