 | 2009 |
| 43 |  | William B. Johnson,
Assaf Naor:
The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite.
SODA 2009: 885-891 |
| 42 |  | Subhash Khot,
Assaf Naor:
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
CoRR abs/0906.4816: (2009) |
| 41 |  | Jeff Cheeger,
Bruce Kleiner,
Assaf Naor:
A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP
CoRR abs/0910.2024: (2009) |
| 40 |  | Jeff Cheeger,
Bruce Kleiner,
Assaf Naor:
Compression bounds for Lipschitz maps from the Heisenberg group to $L_1$
CoRR abs/0910.2026: (2009) |
| 2008 |
| 39 |  | Subhash Khot,
Assaf Naor:
Approximate Kernel Clustering.
FOCS 2008: 561-570 |
| 38 |  | Guy Kindler,
Assaf Naor,
Gideon Schechtman:
The UGC hardness threshold of the ℓp Grothendieck problem.
SODA 2008: 64-73 |
| 37 |  | Manor Mendel,
Assaf Naor:
Markov convexity and local rigidity of distorted metrics.
Symposium on Computational Geometry 2008: 49-58 |
| 36 |  | William B. Johnson,
Assaf Naor:
The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
CoRR abs/0807.1919: (2008) |
| 35 |  | Subhash Khot,
Assaf Naor:
Approximate kernel clustering
CoRR abs/0807.4626: (2008) |
| 34 |  | Assaf Naor,
Jacques Verstraëte:
Parity check matrices and product representations of squares.
Combinatorica 28(2): 163-185 (2008) |
| 33 |  | Subhash Khot,
Assaf Naor:
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.
SIAM J. Comput. 38(4): 1448-1463 (2008) |
| 2007 |
| 32 |  | Manor Mendel,
Assaf Naor:
Maximum Gradient Embeddings and Monotone Clustering.
APPROX-RANDOM 2007: 242-256 |
| 31 |  | Subhash Khot,
Assaf Naor:
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.
FOCS 2007: 318-328 |
| 30 |  | Piotr Indyk,
Assaf Naor:
Nearest-neighbor-preserving embeddings.
ACM Transactions on Algorithms 3(3): (2007) |
| 29 |  | Sanjeev Arora,
James R. Lee,
Assaf Naor:
Fréchet Embeddings of Negative Type Metrics.
Discrete & Computational Geometry 38(4): 726-739 (2007) |
| 28 |  | Dimitris Achlioptas,
Assaf Naor,
Yuval Peres:
On the maximum satisfiability of random formulas.
J. ACM 54(2): (2007) |
| 27 |  | Assaf Naor,
Gideon Schechtman:
Planar Earthmover Is Not in L1.
SIAM J. Comput. 37(3): 804-826 (2007) |
| 26 |  | Rajeev Motwani,
Assaf Naor,
Rina Panigrahy:
Lower Bounds on Locality Sensitive Hashing.
SIAM J. Discrete Math. 21(4): 930-935 (2007) |
| 2006 |
| 25 |  | Manor Mendel,
Assaf Naor:
Ramsey partitions and proximity data structures.
FOCS 2006: 109-118 |
| 24 |  | Assaf Naor,
Gideon Schechtman:
Planar Earthmover is not in L_1.
FOCS 2006: 655-666 |
| 23 |  | James R. Lee,
Assaf Naor:
Lp metrics on the Heisenberg group and the Goemans-Linial conjecture.
FOCS 2006: 99-108 |
| 22 |  | James R. Lee,
Assaf Naor,
Yuval Peres:
Trees and Markov convexity.
SODA 2006: 1028-1037 |
| 21 |  | Manor Mendel,
Assaf Naor:
Metric cotype.
SODA 2006: 79-88 |
| 20 |  | Rajeev Motwani,
Assaf Naor,
Rina Panigrahy:
Lower bounds on locality sensitive hashing.
Symposium on Computational Geometry 2006: 154-157 |
| 19 |  | Manor Mendel,
Assaf Naor:
Maximum gradient embeddings and monotone clustering
CoRR abs/cs/0606109: (2006) |
| 18 |  | Noga Alon,
Assaf Naor:
Approximating the Cut-Norm via Grothendieck's Inequality.
SIAM J. Comput. 35(4): 787-803 (2006) |
| 2005 |
| 17 |  | Subhash Khot,
Assaf Naor:
Nonembeddability theorems via Fourier analysis.
FOCS 2005: 101-112 |
| 16 |  | Noga Alon,
Konstantin Makarychev,
Yury Makarychev,
Assaf Naor:
Quadratic forms on graphs.
STOC 2005: 486-493 |
| 15 |  | Sanjeev Arora,
James R. Lee,
Assaf Naor:
Euclidean distortion and the sparsest cut.
STOC 2005: 553-562 |
| 14 |  | Assaf Naor,
Gideon Schechtman:
Planar Earthmover is not in $L_1$
CoRR abs/cs/0509074: (2005) |
| 13 |  | Rajeev Motwani,
Assaf Naor,
Rina Panigrahy:
Lower bounds on Locality Sensitive Hashing
CoRR abs/cs/0510088: (2005) |
| 12 |  | Manor Mendel,
Assaf Naor:
Ramsey partitions and proximity data structures
CoRR abs/cs/0511084: (2005) |
| 11 |  | Yair Bartal,
Nathan Linial,
Manor Mendel,
Assaf Naor:
Some Low Distortion Metric Ramsey Problems.
Discrete & Computational Geometry 33(1): 27-41 (2005) |
| 10 |  | James R. Lee,
Manor Mendel,
Assaf Naor:
Metric structures in L1: dimension, snowflakes, and average distortion.
Eur. J. Comb. 26(8): 1180-1190 (2005) |
| 2004 |
| 9 |  | Robert Krauthgamer,
James R. Lee,
Manor Mendel,
Assaf Naor:
Measured Descent: A New Embedding Method for Finite Metrics.
FOCS 2004: 434-443 |
| 8 |  | James R. Lee,
Manor Mendel,
Assaf Naor:
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.
LATIN 2004: 401-412 |
| 7 |  | Dimitris Achlioptas,
Assaf Naor:
The two possible values of the chromatic number of a random graph.
STOC 2004: 587-593 |
| 6 |  | Noga Alon,
Assaf Naor:
Approximating the cut-norm via Grothendieck's inequality.
STOC 2004: 72-80 |
| 5 |  | Robert Krauthgamer,
James R. Lee,
Manor Mendel,
Assaf Naor:
Measured descent: A new embedding method for finite metrics
CoRR abs/cs/0412008: (2004) |
| 4 |  | Yair Bartal,
Nathan Linial,
Manor Mendel,
Assaf Naor:
Low dimensional embeddings of ultrametrics.
Eur. J. Comb. 25(1): 87-92 (2004) |
| 2003 |
| 3 |  | Dimitris Achlioptas,
Assaf Naor,
Yuval Peres:
On the Maximum Satisfiability of Random Formulas.
FOCS 2003: 362- |
| 2 |  | Yair Bartal,
Nathan Linial,
Manor Mendel,
Assaf Naor:
On metric ramsey-type phenomena.
STOC 2003: 463-472 |
| 2002 |
| 1 |  | Nathan Linial,
Avner Magen,
Assaf Naor:
Girth and euclidean distortion.
STOC 2002: 705-711 |