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