Assaf Naor

Affiliations:
  • Princeton University, Mathematics Department, NJ, USA
  • Microsoft Research (former)


According to our database1, Assaf Naor authored at least 63 papers between 2002 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A framework for quadratic form maximization over convex sets through nonconvex relaxations.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
Impossibility of Dimension Reduction in the Nuclear Norm.
Discret. Comput. Geom., 2020

2019
Krivine diffusions attain the Goemans-Williamson approximation ratio.
CoRR, 2019

The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Metric dimension reduction: A snapshot of the Ribe program.
CoRR, 2018

Data-dependent hashing via nonlinear spectral gaps.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Hölder Homeomorphisms and Approximate Nearest Neighbors.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Vertical perimeter versus horizontal perimeter.
CoRR, 2017

The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Probabilistic clustering of high dimensional norms.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A Spectral Gap Precludes Low-Dimensional Embeddings.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
Efficient Rounding for the Noncommutative Grothendieck Inequality.
Theory Comput., 2014

Expanders with respect to Hadamard spaces and random graphs: extended abstract.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
Sharp kernel clustering algorithms and their associated Grothendieck inequalities.
Random Struct. Algorithms, 2013

Solution of the Propeller Conjecture in ℝ<sup>3</sup>.
Discret. Comput. Geom., 2013

Expanders with respect to Hadamard spaces and random graphs.
CoRR, 2013

Every graph is essentially sparse.
Commun. ACM, 2013

2012
On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon-Roichman Graphs.
Comb. Probab. Comput., 2012

Locally decodable codes and the failure of cotype for projective tensor products
CoRR, 2012

2011
Solution of the propeller conjecture in $\R^3$
CoRR, 2011

Grothendieck-type inequalities in combinatorial optimization
CoRR, 2011

Overlap properties of geometric expanders.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

The Grothendieck Constant is Strictly Smaller than Krivine's Bound.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
The UGC Hardness Threshold of the <i>L<sub>p</sub></i> Grothendieck Problem.
Math. Oper. Res., 2010

The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, But Not Quite.
Discret. Comput. Geom., 2010

The Euclidean Distortion of the Lamplighter Group.
Discret. Comput. Geom., 2010

L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry
CoRR, 2010

Maximum gradient embeddings and monotone clustering.
Comb., 2010

Towards a Calculus for Non-Linear Spectral Gaps.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Compression bounds for Lipschitz maps from the Heisenberg group to L<sub>1</sub>
CoRR, 2009

A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP
CoRR, 2009

A (log n)<sup>Omega(1)</sup> Integrality Gap for the Sparsest Cut SDP.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Linear Equations Modulo 2 and the L<sub>1</sub> Diameter of Convex Bodies.
SIAM J. Comput., 2008

Parity check matrices and product representations of squares.
Comb., 2008

The UGC hardness threshold of the ℓ<sub><i>p</i></sub> Grothendieck problem.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Approximate Kernel Clustering.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Markov convexity and local rigidity of distorted metrics.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Nearest-neighbor-preserving embeddings.
ACM Trans. Algorithms, 2007

Lower Bounds on Locality Sensitive Hashing.
SIAM J. Discret. Math., 2007

Planar Earthmover Is Not in L<sub>1</sub>.
SIAM J. Comput., 2007

On the maximum satisfiability of random formulas.
J. ACM, 2007

Fréchet Embeddings of Negative Type Metrics.
Discret. Comput. Geom., 2007

Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Approximating the Cut-Norm via Grothendieck's Inequality.
SIAM J. Comput., 2006

Metric cotype.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Trees and Markov convexity.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Planar Earthmover is not in L_1.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Ramsey partitions and proximity data structures.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Lp metrics on the Heisenberg group and the Goemans-Linial conjecture.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Metric structures in <i>L</i><sub>1</sub>: dimension, snowflakes, and average distortion.
Eur. J. Comb., 2005

Some Low Distortion Metric Ramsey Problems.
Discret. Comput. Geom., 2005

Euclidean distortion and the sparsest cut.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Quadratic forms on graphs.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Improved bounds on the size of sparse parity check matrices.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Nonembeddability theorems via Fourier analysis.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Low dimensional embeddings of ultrametrics.
Eur. J. Comb., 2004

The two possible values of the chromatic number of a random graph.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Measured Descent: A New Embedding Method for Finite Metrics.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
On metric ramsey-type phenomena.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Boolean functions whose Fourier transform is concentrated on the first two levels.
Adv. Appl. Math., 2002

Girth and euclidean distortion.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002


  Loading...