Sanjeev Arora
Sanjeev Arora
Professor of Computer Science, Princeton University
Verifierad e-postadress på cs.princeton.edu - Startsida
Titel
Citeras av
Citeras av
År
Computational complexity: a modern approach
S Arora, B Barak
Cambridge University Press, 2009
30322009
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
26861998
Probabilistic checking of proofs: A new characterization of NP
S Arora, S Safra
Journal of the ACM (JACM) 45 (1), 70-122, 1998
15291998
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
S Arora
Journal of the ACM (JACM) 45 (5), 753-782, 1998
12071998
Expander flows, geometric embeddings and graph partitioning
S Arora, S Rao, U Vazirani
Journal of the ACM (JACM) 56 (2), 1-37, 2009
8502009
The multiplicative weights update method: a meta-algorithm and applications
S Arora, E Hazan, S Kale
Theory of Computing 8 (1), 121-164, 2012
7212012
A simple but tough-to-beat baseline for sentence embeddings
S Arora, Y Liang, T Ma
7012016
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
538*1997
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
5061996
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
4941999
Approximation schemes for Euclidean k-medians and related problems
S Arora, P Raghavan, S Rao
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
4631998
Hardness of approximations
S Arora, C Lund
Approximation algorithms for NP-hard problems, 399-446, 1996
4101996
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
3882012
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
3772013
Computing a nonnegative matrix factorization---Provably
S Arora, R Ge, R Kannan, A Moitra
SIAM Journal on Computing 45 (4), 1582-1611, 2016
3702016
Generalization and equilibrium in generative adversarial nets (gans)
S Arora, R Ge, Y Liang, T Ma, Y Zhang
arXiv preprint arXiv:1703.00573, 2017
3572017
Improved low-degree testing and its applications
S Arora, M Sudan
Combinatorica 23 (3), 365-426, 2003
3342003
Provable bounds for learning some deep representations
S Arora, A Bhaskara, R Ge, T Ma
International Conference on Machine Learning, 584-592, 2014
3102014
Measurement of the rapidity and transverse momentum distributions of bosons in collisions at
S Chatrchyan, V Khachatryan, AM Sirunyan, A Tumasyan, W Adam, ...
Physical Review D 85 (3), 032002, 2012
3012012
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
2541997
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20