default search action
Simai He
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Simai He, Haodong Hu, Bo Jiang, Zhening Li:
Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual. SIAM J. Optim. 33(3): 2062-2088 (2023) - [j21]Shengyu Cao, Simai He, Zhening Li, Zhen Wang:
Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors. SIAM J. Matrix Anal. Appl. 44(2): 919-944 (2023) - [c7]Hao Qiu, Zhen Wang, Simai He:
Separation in Distributionally Robust Monopolist Problem. WINE 2023: 545-562 - [i2]Shengyu Cao, Simai He, Ruoqing Jiang, Jin Xu, Hongsong Yuan:
Best Arm Identification in Batched Multi-armed Bandit Problems. CoRR abs/2312.13875 (2023) - 2022
- [j20]Hengle Qin, Jun Xiao, Dongdong Ge, Linwei Xin, Jianjun Gao, Simai He, Haodong Hu, John Gunnar Carlsson:
JD.com: Operations Research Algorithms Drive Intelligent Warehouse Robots to Work. INFORMS J. Appl. Anal. 52(1): 42-55 (2022) - [i1]Shengyu Cao, Simai He, Zhening Li, Zhen Wang:
Extreme ratio between spectral and Frobenius norms of nonnegative tensors. CoRR abs/2206.07879 (2022) - 2021
- [j19]Xi Chen, Simai He, Bo Jiang, Christopher Thomas Ryan, Teng Zhang:
The Discrete Moment Problem with Nonconvex Shape Constraints. Oper. Res. 69(1): 279-296 (2021)
2010 – 2019
- 2018
- [j18]Yichuan Ding, Dongdong Ge, Simai He, Christopher Thomas Ryan:
A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs. Oper. Res. 66(4): 918-935 (2018) - 2017
- [j17]Simai He, Jay Sethuraman, Xuan Wang, Jiawei Zhang:
A NonCooperative Approach to Cost Allocation in Joint Replenishment. Oper. Res. 65(6): 1562-1573 (2017) - [j16]Dongdong Ge, Rongchuan He, Simai He:
An improved algorithm for the L2 - Lp minimization problem. Math. Program. 166(1-2): 131-158 (2017) - [j15]Bilian Chen, Simai He, Zhening Li, Shuzhong Zhang:
On New Classes of Nonnegative Symmetric Tensors. SIAM J. Optim. 27(1): 292-318 (2017) - 2015
- [j14]Simai He, Zhening Li, Shuzhong Zhang:
Inhomogeneous polynomial optimization over a convex set: An approximation approach. Math. Comput. 84(292): 715-741 (2015) - [c6]Yichuan Ding, Dongdong Ge, Simai He, Christopher Thomas Ryan:
A Non-asymptotic Approach to Analyzing Kidney Exchange Graphs. EC 2015: 257-258 - 2014
- [j13]Bo Jiang, Simai He, Zhening Li, Shuzhong Zhang:
Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables. Math. Oper. Res. 39(3): 775-788 (2014) - [j12]Simai He, Bo Jiang, Zhening Li, Shuzhong Zhang:
Probability Bounds for Polynomial Functions in Random Variables. Math. Oper. Res. 39(3): 889-907 (2014) - 2013
- [j11]Xin Chen, Peng Hu, Simai He:
Technical Note - Preservation of Supermodularity in Parametric Optimization Problems with Nonlattice Structures. Oper. Res. 61(5): 1166-1173 (2013) - [j10]Simai He, Xiaoguo Wang, Shuzhong Zhang:
On a generalized Cournot oligopolistic competition game. J. Glob. Optim. 56(4): 1335-1345 (2013) - 2012
- [j9]Simai He, Jiawei Zhang, Shuzhong Zhang:
Polymatroid Optimization, Submodularity, and Joint Replenishment Games. Oper. Res. 60(1): 128-137 (2012) - [j8]Bilian Chen, Simai He, Zhening Li, Shuzhong Zhang:
Maximum Block Improvement and Polynomial Optimization. SIAM J. Optim. 22(1): 87-107 (2012) - 2011
- [j7]Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz:
The Cost of Cache-Oblivious Searching. Algorithmica 61(2): 463-505 (2011) - [j6]Li Chen, Simai He, Shuzhong Zhang:
Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection. Oper. Res. 59(4): 847-865 (2011) - [j5]Dongdong Ge, Simai He, Yinyu Ye, Jiawei Zhang:
Geometric rounding: a dependent randomized rounding scheme. J. Comb. Optim. 22(4): 699-725 (2011) - 2010
- [j4]Simai He, Jiawei Zhang, Shuzhong Zhang:
Bounding Probability of Small Deviation: A Fourth Moment Approach. Math. Oper. Res. 35(1): 208-232 (2010) - [j3]Simai He, Zhening Li, Shuzhong Zhang:
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints. Math. Program. 125(2): 353-383 (2010)
2000 – 2009
- 2008
- [j2]Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan:
Improved bounds on sorting by length-weighted reversals. J. Comput. Syst. Sci. 74(5): 744-774 (2008) - [j1]Simai He, Zhi-Quan Luo, Jiawang Nie, Shuzhong Zhang:
Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization. SIAM J. Optim. 19(2): 503-523 (2008) - 2005
- [c5]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. SPAA 2005: 325-332 - 2004
- [c4]Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter:
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. CPM 2004: 32-46 - [c3]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial Analyses of Window Backoff Strategies. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004 - [c2]Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan:
Improved bounds on sorting with length-weighted reversals. SODA 2004: 919-928 - 2003
- [c1]Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz:
The Cost of Cache-Oblivious Searching. FOCS 2003: 271-282
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-10-07 22: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