Luis Rademacher

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
c9		Navin Goyal, Luis Rademacher: Lower Bounds for the Average and Smoothed Number of Pareto Optima. FSTTCS 2012: 58-69
i8		Mikhail Belkin, Luis Rademacher, James Voss: Blind Signal Separation in the Presence of Gaussian Noise. CoRR abs/1211.1716 (2012)
i7		Navin Goyal, Luis Rademacher: Efficient learning of simplices. CoRR abs/1211.2227 (2012)
	2011
i6		Navin Goyal, Luis Rademacher: Lower Bounds for the Average and Smoothed Number of Pareto Optima. CoRR abs/1107.3876 (2011)
	2010
c8		Amit Deshpande, Luis Rademacher: Efficient Volume Sampling for Row/Column Subset Selection. FOCS 2010: 329-338
i5		Amit Deshpande, Luis Rademacher: Efficient volume sampling for row/column subset selection. CoRR abs/1004.4057 (2010)
	2009
j2		Ravi Kannan, Luis Rademacher: Optimization of a convex program with a polynomial perturbation. Oper. Res. Lett. 37(6): 384-386 (2009)
c7		Luis Rademacher, Navin Goyal: Learning Convex Bodies is Hard. COLT 2009
c6		Navin Goyal, Luis Rademacher, Santosh Vempala: Expanders via random spanning trees. SODA 2009: 576-585
i4		Navin Goyal, Luis Rademacher: Learning convex bodies is hard. CoRR abs/0904.1227 (2009)
	2008
i3		Navin Goyal, Luis Rademacher, Santosh Vempala: Expanders via Random Spanning Trees. CoRR abs/0807.1496 (2008)
	2007
c5		Luis Rademacher: Approximating the centroid is hard. Symposium on Computational Geometry 2007: 302-305
	2006
j1		Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang: Matrix Approximation and Projective Clustering via Volume Sampling. Theory of Computing 2(1): 225-247 (2006)
c4		Luis Rademacher, Santosh Vempala: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. FOCS 2006: 729-738
c3		Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan: Computing Equilibrium Prices in Exchange Economies with Tax Distortions. ICALP (1) 2006: 584-595
c2		Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang: Matrix approximation and projective clustering via volume sampling. SODA 2006: 1117-1126
i2		Luis Rademacher, Santosh Vempala: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. CoRR abs/cs/0608054 (2006)
i1		Luis Rademacher, Santosh Vempala: Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 13(102) (2006)
	2004
c1		Luis Rademacher, Santosh Vempala: Testing Geometric Convexity. FSTTCS 2004: 469-480

Coauthor Index

1	Mikhail Belkin	[i8]
2	Bruno Codenotti	[c3]
3	Amit Deshpande	[c8] [i5] [j1] [c2]
4	Navin Goyal	[c9] [i7] [i6] [c7] [c6] [i4] [i3]
5	Ravi Kannan (Ravindran Kannan)	[j2]
6	Kasturi R. Varadarajan	[c3]
7	Santosh Vempala	[c6] [i3] [j1] [c4] [c2] [i2] [i1] [c1]
8	James Voss	[i8]
9	Grant Wang	[j1] [c2]

Colors in the list of coauthors

Last update Mon May 20 09:08:19 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page