| 2013 | ||
|---|---|---|
| c7 | Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder: Minimum Makespan Scheduling with Low Rank Processing Times. SODA 2013: 937-947 | |
| i8 | Hyung-Chan An, Aditya Bhaskara, Ola Svensson: Centrality of Trees for Capacitated k-Center. CoRR abs/1304.2983 (2013) | |
| i7 | Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan: Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. CoRR abs/1304.8087 (2013) | |
| 2012 | ||
| c6 | Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan: Optimal Hitting Sets for Combinatorial Shapes. APPROX-RANDOM 2012: 423-434 | |
| c5 | Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan: On Quadratic Programming with a Ratio Objective. ICALP (1) 2012: 109-120 | |
| c4 | Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou: Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. SODA 2012: 388-405 | |
| c3 | Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar: Unconditional differentially private mechanisms for linear queries. STOC 2012: 1269-1284 | |
| i6 | Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan: Optimal Hitting Sets for Combinatorial Shapes. CoRR abs/1211.3439 (2012) | |
| i5 | Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan: Optimal Hitting Sets for Combinatorial Shapes. Electronic Colloquium on Computational Complexity (ECCC) 19: 158 (2012) | |
| 2011 | ||
| c2 | ||
| i4 | Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan: On Quadratic Programming with a Ratio Objective. CoRR abs/1101.1710 (2011) | |
| i3 | Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, Yuan Zhou: Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. CoRR abs/1110.1360 (2011) | |
| 2010 | ||
| c1 | Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan: Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. STOC 2010: 201-210 | |
| i2 | ||
| i1 | Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan: Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph. CoRR abs/1001.2891 (2010) | |
Colors in the list of coauthors
Last update Sat May 25 20:56:14 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page