- IAS/Park City Mathematics Series Volume 00, 0000
- Message-Passing Algorithms and Improved LP Decoding Sanjeev Arora
- Expander Flows, Geometric Embeddings and Graph Partitioning (Longer version of an ACM STOC 2004 paper)
- Subexponential Algorithms for UNIQUE GAMES and Related Problems
- Learning mixtures of arbitrary gaussians [Extended Abstract] #
- Approximation schemes for NPhard geometric optimization problems: A survey
- The Hardness of Approximate Optima in Lattices, and Systems of Linear Equations
- A Combinatorial, Primal-Dual approach to Semidefinite Programs Sanjeev Arora
- ON-LINE ALGORITHMS FOR PATH SELECTION IN A NONBLOCKING NETWORK
- SANJEEV ARORA Curriculum Vitae, November 2010.
- Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Sanjeev Arora \Lambda
- COS 522: Computational Complexity Princeton University, Spring 2001
- Approximation Schemes for Degreerestricted MST and RedBlue Separation Problem
- Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
- Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric
- The Approximability of NPhard Problems Sanjeev Arora #
- Probabilistic Checking of Proofs Hardness of Approximation Problems
- Fitting Algebraic Curves to Noisy Data Sanjeev Arora # Subhash Khot +
- Polynomial Time Approximation Schemes for Dense Instances of NPHard Problems
- Proving integrality gaps without knowing the linear program Sanjeev Arora #
- A 2 + # approximation algorithm for the kMST problem Sanjeev Arora #
- Approximation Schemes for Minimum Latency Problems Sanjeev Arora #
- Proof Verification and the Hardness of Approximation Problems
- Expander Flows, Geometric Embeddings and Graph Partitioning
- Improved lowdegree testing and its applications Sanjeev Arora \Lambda
- Probabilistic Checking of Proofs Hardness of Approximation Problems
- Computational Complexity and Information Asymmetry in Financial Products
- 54 CHAPTER 10 HARDNESS OF APPROXIMATIONS Sha92. A. Shamir. IP = PSPACE. J. of the ACM, 39(4):869--877, October 1992.
- Page Replacement for General Caching Problems Susanne Albers # Sanjeev Arora + Sanjeev Khanna #
- Approximation schemes for Euclidean kmedians and related Sanjeev Arora #
- The Multiplicative Weights Update Method: a Meta Algorithm and Applications
- 96 communications of the acm | october 2008 | vol. 51 | no. 10 Geometry, Flows, and
- SANJEEV ARORA Curriculum Vitae, November 2005.
- Towards a study of low-complexity graphs Sanjeev Arora, David Steurer, and Avi Wigderson
- SANJEEV ARORA Curriculum Vitae, December 2008.
- The Annals of Applied Probability 2005, Vol. 15, No. 1A, 6992
- A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph
- Reductions, Codes, PCPs, and Inapproximability Sanjeev Arora \Lambda
- A Randomized Online Algorithm for Bandwidth Utilization
- Fast Algorithms for Approximate Semidefinite Programming using the Multiplicative Weights Update Method
- A PolynomialTime Approximation Scheme for Weighted Planar Graph TSP
- Simulating Quadratic Dynamical Systems is PSPACEcomplete (preliminary version)
- Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
- Probabilistic Checking of Proofs: A New Characterization of NP \Lambda
- Around the PCP Theorem Sanjeev Arora
- A Randomized Online Algorithm for Bandwidth Utilization
- Fitting Algebraic Curves to Noisy Data Sanjeev Arora #
- Expander Flows, Geometric Embeddings and Graph Partitioning
- New Tools for Graph Coloring Sanjeev Arora
