Tight bounds on expected order statistics
Probability in the Engineering and Informational Sciences
Saved in:
Main Authors: | Bertsimas, D., Natarajan, K., Teo, C.-P. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44205 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Probabilistic combinatorial optimization: Moments, semidefinite programming, and asymptotic bounds
by: Bertsimas, D., et al.
Published: (2013) -
Tight bounds for asynchronous renaming
by: Alistarh, D., et al.
Published: (2016) -
Simple tight exponential bounds on the first-order Marcum Q-function via the geometric approach
by: Kam, P.Y., et al.
Published: (2014) -
Tight bounds for the subspace sketch problem with applications
by: Li, Yi, et al.
Published: (2022) -
A new geometric view of the first-order marcum Q-function and some simple tight erfc-bounds
by: Kam, P.Y., et al.
Published: (2014)