default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnpei Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i6]Jinhang Chai, Enpei Zhang, Elynn Chen, Yujun Yan:
Optimistic Transfer under Task Shift via Bellman Alignment. CoRR abs/2601.21924 (2026)- [i5]Jiayu Li, Enpei Zhang, Dawei Zhou, Elynn Chen, Yujun Yan:
Learning to Hand Off: Provably Convergent Workflow Learning under Interface Constraints. CoRR abs/2605.19140 (2026) - 2025
- [c4]Chiyu Ma, Enpei Zhang, Yilun Zhao, Wenjun Liu, Yaning Jia, Peijun Qing, Lin Shi, Arman Cohan, Yujun Yan, Soroush Vosoughi:
Judging with Many Minds: Do More Perspectives Mean Less Prejudice? On Bias Amplification and Resistance in Multi-Agent Based LLM-as-Judge. EMNLP (Findings) 2025: 17356-17392 - [i4]Enpei Zhang, Jingyi Chai, Rui Ye, Yanfeng Wang, Siheng Chen:
Incentivizing Inclusive Contributions in Model Sharing Markets. CoRR abs/2505.02462 (2025) - [i3]Chiyu Ma, Enpei Zhang, Yilun Zhao, Wenjun Liu, Yaning Jia, Peijun Qing, Lin Shi, Arman Cohan, Yujun Yan, Soroush Vosoughi:
Judging with Many Minds: Do More Perspectives Mean Less Prejudice? CoRR abs/2505.19477 (2025) - [i2]Zheng Huang, Enpei Zhang, Yinghao Cai, Weikang Qiu, Carl Yang, Elynn Chen, Xiang Zhang, Rex Ying, Dawei Zhou, Yujun Yan:
Seeing Through the Brain: New Insights from Decoding Visual Stimuli with fMRI. CoRR abs/2510.16196 (2025) - 2023
- [j2]Benwei Wu
, Kai Han, Enpei Zhang:
On the task assignment with group fairness for spatial crowdsourcing. Inf. Process. Manag. 60(2): 103175 (2023) - 2022
- [c3]Enpei Zhang, Kai Han, Benwei Wu:
An Algorithmic View of Streaming Submodular Data Summarization with A Knapsack Constraint. DSIT 2022: 1-6 - [i1]Enpei Zhang, Shuo Tang, Xiaowen Dong, Siheng Chen, Yanfeng Wang:
Unrolled Graph Learning for Multi-Agent Collaboration. CoRR abs/2210.17101 (2022) - 2021
- [j1]Kai Han, Shuang Cui, Tianshuai Zhu, Enpei Zhang, Benwei Wu, Zhizhuo Yin, Tong Xu, Shaojie Tang, He Huang:
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 05:1-05:31 (2021) - [c2]Tianshuai Zhu, Kai Han, Enpei Zhang, Benwei Wu:
A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint. HPCC/DSS/SmartCity/DependSys 2021: 462-469 - [c1]Kai Han, Shuang Cui, Tianshuai Zhu, Enpei Zhang, Benwei Wu, Zhizhuo Yin, Tong Xu, Shaojie Tang, He Huang:
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint. SIGMETRICS (Abstracts) 2021: 65-66
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 2026-06-15 01:23 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
