default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingwei Yang 0002
Person information
- unicode name: 杨明炜
- affiliation: Stanford University,
- affiliation: Peking University, Center on Frontiers of Computing Studies (CFCS), Beijing, China
Other persons with the same name
- Mingwei Yang (aka: MingWei Yang, Ming-Wei Yang) — disambiguation page
- Mingwei Yang 0001
![[0000-0003-0086-870X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-0086-870X")
— University of Arizona, Department of Electrical and Computer Engineering, Tucson, AZ, USA - Mingwei Yang 0003 — Shenyang University of Chemical Technology, Equipment Reliability Institute, Shenyang, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j1]Zizheng Guo, Mingwei Yang, Tsung-Wei Huang, Yibo Lin:
A Provably Good and Practically Efficient Algorithm for Common Path Pessimism Removal in Large Designs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(10): 3466-3478 (2022)
Conference and Workshop Papers
- 2024
- [c3]Zhaohua Chen, Mingwei Yang, Chang Wang, Jicheng Li, Zheng Cai, Yukun Ren, Zhihua Zhu, Xiaotie Deng:
Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties. WWW 2024: 14-24 - 2023
- [c2]Mingwei Yang:
Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments. AAMAS 2023: 2655-2657 - 2022
- [c1]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang:
Streaming Facility Location in High Dimension via Geometric Hashing. FOCS 2022: 450-461
Informal and Other Publications
- 2024
- [i7]Amin Saberi, Mingwei Yang, Sophie H. Yu:
Stochastic Online Metric Matching: Adversarial is no Harder than Stochastic. CoRR abs/2407.14785 (2024) - 2023
- [i6]Biaoshuai Tao, Mingwei Yang:
Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail. CoRR abs/2306.15920 (2023) - [i5]Xiaohui Bei, Biaoshuai Tao, Jiajun Wu, Mingwei Yang:
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation. CoRR abs/2308.08903 (2023) - 2022
- [i4]Zhaohua Chen, Xiaotie Deng, Jicheng Li, Chang Wang, Mingwei Yang:
Budget-Constrained Auctions with Unassured Priors. CoRR abs/2203.16816 (2022) - [i3]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang:
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR abs/2204.02095 (2022) - [i2]Mingwei Yang:
Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments. CoRR abs/2209.03286 (2022) - [i1]Rui Ai, Zhaohua Chen, Xiaotie Deng, Yuqi Pan, Chang Wang, Mingwei Yang:
On the Re-Solving Heuristic for (Binary) Contextual Bandits with Knapsacks. CoRR abs/2211.13952 (2022)
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-08-27 22:54 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:
