| Bounded geometries, fractals, and low-distortion embeddings A Gupta, R Krauthgamer, JR Lee Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE …, 2003 | 514 | 2003 |
| Navigating nets: simple algorithms for proximity search R Krauthgamer, JR Lee Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 435 | 2004 |
| Improved approximation algorithms for minimum weight vertex separators U Feige, MT Hajiaghayi, JR Lee SIAM Journal on Computing 38 (2), 629-657, 2008 | 425 | 2008 |
| Multiway spectral partitioning and higher-order Cheeger inequalities JR Lee, SO Gharan, L Trevisan Journal of the ACM (JACM) 61 (6), 37, 2014 | 413 | 2014 |
| Euclidean distortion and the sparsest cut S Arora, J Lee, A Naor Journal of the American Mathematical Society 21 (1), 1-21, 2008 | 264 | 2008 |
| Lower bounds on the size of semidefinite programming relaxations JR Lee, P Raghavendra, D Steurer arXiv preprint arXiv:1411.6317, 2014 | 204 | 2014 |
| Measured descent: A new embedding method for finite metrics R Krauthgamer, JR Lee, M Mendel, A Naor Geometric and Functional Analysis 15 (4), 839-858, 2005 | 189 | 2005 |
| Extending Lipschitz functions via random metric partitions JR Lee, A Naor Inventiones mathematicae 160 (1), 59-95, 2005 | 178 | 2005 |
| Cover times, blanket times, and majorizing measures J Ding, JR Lee, Y Peres Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 151 | 2011 |
| Hardness of approximation for vertex-connectivity network design problems G Kortsarz, R Krauthgamer, JR Lee SIAM Journal on Computing 33 (3), 704-720, 2004 | 132 | 2004 |
| Embedding the diamond graph in L p and dimension reduction in L 1 JR Lee, A Naor Geometric & Functional Analysis GAFA 14 (4), 745-747, 2004 | 130 | 2004 |
| Algorithms on negatively curved spaces R Krauthgamer, JR Lee Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006 | 127 | 2006 |
| Lp metrics on the Heisenberg group and the Goemans-Linial conjecture JR Lee, A Naor Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006 | 95 | 2006 |
| An improved approximation ratio for the minimum linear arrangement problem U Feige, JR Lee Information Processing Letters 101 (1), 26-29, 2007 | 89 | 2007 |
| Almost Euclidean subspaces of ℓ 1 N VIA expander codes V Guruswami, JR Lee, A Razborov Combinatorica 30 (1), 47-68, 2010 | 83 | 2010 |
| The black-box complexity of nearest-neighbor search R Krauthgamer, JR Lee Theoretical Computer Science 348 (2), 262-276, 2005 | 75 | 2005 |
| Trees and Markov convexity JR Lee, A Naor, Y Peres Geometric and Functional Analysis 18 (5), 1609-1659, 2009 | 74 | 2009 |
| Metric structures in L1: dimension, snowflakes, and average distortion JR Lee, M Mendel, A Naor European Journal of Combinatorics 26 (8), 1180-1190, 2005 | 71 | 2005 |
| The intrinsic dimensionality of graphs R Krauthgamer, JR Lee Combinatorica 27 (5), 551-585, 2007 | 68* | 2007 |
| On distance scales, embeddings, and efficient relaxations of the cut cone JR Lee Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005 | 66 | 2005 |
Robert KrauthgamerWeizmann Institute of Science在 weizmann.ac.il 的电子邮件经过验证
