Search results for "Assaf Naor"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Steven Heilman, Aukosh Jagannath, Assaf Naor	Solution of the propeller conjecture in $\R^3$	CoRR	2011	DBLP BibTeX RDF
1	Subhash Khot, Assaf Naor	Grothendieck-type inequalities in combinatorial optimization	CoRR	2011	DBLP BibTeX RDF
1	Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach	Overlap properties of geometric expanders.	SODA	2011	DBLP BibTeX RDF
1	Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor	The Grothendieck Constant is Strictly Smaller than Krivine's Bound.	FOCS	2011	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Maximum gradient embeddings and monotone clustering.	Combinatorica	2010	DBLP DOI BibTeX RDF
1	Guy Kindler, Assaf Naor, Gideon Schechtman	The UGC Hardness Threshold of the Lp Grothendieck Problem.	Math. Oper. Res.	2010	DBLP DOI BibTeX RDF
1	William B. Johnson, Assaf Naor	The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, But Not Quite.	Discrete & Computational Geometry	2010	DBLP DOI BibTeX RDF
1	Tim Austin, Assaf Naor, Alain Valette	The Euclidean Distortion of the Lamplighter Group.	Discrete & Computational Geometry	2010	DBLP DOI BibTeX RDF
1	Assaf Naor	L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry	CoRR	2010	DBLP BibTeX RDF
1	Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach	Overlap properties of geometric expanders	CoRR	2010	DBLP BibTeX RDF
1	Manor Mendel, Assaf Naor	Towards a Calculus for Non-Linear Spectral Gaps.	SODA	2010	DBLP BibTeX RDF
1	Subhash Khot, Assaf Naor	Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities.	SODA	2010	DBLP BibTeX RDF
1	Jeff Cheeger, Bruce Kleiner, Assaf Naor	Compression bounds for Lipschitz maps from the Heisenberg group to $L_1$	CoRR	2009	DBLP BibTeX RDF
1	Jeff Cheeger, Bruce Kleiner, Assaf Naor	A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP	CoRR	2009	DBLP BibTeX RDF
1	Subhash Khot, Assaf Naor	Sharp kernel clustering algorithms and their associated Grothendieck inequalities	CoRR	2009	DBLP BibTeX RDF
1	William B. Johnson, Assaf Naor	The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite.	SODA	2009	DBLP DOI BibTeX RDF
1	Jeff Cheeger, Bruce Kleiner, Assaf Naor	A (log n)Omega(1) Integrality Gap for the Sparsest Cut SDP.	FOCS	2009	DBLP DOI BibTeX RDF	Sparsest Cut problem, Heisenberg group, semidefinite programming, metric embeddings, integrality gap
1	Assaf Naor, Jacques Verstraëte	Parity check matrices and product representations of squares.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05Cxx, 05Dxx, 94B65
1	William B. Johnson, Assaf Naor	The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite	CoRR	2008	DBLP BibTeX RDF
1	Subhash Khot, Assaf Naor	Approximate kernel clustering	CoRR	2008	DBLP BibTeX RDF
1	Subhash Khot, Assaf Naor	Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Guy Kindler, Assaf Naor, Gideon Schechtman	The UGC hardness threshold of the &ell;p Grothendieck problem.	SODA	2008	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Markov convexity and local rigidity of distorted metrics.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	bd-ramsey, markov convexity, metric dichotomy, p-convexity, uniform convexity, tree metrics
1	Subhash Khot, Assaf Naor	Approximate Kernel Clustering.	FOCS	2008	DBLP DOI BibTeX RDF
1	Piotr Indyk, Assaf Naor	Nearest-neighbor-preserving embeddings.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	doubling spaces, embeddings, dimensionality reduction, Nearest neighbor
1	Dimitris Achlioptas, Assaf Naor, Yuval Peres	On the maximum satisfiability of random formulas.	J. ACM	2007	DBLP DOI BibTeX RDF	Maximum satisfiability
1	Sanjeev Arora, James R. Lee, Assaf Naor	Fréchet Embeddings of Negative Type Metrics.	Discrete & Computational Geometry	2007	DBLP DOI BibTeX RDF	Sparsest cut problem, Euclidean, L 1, Distortion, Metric embeddings
1	Rajeev Motwani, Assaf Naor, Rina Panigrahy	Lower Bounds on Locality Sensitive Hashing.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Assaf Naor, Gideon Schechtman	Planar Earthmover Is Not in L1.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Maximum Gradient Embeddings and Monotone Clustering.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
1	Subhash Khot, Assaf Naor	Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.	FOCS	2007	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Maximum gradient embeddings and monotone clustering	CoRR	2006	DBLP BibTeX RDF
1	Noga Alon, Assaf Naor	Approximating the Cut-Norm via Grothendieck's Inequality.	SIAM J. Comput.	2006	DBLP DOI BibTeX RDF
1	James R. Lee, Assaf Naor, Yuval Peres	Trees and Markov convexity.	SODA	2006	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Metric cotype.	SODA	2006	DBLP DOI BibTeX RDF
1	Rajeev Motwani, Assaf Naor, Rina Panigrahy	Lower bounds on locality sensitive hashing.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	lower bounds, nearest neighbor search, locality sensitive hashing
1	Assaf Naor, Gideon Schechtman	Planar Earthmover is not in L_1.	FOCS	2006	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Ramsey partitions and proximity data structures.	FOCS	2006	DBLP DOI BibTeX RDF
1	James R. Lee, Assaf Naor	Lp metrics on the Heisenberg group and the Goemans-Linial conjecture.	FOCS	2006	DBLP DOI BibTeX RDF
1	James R. Lee, Manor Mendel, Assaf Naor	Metric structures in L1: dimension, snowflakes, and average distortion.	Eur. J. Comb.	2005	DBLP DOI BibTeX RDF
1	Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor	Some Low Distortion Metric Ramsey Problems.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Ramsey partitions and proximity data structures	CoRR	2005	DBLP BibTeX RDF
1	Assaf Naor, Gideon Schechtman	Planar Earthmover is not in $L_1$	CoRR	2005	DBLP BibTeX RDF
1	Rajeev Motwani, Assaf Naor, Rina Panigrahy	Lower bounds on Locality Sensitive Hashing	CoRR	2005	DBLP BibTeX RDF
1	Subhash Khot, Assaf Naor	Nonembeddability theorems via Fourier analysis.	FOCS	2005	DBLP DOI BibTeX RDF
1	Sanjeev Arora, James R. Lee, Assaf Naor	Euclidean distortion and the sparsest cut.	STOC	2005	DBLP DOI BibTeX RDF	approximation algorithms, semidefinite programming, metric embeddings, sparsest cut
1	Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor	Quadratic forms on graphs.	STOC	2005	DBLP DOI BibTeX RDF	Grothendieck's inequaity, rounding techniques, correlation clustering, spin glasses
1	Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor	Low dimensional embeddings of ultrametrics.	Eur. J. Comb.	2004	DBLP DOI BibTeX RDF
1	Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor	Measured descent: A new embedding method for finite metrics	CoRR	2004	DBLP BibTeX RDF
1	James R. Lee, Manor Mendel, Assaf Naor	Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.	LATIN	2004	DBLP DOI BibTeX RDF
1	Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor	Measured Descent: A New Embedding Method for Finite Metrics.	FOCS	2004	DBLP DOI BibTeX RDF
1	Noga Alon, Assaf Naor	Approximating the cut-norm via Grothendieck's inequality.	STOC	2004	DBLP DOI BibTeX RDF	Grothendieck's inequaity, cut-norm, rounding techniques
1	Dimitris Achlioptas, Assaf Naor	The two possible values of the chromatic number of a random graph.	STOC	2004	DBLP DOI BibTeX RDF	graph coloring, random graphs, chromatic number
1	Dimitris Achlioptas, Assaf Naor, Yuval Peres	On the Maximum Satisfiability of Random Formulas.	FOCS	2003	DBLP DOI BibTeX RDF
1	Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor	On metric ramsey-type phenomena.	STOC	2003	DBLP DOI BibTeX RDF	Dvoretzky theorem, Ramsey theory, finite metric spaces
1	Nathan Linial, Avner Magen, Assaf Naor	Girth and euclidean distortion.	STOC	2002	DBLP DOI BibTeX RDF	EUCLID

Publications of "Assaf Naor" ( http://dblp.L3S.de/Authors/Assaf_Naor )