| 2011 |
|---|
| 13 | The Grothendieck Constant is Strictly Smaller than Krivine's Bound. Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor. FOCS 2011, 453-462. Web SearchBibTeXDownload |
| 2007 |
|---|
| 12 | Nearest-neighbor-preserving embeddings. Piotr Indyk, Assaf Naor. ACM Transactions on Algorithms (3) (2007). Cited by 26Web SearchBibTeXDownload |
| 11 | On the maximum satisfiability of random formulas. Dimitris Achlioptas, Assaf Naor, Yuval Peres. J. ACM (54) (2007). Web SearchBibTeXDownload |
| 10 | Lower Bounds on Locality Sensitive Hashing. Rajeev Motwani, Assaf Naor, Rina Panigrahy. SIAM J. Discrete Math. (21): 930-935 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 9 | Approximating the Cut-Norm via Grothendieck's Inequality. Noga Alon, Assaf Naor. SIAM J. Comput. (35): 787-803 (2006). Web SearchBibTeXDownload |
| 8 | Lower bounds on locality sensitive hashing. Rajeev Motwani, Assaf Naor, Rina Panigrahy. Symposium on Computational Geometry 2006, 154-157. Cited by 18Web SearchBibTeXDownload |
| 2005 |
|---|
| 7 | Lower bounds on Locality Sensitive Hashing. Rajeev Motwani, Assaf Naor, Rina Panigrahy. CoRR (abs/cs/0510088) (2005). Web SearchBibTeXDownload |
| 6 | Quadratic forms on graphs. Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor. STOC 2005, 486-493. Web SearchBibTeXDownload |
| 2004 |
|---|
| 5 | Measured descent: A new embedding method for finite metrics. Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor. CoRR (abs/cs/0412008) (2004). Web SearchBibTeXDownload |
| 4 | Measured Descent: A New Embedding Method for Finite Metrics. Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor. FOCS 2004, 434-443. Web SearchBibTeXDownload |
| 3 | Approximating the cut-norm via Grothendieck's inequality. Noga Alon, Assaf Naor. STOC 2004, 72-80. Web SearchBibTeXDownload |
| 2 | The two possible values of the chromatic number of a random graph. Dimitris Achlioptas, Assaf Naor. STOC 2004, 587-593. Web SearchBibTeXDownload |
| 2003 |
|---|
| 1 | On the Maximum Satisfiability of Random Formulas. Dimitris Achlioptas, Assaf Naor, Yuval Peres. FOCS 2003, 362-370. Web SearchBibTeXDownload |
