James R. Lee

Citace

	Všechny	Od 2017
Citace	5054	1654
h-index	30	19
i10-index	87	33

340

170

255

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220 15 26 32 77 135 186 182 207 267 302 262 261 324 319 271 287 309 329 259 280 318 157

Veřejný přístup

Zobrazit všechny

1 článek

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Robert KrauthgamerWeizmann Institute of ScienceE-mailová adresa ověřena na: weizmann.ac.il
Manor MendelDepartment of Mathematics and Computer Science, The Open University of IsraelE-mailová adresa ověřena na: openu.ac.il
Sanjeev AroraProfessor of Computer Science, Princeton UniversityE-mailová adresa ověřena na: cs.princeton.edu
Venkatesan GuruswamiUniversity of California, BerkeleyE-mailová adresa ověřena na: berkeley.edu
Guy KortsarzProfessor computer scienceE-mailová adresa ověřena na: camden.rutgers.edu
Jian DingPeking UniversityE-mailová adresa ověřena na: math.pku.edu.cn
Shayan Oveis GharanAssociate Professor, University of WashingtonE-mailová adresa ověřena na: cs.washington.edu
Luca TrevisanBocconi UniversityE-mailová adresa ověřena na: unibocconi.it
David SteurerETH ZürichE-mailová adresa ověřena na: inf.ethz.ch
Nati LinialProfessor of Computer Science, The Hebrew University of JerusalemE-mailová adresa ověřena na: cs.huji.ac.il
Glencora BorradaileAssistant Professor of Computer Science, Oregon State UniversityE-mailová adresa ověřena na: onid.oregonstate.edu
Prasad RaghavendraAssistant Professor, University of California Berkeley
Sebastien BubeckSr Principal Research Manager, ML Foundations group, Microsoft ResearchE-mailová adresa ověřena na: microsoft.com
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonE-mailová adresa ověřena na: uw.edu
Aleksander MądryMITE-mailová adresa ověřena na: mit.edu
Ronen EldanWeizmann InstituteE-mailová adresa ověřena na: weizmann.ac.il

Sledovat

James R. Lee

Professor of Computer Science, University of Washington

E-mailová adresa ověřena na: cs.washington.edu - Domovská stránka

Theoretical Computer Science


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Bounded geometries, fractals, and low-distortion embeddings A Gupta, R Krauthgamer, JR Lee Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE …, 2003	457	2003
Navigating nets: simple algorithms for proximity search R Krauthgamer, JR Lee Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004	391	2004
Improved approximation algorithms for minimum weight vertex separators U Feige, MT Hajiaghayi, JR Lee SIAM Journal on Computing 38 (2), 629-657, 2008	377	2008
Multiway spectral partitioning and higher-order Cheeger inequalities JR Lee, SO Gharan, L Trevisan Journal of the ACM (JACM) 61 (6), 37, 2014	315	2014
Euclidean distortion and the sparsest cut S Arora, J Lee, A Naor Journal of the American Mathematical Society 21 (1), 1-21, 2008	246	2008
Lower bounds on the size of semidefinite programming relaxations JR Lee, P Raghavendra, D Steurer arXiv preprint arXiv:1411.6317, 2014	176	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	173	2005
Extending Lipschitz functions via random metric partitions JR Lee, A Naor Inventiones mathematicae 160 (1), 59-95, 2005	163	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	143	2011
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	123	2004
Hardness of approximation for vertex-connectivity network design problems G Kortsarz, R Krauthgamer, JR Lee SIAM Journal on Computing 33 (3), 704-720, 2004	119	2004
Algorithms on negatively curved spaces R Krauthgamer, JR Lee Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006	116	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	85	2006
An improved approximation ratio for the minimum linear arrangement problem U Feige, JR Lee Information Processing Letters 101 (1), 26-29, 2007	81	2007
Almost Euclidean subspaces of ℓ 1 N VIA expander codes V Guruswami, JR Lee, A Razborov Combinatorica 30 (1), 47-68, 2010	72	2010
The black-box complexity of nearest-neighbor search R Krauthgamer, JR Lee Theoretical Computer Science 348 (2), 262-276, 2005	70	2005
Trees and Markov convexity JR Lee, A Naor, Y Peres Geometric and Functional Analysis 18 (5), 1609-1659, 2009	69	2009
On distance scales, embeddings, and efficient relaxations of the cut cone JR Lee Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	64	2005
Metric structures in L1: dimension, snowflakes, and average distortion JR Lee, M Mendel, A Naor European Journal of Combinatorics 26 (8), 1180-1190, 2005	63	2005
The intrinsic dimensionality of graphs R Krauthgamer, JR Lee Combinatorica 27 (5), 551-585, 2007	59	2007

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledování aktivity tohoto autora

Citace

Spoluautoři