He Simai
He Simai
Bestätigte E-Mail-Adresse bei
Zitiert von
Zitiert von
Maximum block improvement and polynomial optimization
B Chen, S He, Z Li, S Zhang
SIAM Journal on Optimization 22 (1), 87-107, 2012
Adversarial contention resolution for simple channels
MA Bender, M Farach-Colton, S He, BC Kuszmaul, CE Leiserson
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
Tight bounds for some risk measures, with applications to robust portfolio selection
L Chen, S He, S Zhang
Operations Research 59 (4), 847-865, 2011
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
S He, Z Li, S Zhang
Mathematical Programming 125 (2), 353-383, 2010
Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization
S He, ZQ Luo, J Nie, S Zhang
SIAM Journal on Optimization 19 (2), 503-523, 2008
The cost of cache-oblivious searching
MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ...
Algorithmica 61 (2), 463-505, 2011
Approximation methods for polynomial optimization: Models, Algorithms, and Applications
Z Li, S He, S Zhang
Springer Science & Business Media, 2012
Bounding probability of small deviation: A fourth moment approach
S He, J Zhang, S Zhang
Mathematics of Operations Research 35 (1), 208-232, 2010
Preservation of supermodularity in parametric optimization problems with nonlattice structures
X Chen, P Hu, S He
Operations Research 61 (5), 1166-1173, 2013
When all risk-adjusted performance measures are the same: In praise of the Sharpe ratio
L Chen, S He, S Zhang
Quantitative Finance 11 (10), 1439-1447, 2011
Improved bounds on sorting by length-weighted reversals
MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan
Journal of Computer and System Sciences 74 (5), 744-774, 2008
Sorting by length-weighted reversals: Dealing with signs and circularity
F Swidan, MA Bender, D Ge, S He, H Hu, RY Pinter
Annual Symposium on Combinatorial Pattern Matching, 32-46, 2004
Improved bounds on sorting with length-weighted reversals.
MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan
SODA 4, 919-928, 2004
Approximation algorithms for discrete polynomial optimization
S He, Z Li, S Zhang
Journal of the Operations Research Society of China 1 (1), 3-36, 2013
Probability bounds for polynomial functions in random variables
S He, B Jiang, Z Li, S Zhang
Mathematics of Operations Research 39 (3), 889-907, 2014
Polymatroid optimization, submodularity, and joint replenishment games
S He, J Zhang, S Zhang
Operations research 60 (1), 128-137, 2012
Randomized portfolio selection with constraints
J Xie, S He, S Zhang
Pacific Journal of Optimization 4 (1), 89-112, 2008
A nonasymptotic approach to analyzing kidney exchange graphs
Y Ding, D Ge, S He, CT Ryan
Operations Research 66 (4), 918-935, 2018
General constrained polynomial optimization: an approximation approach
S He, Z Li, S Zhang
The discrete moment problem with nonconvex shape constraints
X Chen, S He, B Jiang, CT Ryan, T Zhang
Operations Research 69 (1), 279-296, 2021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20