Sanjeev Arora
Sanjeev Arora
Professor of Computer Science, Princeton University
確認したメール アドレス: cs.princeton.edu - ホームページ
タイトル引用先
Proof verification and the hardness of approximation problems
S Arora, C Lund, R Motwani, M Sudan, M Szegedy
Journal of the ACM (JACM) 45 (3), 501-555, 1998
25261998
Computational complexity: a modern approach
S Arora, B Barak
Cambridge University Press, 2009
25142009
Probabilistic checking of proofs: A new characterization of NP
S Arora, S Safra
Journal of the ACM (JACM) 45 (1), 70-122, 1998
14311998
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
S Arora
Journal of the ACM (JACM) 45 (5), 753-782, 1998
11071998
Expander flows, geometric embeddings and graph partitioning
S Arora, S Rao, U Vazirani
Journal of the ACM (JACM) 56 (2), 5, 2009
7872009
The multiplicative weights update method: a meta-algorithm and applications
S Arora, E Hazan, S Kale
Theory of Computing 8 (1), 121-164, 2012
5912012
The hardness of approximate optima in lattices, codes, and systems of linear equations
S Arora, L Babai, J Stern, Z Sweedyk
Journal of Computer and System Sciences 54 (2), 317-331, 1997
5061997
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
S Arora
Proceedings of 37th Conference on Foundations of Computer Science, 2-11, 1996
4911996
Polynomial time approximation schemes for dense instances of NP-hard problems
S Arora, D Karger, M Karpinski
Journal of computer and system sciences 58 (1), 193-210, 1999
4731999
Approximation Schemes for Euclidean k-Medians and Related Problems.
S Arora, P Raghavan, S Rao
STOC 98, 106-113, 1998
4191998
Hardness of approximations
S Arora, C Lund
Approximation algorithms for NP-hard problems, 399-446, 1996
3991996
A simple but tough-to-beat baseline for sentence embeddings
S Arora, Y Liang, T Ma
3272016
Improved low-degree testing and its applications
S Arora, M Sudan
Combinatorica 23 (3), 365-426, 2003
3152003
Learning topic models--going beyond SVD
S Arora, R Ge, A Moitra
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 1-10, 2012
3142012
A practical algorithm for topic modeling with provable guarantees
S Arora, R Ge, Y Halpern, D Mimno, A Moitra, D Sontag, Y Wu, M Zhu
International Conference on Machine Learning, 280-288, 2013
3002013
Computing a nonnegative matrix factorization--provably
S Arora, R Ge, R Kannan, A Moitra
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
2992012
Provable bounds for learning some deep representations
S Arora, A Bhaskara, R Ge, T Ma
International Conference on Machine Learning, 584-592, 2014
2572014
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
S Arora
Proceedings 38th Annual Symposium on Foundations of Computer Science, 554-563, 1997
2501997
Euclidean distortion and the sparsest cut
S Arora, J Lee, A Naor
Journal of the American Mathematical Society 21 (1), 1-21, 2008
2322008
Generalization and equilibrium in generative adversarial nets (gans)
S Arora, R Ge, Y Liang, T Ma, Y Zhang
Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017
2112017
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20