The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Assaf Naor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rajeev Motwani, Assaf Naor, Rina Panigrahy
    Lower bounds on locality sensitive hashing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:154-157 [Conf]
  2. Dimitris Achlioptas, Assaf Naor, Yuval Peres
    On the Maximum Satisfiability of Random Formulas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:362-0 [Conf]
  3. Subhash Khot, Assaf Naor
    Nonembeddability theorems via Fourier analysis. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:101-112 [Conf]
  4. Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor
    Measured Descent: A New Embedding Method for Finite Metrics. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:434-443 [Conf]
  5. James R. Lee, Assaf Naor
    Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:99-108 [Conf]
  6. Manor Mendel, Assaf Naor
    Ramsey partitions and proximity data structures. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:109-118 [Conf]
  7. Assaf Naor, Gideon Schechtman
    Planar Earthmover is not in L_1. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:655-666 [Conf]
  8. James R. Lee, Manor Mendel, Assaf Naor
    Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:401-412 [Conf]
  9. James R. Lee, Assaf Naor, Yuval Peres
    Trees and Markov convexity. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1028-1037 [Conf]
  10. Manor Mendel, Assaf Naor
    Metric cotype. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:79-88 [Conf]
  11. Dimitris Achlioptas, Assaf Naor
    The two possible values of the chromatic number of a random graph. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:587-593 [Conf]
  12. Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor
    Quadratic forms on graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:486-493 [Conf]
  13. Noga Alon, Assaf Naor
    Approximating the cut-norm via Grothendieck's inequality. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:72-80 [Conf]
  14. Sanjeev Arora, James R. Lee, Assaf Naor
    Euclidean distortion and the sparsest cut. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:553-562 [Conf]
  15. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    On metric ramsey-type phenomena. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:463-472 [Conf]
  16. Nathan Linial, Avner Magen, Assaf Naor
    Girth and euclidean distortion. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:705-711 [Conf]
  17. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    Some Low Distortion Metric Ramsey Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:27-41 [Journal]
  18. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    Low dimensional embeddings of ultrametrics. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:1, pp:87-92 [Journal]
  19. James R. Lee, Manor Mendel, Assaf Naor
    Metric structures in L1: dimension, snowflakes, and average distortion. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:8, pp:1180-1190 [Journal]
  20. Dimitris Achlioptas, Assaf Naor, Yuval Peres
    On the maximum satisfiability of random formulas. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:2, pp:- [Journal]
  21. Noga Alon, Assaf Naor
    Approximating the Cut-Norm via Grothendieck's Inequality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:787-803 [Journal]
  22. Manor Mendel, Assaf Naor
    Maximum Gradient Embeddings and Monotone Clustering. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:242-256 [Conf]
  23. Manor Mendel, Assaf Naor
    Maximum gradient embeddings and monotone clustering [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  24. Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor
    Measured descent: A new embedding method for finite metrics [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  25. Assaf Naor, Gideon Schechtman
    Planar Earthmover Is Not in L1. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:804-826 [Journal]
  26. Piotr Indyk, Assaf Naor
    Nearest-neighbor-preserving embeddings. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  27. Markov convexity and local rigidity of distorted metrics. [Citation Graph (, )][DBLP]


  28. Approximate Kernel Clustering. [Citation Graph (, )][DBLP]


  29. Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. [Citation Graph (, )][DBLP]


  30. A (log n)Omega(1) Integrality Gap for the Sparsest Cut SDP. [Citation Graph (, )][DBLP]


  31. The UGC hardness threshold of the ℓp Grothendieck problem. [Citation Graph (, )][DBLP]


  32. The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite. [Citation Graph (, )][DBLP]


  33. Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. [Citation Graph (, )][DBLP]


  34. Towards a Calculus for Non-Linear Spectral Gaps. [Citation Graph (, )][DBLP]


  35. Parity check matrices and product representations of squares. [Citation Graph (, )][DBLP]


  36. Planar Earthmover is not in $L_1$ [Citation Graph (, )][DBLP]


  37. Lower bounds on Locality Sensitive Hashing [Citation Graph (, )][DBLP]


  38. Ramsey partitions and proximity data structures [Citation Graph (, )][DBLP]


  39. Approximate kernel clustering [Citation Graph (, )][DBLP]


  40. The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite [Citation Graph (, )][DBLP]


  41. Sharp kernel clustering algorithms and their associated Grothendieck inequalities [Citation Graph (, )][DBLP]


  42. A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP [Citation Graph (, )][DBLP]


  43. Compression bounds for Lipschitz maps from the Heisenberg group to $L_1$ [Citation Graph (, )][DBLP]


  44. L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry [Citation Graph (, )][DBLP]


  45. Overlap properties of geometric expanders [Citation Graph (, )][DBLP]


  46. Fréchet Embeddings of Negative Type Metrics. [Citation Graph (, )][DBLP]


  47. The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, But Not Quite. [Citation Graph (, )][DBLP]


  48. The Euclidean Distortion of the Lamplighter Group. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002