Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Luis
Last name:	Rademacher
DBLP:	31/5438
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 12 of 12  

Select a publication
Show	Title	Venue	Rating	Date
	Navin Goyal, Luis Rademacher, Santosh Vempala. Expanders via random spanning trees.	Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 2009	(0)	2009
	Navin Goyal, Luis Rademacher. Learning convex bodies is hard	CoRR 2009, Volume 0	(0)	2009
	Ravi Kannan, Luis Rademacher. Optimization of a convex program with a polynomial perturbation.	Oper. Res. Lett. 2009, Volume 37	(0)	2009
	Navin Goyal, Luis Rademacher, Santosh Vempala. Expanders via Random Spanning Trees	CoRR 2008, Volume 0	(0)	2008
	Luis Rademacher. Approximating the centroid is hard.	Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007 2007	(0)	2007
	Luis Rademacher, Santosh Vempala. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms.	47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006	(0)	2006
	Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan. Computing Equilibrium Prices in Exchange Economies with Tax Distortions.	Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I 2006	(0)	2006
	Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang. Matrix approximation and projective clustering via volume sampling.	Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006	(0)	2006
	Luis Rademacher, Santosh Vempala. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms	CoRR 2006, Volume 0	(0)	2006
	Luis Rademacher, Santosh Vempala. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms.	Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null	(0)	2006
	Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang. Matrix Approximation and Projective Clustering via Volume Sampling.	Theory of Computing 2006, Volume 2	(0)	2006
	Luis Rademacher, Santosh Vempala. Testing Geometric Convexity.	FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings 2004	(0)	2004

Your query returned 12 matches in the database.