default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChun Ye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i8]Yueming Yin, Haifeng Hu, Zhen Yang, Jitao Yang, Chun Ye, Jiansheng Wu, Wilson Wen Bin Goh:
An open unified deep graph learning framework for discovering drug leads. CoRR abs/2301.03424 (2023)- 2020
- [j10]Antoine Désir
, Vineet Goyal, Danny Segev, Chun Ye:
Constrained Assortment Optimization Under the Markov Chain-based Choice Model. Manag. Sci. 66(2): 698-721 (2020)
2010 – 2019
- 2019
- [i7]Bharathan Balaji, Jordan Bell-Masterson, Enes Bilgin, Andreas C. Damianou, Pablo Moreno Garcia, Arpit Jain, Runfei Luo, Alvaro Maggiar, Balakrishnan Narayanaswamy, Chun Ye:
ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems. CoRR abs/1911.10641 (2019) - 2017
- [j9]Itai Feigenbaum, Jay Sethuraman, Chun Ye:
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs. Math. Oper. Res. 42(2): 434-447 (2017) - 2015
- [j8]Jay Sethuraman, Chun Ye:
A note on the assignment problem with uniform preferences. Oper. Res. Lett. 43(3): 283-287 (2015) - [c4]Haris Aziz, Simon Mackenzie, Lirong Xia, Chun Ye:
Ex post Efficiency of Random Assignments. AAMAS 2015: 1639-1640 - 2014
- [c3]Haris Aziz, Chun Ye:
Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations. WINE 2014: 1-14 - [i6]Haris Aziz, Simon Mackenzie, Lirong Xia, Chun Ye:
Structure and complexity of ex post efficient random assignments. CoRR abs/1409.6076 (2014) - [i5]Jay Sethuraman, Chun Ye:
A Note on the Assignment Problem with Uniform Preferences. CoRR abs/1412.6078 (2014) - 2013
- [i4]Itai Feigenbaum, Jay Sethuraman, Chun Ye:
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing $L_p$ Norm of Costs. CoRR abs/1305.2446 (2013) - [i3]Haris Aziz, Chun Ye:
New Cake Cutting Algorithms: a Random Assignment Approach to Cake Cutting. CoRR abs/1307.2908 (2013) - [i2]Daniel Bienstock, Jay Sethuraman, Chun Ye:
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming. CoRR abs/1311.4563 (2013) - 2011
- [j7]Nicholas A. Furlotte, Hyun Min Kang, Chun Ye, Eleazar Eskin:
Mixed-model coexpression: calculating gene coexpression while accounting for expression heterogeneity. Bioinform. 27(13): 288-294 (2011) - [j6]Xingwei Liu, Xuming Fang, Zhenhua Qin, Chun Ye, Miao Xie:
A Short-Term Forecasting Algorithm for Network Traffic Based on Chaos Theory and SVM. J. Netw. Syst. Manag. 19(4): 427-447 (2011) - 2010
- [j5]Eun Yong Kang, Chun Ye, Ilya Shpitser, Eleazar Eskin:
Detecting the Presence and Absence of Causal Relationships between Expression of Yeast Genes with Very Few Samples. J. Comput. Biol. 17(3): 533-546 (2010) - [i1]Timothy Sun, Chun Ye:
Rigidity of Graph Joins and Hendrickson's Conjecture. CoRR abs/1011.3208 (2010)
2000 – 2009
- 2009
- [j4]Chun Ye, Simon J. Galbraith, James C. Liao, Eleazar Eskin:
Using Network Component Analysis to Dissect Regulatory Networks Mediated by Transcription Factors in Yeast. PLoS Comput. Biol. 5(3) (2009) - [c2]Eun Yong Kang, Ilya Shpitser, Chun Ye, Eleazar Eskin:
Detecting the Presence and Absence of Causal Relationships between Expression of Yeast Genes with Very Few Samples. RECOMB 2009: 466-481 - 2007
- [j3]Chun Ye, Eleazar Eskin:
Discovering tightly regulated and differentially expressed gene sets in whole genome expression data. Bioinform. 23(2): 84-90 (2007) - 2005
- [c1]Chun Ye, Ke-Fan Xie, Ya-Lin Chen, Xian-Jia Wang:
MAS organization: design, enforcement and instantiation. PDCAT 2005: 529-532
1990 – 1999
- 1992
- [j2]Chun Ye, T. Anthony Marsland:
Experiments in Forward Pruning with Limited Extensions. J. Int. Comput. Games Assoc. 15(2): 55-66 (1992) - [j1]Chun Ye:
Experiments in Selective Search Extensions. J. Int. Comput. Games Assoc. 15(2): 82 (1992)
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-04-25 05: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:
