dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Luis Rademacher Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNavin Goyal, Luis Rademacher: Lower Bounds for the Average and Smoothed Number of Pareto Optima CoRR abs/1107.3876: (2011)
2010
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Deshpande, Luis Rademacher: Efficient Volume Sampling for Row/Column Subset Selection. FOCS 2010: 329-338
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Deshpande, Luis Rademacher: Efficient volume sampling for row/column subset selection CoRR abs/1004.4057: (2010)
2009
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Rademacher, Navin Goyal: Learning Convex Bodies is Hard. COLT 2009
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNavin Goyal, Luis Rademacher, Santosh Vempala: Expanders via random spanning trees. SODA 2009: 576-585
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNavin Goyal, Luis Rademacher: Learning convex bodies is hard CoRR abs/0904.1227: (2009)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRavi Kannan, Luis Rademacher: Optimization of a convex program with a polynomial perturbation. Oper. Res. Lett. 37(6): 384-386 (2009)
2008
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNavin Goyal, Luis Rademacher, Santosh Vempala: Expanders via Random Spanning Trees CoRR abs/0807.1496: (2008)
2007
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Rademacher: Approximating the centroid is hard. Symposium on Computational Geometry 2007: 302-305
2006
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Rademacher, Santosh Vempala: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. FOCS 2006: 729-738
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan: Computing Equilibrium Prices in Exchange Economies with Tax Distortions. ICALP (1) 2006: 584-595
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang: Matrix approximation and projective clustering via volume sampling. SODA 2006: 1117-1126
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Rademacher, Santosh Vempala: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms CoRR abs/cs/0608054: (2006)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Rademacher, Santosh Vempala: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 13(102): (2006)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang: Matrix Approximation and Projective Clustering via Volume Sampling. Theory of Computing 2(1): 225-247 (2006)
2004
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Rademacher, Santosh Vempala: Testing Geometric Convexity. FSTTCS 2004: 469-480

Coauthor Index

1Bruno Codenotti [6]
2Amit Deshpande [2] [5] [14] [15]
3Navin Goyal [9] [11] [12] [13] [16]
4Ravi Kannan (Ravindran Kannan) [10]
5Kasturi R. Varadarajan [6]
6Santosh Vempala [1] [2] [3] [4] [5] [7] [9] [12]
7Grant Wang [2] [5]

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page