default search action
James R. Lee
Person information
- affiliation: University of Washington, Seattle, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j25]Farzam Ebrahimnejad, James R. Lee
:
Non-Existence of Annular Separators in Geometric Graphs. Discret. Comput. Geom. 71(2): 627-645 (2024) - [c49]Arun Jambulapati
Sparsifying Generalized Linear Models. STOC 2024: 1665-1675 - [i27]Marah I Abdin, Sam Ade Jacobs, Ammar Ahmad Awan, Jyoti Aneja, Ahmed Awadallah, Hany Awadalla, Nguyen Bach, Amit Bahree, Arash Bakhtiari, Harkirat S. Behl, Alon Benhaim, Misha Bilenko, Johan Bjorck, Sébastien Bubeck, Martin Cai, Caio César Teodoro Mendes, Weizhu Chen, Vishrav Chaudhary, Parul Chopra, Allie Del Giorno, Gustavo de Rosa, Matthew Dixon, Ronen Eldan, Dan Iter, Amit Garg, Abhishek Goswami, Suriya Gunasekar, Emman Haider, Junheng Hao, Russell J. Hewett, Jamie Huynh, Mojan Javaheripi, Xin Jin, Piero Kauffmann, Nikos Karampatziakis, Dongwoo Kim, Mahoud Khademi, Lev Kurilenko, James R. Lee, Yin Tat Lee, Yuanzhi Li, Chen Liang, Weishung Liu, Eric Lin, Zeqi Lin, Piyush Madan, Arindam Mitra, Hardik Modi, Anh Nguyen, Brandon Norick, Barun Patra, Daniel Perez-Becker, Thomas Portet, Reid Pryzant, Heyang Qin, Marko Radmilac, Corby Rosset, Sambudha Roy, Olatunji Ruwase, Olli Saarikivi, Amin Saied, Adil Salim, Michael Santacroce, Shital Shah, Ning Shang, Hiteshi Sharma, Xia Song, Masahiro Tanaka, Xin Wang, Rachel Ward, Guanhua Wang, Philipp Witte, Michael Wyatt, Can Xu, Jiahang Xu, Sonali Yadav, Fan Yang, Ziyi Yang, Donghan Yu, Chengruidong Zhang, Cyril Zhang, Jianwen Zhang, Li Lyna Zhang, Yi Zhang, Yue Zhang, Yunan Zhang, Xiren Zhou:
Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone. CoRR abs/2404.14219 (2024) - 2023
- [c48]Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford:
Sparsifying Sums of Norms. FOCS 2023: 1953-1962 - [c47]James R. Lee:
Spectral Hypergraph Sparsification via Chaining. STOC 2023: 207-218 - [i26]Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford:
Sparsifying Sums of Norms. CoRR abs/2305.09049 (2023) - [i25]Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford:
Sparsifying generalized linear models. CoRR abs/2311.18145 (2023) - 2022
- [j24]Christian Coester
Pure Entropic Regularization for Metrical Task Systems. Adv. Math. Commun. 18: 1-24 (2022) - [c46]Farzam Ebrahimnejad, James R. Lee:
Multiscale Entropic Regularization for MTS on General Metric Spaces. ITCS 2022: 60:1-60:21 - [i24]James R. Lee:
Spectral hypergraph sparsification via chaining. CoRR abs/2209.04539 (2022) - 2021
- [j23]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee:
Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing. SIAM J. Comput. 50(3): 909-923 (2021) - [e1]James R. Lee:
12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference. LIPIcs 185, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-177-1 [contents] - [i23]Farzam Ebrahimnejad, James R. Lee:
Non-existence of annular separators in geometric graphs. CoRR abs/2107.09790 (2021) - [i22]Farzam Ebrahimnejad, James R. Lee:
Multiscale entropic regularization for MTS on general metric spaces. CoRR abs/2111.10908 (2021) - 2020
- [j22]Fernando G. S. L. Brandão, Aram W. Harrow
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements. IEEE Trans. Inf. Theory 66(8): 5037-5054 (2020)
2010 – 2019
- 2019
- [c45]Christian Coester, James R. Lee:
Pure entropic regularization for metrical task systems. COLT 2019: 835-848 - [c44]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee:
Metrical task systems on trees via mirror descent and unfair gluing. SODA 2019: 89-97 - [c43]Robert Krauthgamer, James R. Lee, Havana Rika
Flow-Cut Gaps and Face Covers in Planar Graphs. SODA 2019: 525-534 - [i21]Christian Coester, James R. Lee:
Pure entropic regularization for metrical task systems. CoRR abs/1906.04270 (2019) - 2018
- [c42]James R. Lee:
Fusible HSTs and the Randomized k-Server Conjecture. FOCS 2018: 438-449 - [c41]Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry:
k-server via multiscale entropic regularization. STOC 2018: 3-16 - [i20]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee:
Metrical task systems on trees via mirror descent and unfair gluing. CoRR abs/1807.04404 (2018) - [i19]Robert Krauthgamer, James R. Lee, Havana Rika:
Flow-Cut Gaps and Face Covers in Planar Graphs. CoRR abs/1811.02685 (2018) - 2017
- [j21]James R. Lee:
Covering the Large Spectrum and Generalized Riesz Products. SIAM J. Discret. Math. 31(1): 562-572 (2017) - [c40]James R. Lee:
Separators in Region Intersection Graphs. ITCS 2017: 1:1-1:8 - [i18]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee, Aleksander Madry:
k-server via multiscale entropic regularization. CoRR abs/1711.01085 (2017) - 2016
- [j20]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer
Approximate Constraint Satisfaction Requires Large LP Relaxations. J. ACM 63(4): 34:1-34:22 (2016) - [r2]James R. Lee:
Graph Bandwidth. Encyclopedia of Algorithms 2016: 866-869 - [i17]James R. Lee:
Separators in region intersection graphs. CoRR abs/1608.01612 (2016) - 2015
- [j19]James R. Lee, Manor Mendel
A node-capacitated Okamura-Seymour theorem. Math. Program. 153(2): 381-415 (2015) - [c39]Ronen Eldan, James R. Lee:
Talagrand's Convolution Conjecture on Gaussian Space. FOCS 2015: 1395-1408 - [c38]James R. Lee, Prasad Raghavendra, David Steurer
Lower Bounds on the Size of Semidefinite Programming Relaxations. STOC 2015: 567-576 - 2014
- [j18]James R. Lee, Shayan Oveis Gharan, Luca Trevisan
Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities. J. ACM 61(6): 37:1-37:30 (2014) - [c37]James R. Lee, Prasad Raghavendra, David Steurer
On the Power of Symmetric LP and SDP Relaxations. CCC 2014: 13-21 - [c36]Fernando G. S. L. Brandão, Aram W. Harrow
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements. ITCS 2014: 183-194 - [i16]James R. Lee, Prasad Raghavendra, David Steurer:
Lower bounds on the size of semidefinite programming relaxations. CoRR abs/1411.6317 (2014) - 2013
- [j17]James R. Lee, Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings. Comb. 33(3): 349-374 (2013) - [j16]James R. Lee, Arnaud de Mesmay, Mohammad Moharrami:
Dimension Reduction for Finite Trees in ℓ 1. Discret. Comput. Geom. 50(4): 977-1032 (2013) - [c35]James R. Lee, Daniel E. Poore:
On the 2-sum embedding conjecture. SoCG 2013: 197-206 - [c34]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer
Approximate Constraint Satisfaction Requires Large LP Relaxations. FOCS 2013: 350-359 - [c33]James R. Lee, Manor Mendel, Mohammad Moharrami:
A node-capacitated okamura-seymour theorem. STOC 2013: 495-504 - [i15]James R. Lee, Mohammad Moharrami:
A lower bound on dimension reduction for trees in \ell_1. CoRR abs/1302.6542 (2013) - [i14]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum Stein's Lemma for restricted measurements. CoRR abs/1308.6702 (2013) - [i13]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. CoRR abs/1309.0563 (2013) - 2012
- [c32]James R. Lee, Arnaud de Mesmay, Mohammad Moharrami:
Dimension reduction for finite trees in l1. SODA 2012: 43-50 - [c31]James R. Lee, Shayan Oveis Gharan, Luca Trevisan
Multi-way spectral partitioning and higher-order cheeger inequalities. STOC 2012: 1117-1130 - [i12]James R. Lee, Manor Mendel, Mohammad Moharrami:
A node-capacitated Okamura-Seymour theorem. CoRR abs/1209.2744 (2012) - 2011
- [j15]Alexander Jaffe, James R. Lee, Mohammad Moharrami:
On the Optimality of Gluing over Scales. Discret. Comput. Geom. 46(2): 270-282 (2011) - [j14]Yael Dekel, James R. Lee, Nathan Linial:
Eigenvectors of random graphs: Nodal Domains. Random Struct. Algorithms 39(1): 39-58 (2011) - [c30]Jian Ding, James R. Lee, Yuval Peres:
Cover times, blanket times, and majorizing measures. STOC 2011: 61-70 - [c29]James R. Lee, Anastasios Sidiropoulos:
Near-optimal distortion bounds for embedding doubling spaces into L1. STOC 2011: 765-772 - [i11]Sanjeev Arora, James R. Lee, Sushant Sachdeva:
A Reformulation of the Arora-Rao-Vazirani Structure Theorem. CoRR abs/1102.1456 (2011) - [i10]James R. Lee, Arnaud de Mesmay, Mohammad Moharrami:
Dimension reduction for finite trees in L_1. CoRR abs/1108.2290 (2011) - [i9]James R. Lee, Shayan Oveis Gharan, Luca Trevisan:
Multi-way spectral partitioning and higher-order Cheeger inequalities. CoRR abs/1111.1055 (2011) - 2010
- [j13]Venkatesan Guruswami, James R. Lee, Alexander A. Razborov:
Almost Euclidean subspaces of l 1N VIA expander codes. Comb. 30(1): 47-68 (2010) - [j12]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010) - [j11]James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. Discret. Comput. Geom. 43(2): 346-362 (2010) - [j10]Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. J. ACM 57(3): 13:1-13:23 (2010) - [j9]James R. Lee, Christopher Umans:
Special Section On Foundations of Computer Science. SIAM J. Comput. 39(6): 2397 (2010) - [c28]James R. Lee, Anastasios Sidiropoulos:
Genus and the Geometry of the Cut Graph. SODA 2010: 193-201 - [c27]James R. Lee, Mohammad Moharrami:
Bilipschitz snowflakes and metrics of negative type. STOC 2010: 621-630 - [i8]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. CoRR abs/1003.1426 (2010) - [i7]Jian Ding, James R. Lee, Yuval Peres:
Cover times, blanket times, and majorizing measures. CoRR abs/1004.4371 (2010) - [i6]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng:
Metric uniformization and spectral bounds for graphs. CoRR abs/1008.3594 (2010)
2000 – 2009
- 2009
- [j8]James R. Lee:
Volume Distortion for Subsets of Euclidean Spaces. Discret. Comput. Geom. 41(4): 590-615 (2009) - [c26]Venkatesan Guruswami, James R. Lee, Avi Wigderson:
Expander codes over reals, Euclidean sections, and compressed sensing. Allerton 2009: 1231-1234 - [c25]Alexander Jaffe, James R. Lee, Mohammad Moharrami:
On the Optimality of Gluing over Scales. APPROX-RANDOM 2009: 190-201 - [c24]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. SCG 2009: 371-376 - [c23]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng:
Higher Eigenvalues of Graphs. FOCS 2009: 735-744 - [c22]James R. Lee, Anastasios Sidiropoulos:
On the geometry of graphs with a forbidden minor. STOC 2009: 245-254 - [i5]James R. Lee, Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings. CoRR abs/0910.1409 (2009) - 2008
- [j7]Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee:
Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008) - [c21]Venkatesan Guruswami, James R. Lee, Avi Wigderson:
Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. APPROX-RANDOM 2008: 444-454 - [c20]Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. FOCS 2008: 751-760 - [c19]Amit Chakrabarti
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. FOCS 2008: 761-770 - [c18]Venkatesan Guruswami, James R. Lee, Alexander A. Razborov:
Almost Euclidean subspaces of lN1 via expander codes. SODA 2008: 353-362 - [r1]James R. Lee:
Graph Bandwidth. Encyclopedia of Algorithms 2008 - [i4]Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. CoRR abs/0808.0148 (2008) - [i3]James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j6]Robert Krauthgamer, James R. Lee:
The intrinsic dimensionality of graphs. Comb. 27(5): 551-585 (2007) - [j5]Sanjeev Arora, James R. Lee, Assaf Naor:
Fréchet Embeddings of Negative Type Metrics. Discret. Comput. Geom. 38(4): 726-739 (2007) - [j4]Uriel Feige, James R. Lee:
An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1): 26-29 (2007) - [c17]James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. APPROX-RANDOM 2007: 228-241 - [c16]Yael Dekel, James R. Lee, Nathan Linial:
Eigenvectors of Random Graphs: Nodal Domains. APPROX-RANDOM 2007: 436-448 - [c15]Bo Brinkman
Vertex cuts, random walks, and dimension reduction in series-parallel graphs. STOC 2007: 621-630 - [i2]Venkatesan Guruswami, James R. Lee, Alexander A. Razborov:
Almost Euclidean subspaces of ℓ1N via expander codes. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c14]James R. Lee:
Volume distortion for subsets of Euclidean spaces: extended abstract. SCG 2006: 207-216 - [c13]James R. Lee, Assaf Naor:
Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. FOCS 2006: 99-108 - [c12]Robert Krauthgamer
Algorithms on negatively curved spaces. FOCS 2006: 119-132 - [c11]James R. Lee, Assaf Naor, Yuval Peres:
Trees and Markov convexity. SODA 2006: 1028-1037 - 2005
- [j3]James R. Lee, Manor Mendel
Metric structures in L1: dimension, snowflakes, and average distortion. Eur. J. Comb. 26(8): 1180-1190 (2005) - [j2]Robert Krauthgamer, James R. Lee:
The black-box complexity of nearest-neighbor search. Theor. Comput. Sci. 348(2-3): 262-276 (2005) - [c10]James R. Lee:
On distance scales, embeddings, and efficient relaxations of the cut cone. SODA 2005: 92-101 - [c9]Sanjeev Arora, James R. Lee, Assaf Naor:
Euclidean distortion and the sparsest cut. STOC 2005: 553-562 - [c8]Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee:
Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572 - 2004
- [j1]Guy Kortsarz, Robert Krauthgamer
Hardness of Approximation for Vertex-Connectivity Network Design Problems. SIAM J. Comput. 33(3): 704-720 (2004) - [c7]Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor:
Measured Descent: A New Embedding Method for Finite Metrics. FOCS 2004: 434-443 - [c6]Robert Krauthgamer
The Black-Box Complexity of Nearest Neighbor Search. ICALP 2004: 858-869 - [c5]James R. Lee, Manor Mendel, Assaf Naor:
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. LATIN 2004: 401-412 - [c4]Robert Krauthgamer, James R. Lee:
Navigating nets: simple algorithms for proximity search. SODA 2004: 798-807 - [i1]Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor:
Measured descent: A new embedding method for finite metrics. CoRR abs/cs/0412008 (2004) - 2003
- [c3]Anupam Gupta, Robert Krauthgamer
Bounded Geometries, Fractals, and Low-Distortion Embeddings. FOCS 2003: 534-543 - [c2]Robert Krauthgamer
The intrinsic dimensionality of graphs. STOC 2003: 438-447 - 2002
- [c1]Guy Kortsarz, Robert Krauthgamer
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. APPROX 2002: 185-199
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: