 | 2009 |
|---|
| 11 |       | Navin Goyal,
Luis Rademacher,
Santosh Vempala:
Expanders via random spanning trees.
SODA 2009: 576-585 |
| 10 | | Navin Goyal,
Luis Rademacher:
Learning convex bodies is hard
CoRR abs/0904.1227: (2009) |
| 2008 |
|---|
| 9 | | Navin Goyal,
Luis Rademacher,
Santosh Vempala:
Expanders via Random Spanning Trees
CoRR abs/0807.1496: (2008) |
| 2007 |
|---|
| 8 | | Luis Rademacher:
Approximating the centroid is hard.
Symposium on Computational Geometry 2007: 302-305 |
| 2006 |
|---|
| 7 | | Luis Rademacher,
Santosh Vempala:
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms.
FOCS 2006: 729-738 |
| 6 | | Bruno Codenotti,
Luis Rademacher,
Kasturi R. Varadarajan:
Computing Equilibrium Prices in Exchange Economies with Tax Distortions.
ICALP (1) 2006: 584-595 |
| 5 | | Amit Deshpande,
Luis Rademacher,
Santosh Vempala,
Grant Wang:
Matrix approximation and projective clustering via volume sampling.
SODA 2006: 1117-1126 |
| 4 | | Luis Rademacher,
Santosh Vempala:
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
CoRR abs/cs/0608054: (2006) |
| 3 | | Luis Rademacher,
Santosh Vempala:
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms.
Electronic Colloquium on Computational Complexity (ECCC) 13(102): (2006) |
| 2 | | Amit Deshpande,
Luis Rademacher,
Santosh Vempala,
Grant Wang:
Matrix Approximation and Projective Clustering via Volume Sampling.
Theory of Computing 2(1): 225-247 (2006) |
| 2004 |
|---|
| 1 | | Luis Rademacher,
Santosh Vempala:
Testing Geometric Convexity.
FSTTCS 2004: 469-480 |
