Amit Deshpande

other persons with the same name:

• Amit Deshpande
• Amit Deshpande

	2009
13		Ankit Aggarwal, Amit Deshpande, Ravi Kannan: Adaptive Sampling for k-Means Clustering. APPROX-RANDOM 2009: 15-28
12		Karthekeyan Chandrasekaran, Amit Deshpande, Santosh Vempala: Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. APPROX-RANDOM 2009: 420-433
11		Karthekeyan Chandrasekaran, Amit Deshpande, Santosh Vempala: The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions CoRR abs/0906.2448: (2009)
	2008
10		A. Das Sarma, Amit Deshpande, Ravi Kannan: Finding Dense Subgraphs in G(n,1/2) CoRR abs/0807.5111: (2008)
	2007
9		Amit Deshpande, Kasturi R. Varadarajan: Sampling-based dimension reduction for subspace approximation. STOC 2007: 641-650
	2006
8		Amit Deshpande, Santosh Vempala: Adaptive Sampling and Fast Low-Rank Matrix Approximation. APPROX-RANDOM 2006: 292-303
7		Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang: Matrix approximation and projective clustering via volume sampling. SODA 2006: 1117-1126
6		Amit Deshpande, Santosh Vempala: Adaptive Sampling and Fast Low-Rank Matrix Approximation. Electronic Colloquium on Computational Complexity (ECCC) 13(042): (2006)
5		Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang: Matrix Approximation and Projective Clustering via Volume Sampling. Theory of Computing 2(1): 225-247 (2006)
	2005
4		Amit Deshpande, Daniel A. Spielman: Improved Smoothed Analysis of the Shadow Vertex Simplex Method. FOCS 2005: 349-356
3		Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan: Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005)
	2003
2		S. A. M. Makki, Niki Pissinou, Tirthankar Ghosh, Amit Deshpande: Study of Network Performance in a Simulated Network for Optimized Node Degree and Network Cost. International Conference on Internet Computing 2003: 747-752
	2002
1		Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam: Better Lower Bounds for Locally Decodable Codes. IEEE Conference on Computational Complexity 2002: 184-193

Coauthor Index

1	Ankit Aggarwal	[13]
2	Karthekeyan Chandrasekaran	[11] [12]
3	Tirthankar Ghosh	[2]
4	Rahul Jain	[1] [3]
5	Ravi Kannan (Ravindran Kannan)	[10] [13]
6	Telikepalli Kavitha	[1] [3]
7	Satyanarayana V. Lokam	[1] [3]
8	S. A. M. Makki (Shamila Makki)	[2]
9	Niki Pissinou	[2]
10	Luis Rademacher	[5] [7]
11	Jaikumar Radhakrishnan	[1] [3]
12	A. Das Sarma	[10]
13	Daniel A. Spielman	[4]
14	Kasturi R. Varadarajan	[9]
15	Santosh Vempala	[5] [6] [7] [8] [11] [12]
16	Grant Wang	[5] [7]

Colors in the list of coauthors