- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j17 |      | Subhash Khot, Assaf Naor: Sharp kernel clustering algorithms and their associated Grothendieck inequalities. Random Struct. Algorithms 42(3): 269-300 (2013) |
| 2012 | ||
| j16 | | Assaf Naor: On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon-Roichman Graphs. Combinatorics, Probability & Computing 21(4): 623-634 (2012) |
| c28 | | Steven Heilman, Aukosh Jagannath, Assaf Naor: Solution of the propeller conjecture in R3. STOC 2012: 269-276 |
| i16 | | Jop Briët, Assaf Naor, Oded Regev: Locally decodable codes and the failure of cotype for projective tensor products. CoRR abs/1208.0539 (2012) |
| i15 | | Assaf Naor, Oded Regev, Thomas Vidick: Efficient rounding for the noncommutative Grothendieck inequality. CoRR abs/1210.7656 (2012) |
| 2011 | ||
| c27 | | Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor: The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462 |
| c26 | | Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach: Overlap properties of geometric expanders. SODA 2011: 1188-1197 |
| i14 | | Subhash Khot, Assaf Naor: Grothendieck-type inequalities in combinatorial optimization. CoRR abs/1108.2464 (2011) |
| i13 | | Steven Heilman, Aukosh Jagannath, Assaf Naor: Solution of the propeller conjecture in $\R^3$. CoRR abs/1112.2993 (2011) |
| 2010 | ||
| j15 | | Manor Mendel, Assaf Naor: Maximum gradient embeddings and monotone clustering. Combinatorica 30(5): 581-615 (2010) |
| j14 | | William B. Johnson, Assaf Naor: The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, But Not Quite. Discrete & Computational Geometry 43(3): 542-553 (2010) |
| j13 | | Tim Austin, Assaf Naor, Alain Valette: The Euclidean Distortion of the Lamplighter Group. Discrete & Computational Geometry 44(1): 55-74 (2010) |
| j12 | | Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC Hardness Threshold of the Lp Grothendieck Problem. Math. Oper. Res. 35(2): 267-283 (2010) |
| c25 | | |
| c24 | | Subhash Khot, Assaf Naor: Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. SODA 2010: 664-683 |
| i12 | | Assaf Naor: L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry. CoRR abs/1003.4261 (2010) |
| i11 | | Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach: Overlap properties of geometric expanders. CoRR abs/1005.1392 (2010) |
| 2009 | ||
| c23 | | Jeff Cheeger, Bruce Kleiner, Assaf Naor: A (log n)Omega(1) Integrality Gap for the Sparsest Cut SDP. FOCS 2009: 555-564 |
| c22 | | William B. Johnson, Assaf Naor: The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite. SODA 2009: 885-891 |
| i10 | | Subhash Khot, Assaf Naor: Sharp kernel clustering algorithms and their associated Grothendieck inequalities. CoRR abs/0906.4816 (2009) |
| i9 | | Jeff Cheeger, Bruce Kleiner, Assaf Naor: A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP. CoRR abs/0910.2024 (2009) |
| i8 | | Jeff Cheeger, Bruce Kleiner, Assaf Naor: Compression bounds for Lipschitz maps from the Heisenberg group to $L_1$. CoRR abs/0910.2026 (2009) |
| 2008 | ||
| j11 | | Assaf Naor, Jacques Verstraëte: Parity check matrices and product representations of squares. Combinatorica 28(2): 163-185 (2008) |
| j10 | | Subhash Khot, Assaf Naor: Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. SIAM J. Comput. 38(4): 1448-1463 (2008) |
| c21 | | Manor Mendel, Assaf Naor: Markov convexity and local rigidity of distorted metrics. Symposium on Computational Geometry 2008: 49-58 |
| c20 | | |
| c19 | | Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC hardness threshold of the ℓp Grothendieck problem. SODA 2008: 64-73 |
| i7 | | William B. Johnson, Assaf Naor: The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite. CoRR abs/0807.1919 (2008) |
| i6 | | |
| 2007 | ||
| j9 | | Sanjeev Arora, James R. Lee, Assaf Naor: Fréchet Embeddings of Negative Type Metrics. Discrete & Computational Geometry 38(4): 726-739 (2007) |
| j8 | | Dimitris Achlioptas, Assaf Naor, Yuval Peres: On the maximum satisfiability of random formulas. J. ACM 54(2) (2007) |
| j7 | | Assaf Naor, Gideon Schechtman: Planar Earthmover Is Not in L1. SIAM J. Comput. 37(3): 804-826 (2007) |
| j6 | | Rajeev Motwani, Assaf Naor, Rina Panigrahy: Lower Bounds on Locality Sensitive Hashing. SIAM J. Discrete Math. 21(4): 930-935 (2007) |
| j5 | | Piotr Indyk, Assaf Naor: Nearest-neighbor-preserving embeddings. ACM Transactions on Algorithms 3(3) (2007) |
| c18 | | Manor Mendel, Assaf Naor: Maximum Gradient Embeddings and Monotone Clustering. APPROX-RANDOM 2007: 242-256 |
| c17 | | Subhash Khot, Assaf Naor: Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. FOCS 2007: 318-328 |
| 2006 | ||
| j4 | | Noga Alon, Assaf Naor: Approximating the Cut-Norm via Grothendieck's Inequality. SIAM J. Comput. 35(4): 787-803 (2006) |
| c16 | | Rajeev Motwani, Assaf Naor, Rina Panigrahy: Lower bounds on locality sensitive hashing. Symposium on Computational Geometry 2006: 154-157 |
| c15 | | James R. Lee, Assaf Naor: Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. FOCS 2006: 99-108 |
| c14 | | |
| c13 | | |
| c12 | | |
| c11 | | |
| i5 | | Manor Mendel, Assaf Naor: Maximum gradient embeddings and monotone clustering. CoRR abs/cs/0606109 (2006) |
| 2005 | ||
| j3 | | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor: Some Low Distortion Metric Ramsey Problems. Discrete & Computational Geometry 33(1): 27-41 (2005) |
| j2 | | James R. Lee, Manor Mendel, Assaf Naor: Metric structures in L1: dimension, snowflakes, and average distortion. Eur. J. Comb. 26(8): 1180-1190 (2005) |
| c10 | | |
| c9 | | Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor: Quadratic forms on graphs. STOC 2005: 486-493 |
| c8 | | Sanjeev Arora, James R. Lee, Assaf Naor: Euclidean distortion and the sparsest cut. STOC 2005: 553-562 |
| i4 | | |
| i3 | | Rajeev Motwani, Assaf Naor, Rina Panigrahy: Lower bounds on Locality Sensitive Hashing. CoRR abs/cs/0510088 (2005) |
| i2 | | Manor Mendel, Assaf Naor: Ramsey partitions and proximity data structures. CoRR abs/cs/0511084 (2005) |
| 2004 | ||
| j1 | | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor: Low dimensional embeddings of ultrametrics. Eur. J. Comb. 25(1): 87-92 (2004) |
| c7 | | Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor: Measured Descent: A New Embedding Method for Finite Metrics. FOCS 2004: 434-443 |
| c6 | | James R. Lee, Manor Mendel, Assaf Naor: Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. LATIN 2004: 401-412 |
| c5 | | |
| c4 | | Dimitris Achlioptas, Assaf Naor: The two possible values of the chromatic number of a random graph. STOC 2004: 587-593 |
| i1 | | Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor: Measured descent: A new embedding method for finite metrics. CoRR abs/cs/0412008 (2004) |
| 2003 | ||
| c3 | | Dimitris Achlioptas, Assaf Naor, Yuval Peres: On the Maximum Satisfiability of Random Formulas. FOCS 2003: 362-370 |
| c2 | | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor: On metric ramsey-type phenomena. STOC 2003: 463-472 |
| 2002 | ||
| c1 | | |
Colors in the list of coauthors
Last update Wed May 22 10:13:28 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page