default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSheng Yang 0005
Person information
- affiliation: Northwestern University, Evanston, IL, USA
- affiliation (former): University of Maryland, College Park, MD, USA
Other persons with the same name
- Sheng Yang — disambiguation page
- Sheng Yang 0001
![[0000-0002-0643-0445]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0643-0445")
— Université Paris-Saclay, Gif-sur-Yvette, France (and 2 more) - Sheng Yang 0002 — University of Texas at Dallas, Richardson, TX, USA
- Sheng Yang 0003 — University of Southampton, Department of Electronics and Computer Science, UK (and 1 more)
- Sheng Yang 0004 — Harvard University, Cambridge, MA, USA
- Sheng Yang 0006 — Nanyang Technological University, School of Computer Science and Engineering, Singapore
- Sheng Yang 0007 — Alibaba DAMO Academy, Hangzhou, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Sheng Yang:
On Scheduling and Communication Issues in Data Centers. University of Maryland, College Park, MD, USA, 2020
Journal Articles
- 2020
- [j2]Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows. Algorithmica 82(12): 3604-3629 (2020) - 2019
- [j1]Samir Khuller, Sheng Yang:
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm. Algorithmica 81(6): 2592-2605 (2019)
Conference and Workshop Papers
- 2022
- [c6]Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Correlated Stochastic Knapsack with a Submodular Objective. ESA 2022: 91:1-91:14 - 2021
- [c5]Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Scheduling ML training on unreliable spot instances. UCC Companion 2021: 29:1-29:8 - 2019
- [c4]Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You:
Near Optimal Coflow Scheduling in Networks. SPAA 2019: 123-134 - 2018
- [c3]Samir Khuller, Sheng Yang:
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? ITA 2018: 1-9 - 2017
- [c2]Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows - (Extended Abstract). IPCO 2017: 13-24 - 2016
- [c1]Samir Khuller, Sheng Yang:
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? APPROX-RANDOM 2016: 11:1-11:12
Informal and Other Publications
- 2022
- [i2]Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Correlated Stochastic Knapsack with a Submodular Objective. CoRR abs/2207.01551 (2022) - 2019
- [i1]Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You:
Near Optimal Coflow Scheduling in Networks. CoRR abs/1906.06851 (2019)
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-09-21 02:35 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:
