Details
Title
Ray, Saurabh
Sciper ID
198532
Affiliated labs
DCG
Publications
Centerpoints and Tverberg's technique
Faster algorithms for computing Hong's bound on absolute positiveness
Hitting Simplices with Points in $R^3$
Improving the first selection lemma in $R^3$
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
Faster algorithms for computing Hong's bound on absolute positiveness
Hitting Simplices with Points in $R^3$
Improving the first selection lemma in $R^3$
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
Link to search
All resources
Record appears in
Authorities > People