The SCEAS System
| |||||||

## Search the dblp DataBase
Sanjeev Arora:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sanjeev Arora
**Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.**[Citation Graph (1, 0)][DBLP] FOCS, 1996, pp:2-11 [Conf] - Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk
**The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations**[Citation Graph (1, 0)][DBLP] FOCS, 1993, pp:724-733 [Conf] - Sanjeev Arora
**Approximation algorithms that take advice.**[Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:1- [Conf] - Sanjeev Arora, Elad Hazan, Satyen Kale
**A Fast Random Sampling Algorithm for Sparsifying Matrices.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:272-279 [Conf] - Sanjeev Arora
**Proving Integrality Gaps without Knowing the Linear Program.**[Citation Graph (0, 0)][DBLP] FCT, 2003, pp:1- [Conf] - Sanjeev Arora
**Reductions, Codes, PCPs, and Inapproximability.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:404-413 [Conf] - Sanjeev Arora
**Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:554-563 [Conf] - Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
**On Non-Approximability for Quadratic Programs.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:206-215 [Conf] - Sanjeev Arora, Béla Bollobás, László Lovász
**Proving Integrality Gaps without Knowing the Linear Program.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:313-322 [Conf] - Sanjeev Arora, Alan M. Frieze, Haim Kaplan
**A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:21-30 [Conf] - Sanjeev Arora, Elad Hazan, Satyen Kale
**0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n**[Citation Graph (0, 0)][DBLP]^{2}) Time. FOCS, 2004, pp:238-247 [Conf] - Sanjeev Arora, Elad Hazan, Satyen Kale
**Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:339-348 [Conf] - Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
**Proof Verification and Hardness of Approximation Problems**[Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:14-23 [Conf] - Sanjeev Arora, Shmuel Safra
**Probabilistic Checking of Proofs; A New Characterization of NP**[Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:2-13 [Conf] - Sanjeev Arora
**Approximation Schemes for Geometric NP-Hard Problems: A Survey.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:16-17 [Conf] - Sanjeev Arora, Kevin L. Chang
**Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:176-188 [Conf] - Eric Allender, Sanjeev Arora, Michael S. Kearns, Cristopher Moore, Alexander Russell
**A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.**[Citation Graph (0, 0)][DBLP] NIPS, 2002, pp:431-437 [Conf] - Sanjeev Arora
**Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.**[Citation Graph (0, 0)][DBLP] RANDOM, 1997, pp:55- [Conf] - Susanne Albers, Sanjeev Arora, Sanjeev Khanna
**Page Replacement for General Caching Problems.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:31-40 [Conf] - Sanjeev Arora, Bo Brinkman
**A randomized online algorithm for bandwidth utilization.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:535-539 [Conf] - Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn
**A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP.**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:33-41 [Conf] - Sanjeev Arora, George Karakostas
**A 2+epsilon approximation algorithm for the**[Citation Graph (0, 0)][DBLP]*k*-MST problem. SODA, 2000, pp:754-759 [Conf] - Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala
**Local versus global properties of metric spaces.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:41-50 [Conf] - Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis
**Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:294-303 [Conf] - Sanjeev Arora
**The Approximability of NP-hard Problems.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:337-348 [Conf] - Sanjeev Arora, Eden Chlamtac
**New approximation guarantee for chromatic number.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:215-224 [Conf] - Sanjeev Arora, Subhash Khot
**Fitting algebraic curves to noisy data.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:162-169 [Conf] - Sanjeev Arora, George Karakostas
**Approximation Schemes for Minimum Latency Problems.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:688-693 [Conf] - Sanjeev Arora, David R. Karger, Marek Karpinski
**Polynomial time approximation schemes for dense instances of**[Citation Graph (0, 0)][DBLP]*NP*-hard problems. STOC, 1995, pp:284-293 [Conf] - Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs
**On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:149-158 [Conf] - Sanjeev Arora, James R. Lee, Assaf Naor
**Euclidean distortion and the sparsest cut.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:553-562 [Conf] - Sanjeev Arora, Prabhakar Raghavan, Satish Rao
**Approximation Schemes for Euclidean**[Citation Graph (0, 0)][DBLP]*k*-Medians and Related Problems. STOC, 1998, pp:106-113 [Conf] - Sanjeev Arora, Satish Rao, Umesh V. Vazirani
**Expander flows, geometric embeddings and graph partitioning.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:222-231 [Conf] - Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani
**Simulating quadratic dynamical systems is PSPACE-complete (preliminary version).**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:459-467 [Conf] - Sanjeev Arora, Madhu Sudan
**Improved Low-Degree Testing and its Applications.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:485-495 [Conf] - Sanjeev Arora, Ravi Kannan
**Learning mixtures of arbitrary gaussians.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:247-257 [Conf] - Sanjeev Arora, Kevin L. Chang
**Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:3, pp:189-210 [Journal] - Sanjeev Arora, Bernard Chazelle
**Is the thrill gone?**[Citation Graph (0, 0)][DBLP] Commun. ACM, 2005, v:48, n:8, pp:31-33 [Journal] - Sanjeev Arora, Madhu Sudan
**Improved Low-Degree Testing and its Applications.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2003, v:23, n:3, pp:365-426 [Journal] - Sanjeev Arora
**How NP got a new definition: a survey of probabilistically checkable proofs**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Mikhail Alecknovich, Sanjeev Arora, Iannis Tourlakis
**Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:117, pp:- [Journal] - Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
**On Non-Approximability for Quadratic Programs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:058, pp:- [Journal] - Sanjeev Arora, Madhu Sudan
**Improved low-degree testing and its applications**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:3, pp:- [Journal] - Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
**Proof verification and the hardness of approximation problems.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:8, pp:- [Journal] - Sanjeev Arora
**Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems.**[Citation Graph (0, 0)][DBLP] J. ACM, 1998, v:45, n:5, pp:753-782 [Journal] - Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
**Proof Verification and the Hardness of Approximation Problems.**[Citation Graph (0, 0)][DBLP] J. ACM, 1998, v:45, n:3, pp:501-555 [Journal] - Sanjeev Arora, Shmuel Safra
**Probabilistic Checking of Proofs: A New Characterization of NP.**[Citation Graph (0, 0)][DBLP] J. ACM, 1998, v:45, n:1, pp:70-122 [Journal] - Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk
**The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:317-331 [Journal] - Sanjeev Arora, Subhash Khot
**Fitting algebraic curves to noisy data.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:2, pp:325-340 [Journal] - Sanjeev Arora, David R. Karger, Marek Karpinski
**Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:58, n:1, pp:193-210 [Journal] - Sanjeev Arora, George Karakostas
**A 2 +**[Citation Graph (0, 0)][DBLP]*epsilon*approximation algorithm for the*k*-MST problem. Math. Program., 2006, v:107, n:3, pp:491-504 [Journal] - Sanjeev Arora, Bo Brinkman
**A Randomized Online Algorithm for Bandwidth Utilization.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:3, pp:187-194 [Journal] - Sanjeev Arora, George Karakostas
**Approximation Schemes for Minimum Latency Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:5, pp:1317-1337 [Journal] - Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs
**On-Line Algorithms for Path Selection in a Nonblocking Network.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:3, pp:600-625 [Journal] - Sanjeev Arora, Ronald Fagin
**On Winning Strategies in Ehrenfeucht-Fraïssé Games.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:174, n:1-2, pp:97-121 [Journal] - Sanjeev Arora, Satyen Kale
**A combinatorial, primal-dual approach to semidefinite programs.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:227-236 [Conf] **Towards a Study of Low-Complexity Graphs.**[Citation Graph (, )][DBLP]**Unique games on expanding constraint graphs are easy: extended abstract.**[Citation Graph (, )][DBLP]**Message passing algorithms and improved LP decoding.**[Citation Graph (, )][DBLP]**Semidefinite Programming and Approximation Algorithms: A Survey.**[Citation Graph (, )][DBLP]**Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract).**[Citation Graph (, )][DBLP]**Geometry, flows, and graph-partitioning algorithms.**[Citation Graph (, )][DBLP]**Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)**[Citation Graph (, )][DBLP]**Fréchet Embeddings of Negative Type Metrics.**[Citation Graph (, )][DBLP]
Search in 0.029secs, Finished in 0.031secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |