Aravindan Vijayaraghavan
Title
Cited by
Cited by
Year
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
A Bhaskara, M Charikar, E Chlamtac, U Feige, A Vijayaraghavan
Proceedings of the forty-second ACM symposium on Theory of computing, 201-210, 2010
3012010
Smoothed analysis of tensor decompositions
A Bhaskara, M Charikar, A Moitra, A Vijayaraghavan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1142014
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
A Bhaskara, M Charikar, V Guruswami, A Vijayaraghavan, Y Zhou
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1102012
Learning mixtures of ranking models
P Awasthi, A Blum, O Sheffet, A Vijayaraghavan
Advances in Neural Information Processing Systems 27, 2609-2617, 2014
612014
Approximation algorithms for semi-random partitioning problems
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
592012
Bilu–Linial stable instances of max cut and minimum multiway cut
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
522014
Uniqueness of tensor decompositions with applications to polynomial identifiability
A Bhaskara, M Charikar, A Vijayaraghavan
Conference on Learning Theory (COLT) 2014 35, 742–778, 2014
512014
On learning mixtures of well-separated gaussians
O Regev, A Vijayaraghavan
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 85-96, 2017
402017
Approximating Matrix p-norms
A Bhaskara, A Vijayaraghavan
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
402011
Approximation Algorithms and Hardness of the k-Route Cut Problem
J Chuzhoy, Y Makarychev, A Vijayaraghavan, Y Zhou
ACM Transactions on Algorithms (TALG) 12 (1), 1-40, 2015
362015
Correlation clustering with noisy partial information
K Makarychev, Y Makarychev, A Vijayaraghavan
Conference on Learning Theory, 1321-1342, 2015
292015
Beating the random assignment on constraint satisfaction problems of bounded degree
B Barak, A Moitra, R O'Donnell, P Raghavendra, O Regev, D Steurer, ...
arXiv preprint arXiv:1505.03424, 2015
252015
Constant factor approximation for balanced cut in the PIE model
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
232014
Learning communities in the presence of errors
K Makarychev, Y Makarychev, A Vijayaraghavan
Conference on Learning Theory, 1258-1291, 2016
222016
Clustering Stable Instances of Euclidean k-means.
A Vijayaraghavan, A Dutta, A Wang
Advances in Neural Information Processing Systems, 6500-6509, 2017
212017
Approximation algorithms for label cover and the log-density threshold
E Chlamtáč, P Manurangsi, D Moshkovitz, A Vijayaraghavan
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
182017
Sorting noisy data with partial information
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
162013
On robustness to adversarial examples and polynomial optimization
P Awasthi, A Dutta, A Vijayaraghavan
Advances in Neural Information Processing Systems, 13760-13770, 2019
132019
On quadratic programming with a ratio objective
A Bhaskara, M Charikar, R Manokaran, A Vijayaraghavan
International Colloquium on Automata, Languages, and Programming, 109-120, 2012
62012
Optimality of approximate inference algorithms on stable instances
H Lang, D Sontag, A Vijayaraghavan
International Conference on Artificial Intelligence and Statistics, 1157-1166, 2018
52018
The system can't perform the operation now. Try again later.
Articles 1–20