James R. Lee spends much of his time researching Combinatorics, Discrete mathematics, Embedding, Metric space and Distortion. His Combinatorics research is multidisciplinary, relying on both Semidefinite programming and Hilbert space. His Embedding study which covers Planar graph that intersects with Time complexity and Tree decomposition.
His Metric space research integrates issues from Bounded function and Metric. He has researched Bounded function in several fields, including Fractal and Equivalence of metrics. His Distortion study deals with Euclidean space intersecting with Euclidean geometry and Log-log plot.
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Embedding, Planar graph and Upper and lower bounds. He interconnects Distortion and Metric space in the investigation of issues within Combinatorics. His Distortion study combines topics from a wide range of disciplines, such as Euclidean distance, Euclidean space and Dimensionality reduction.
His Metric space research is multidisciplinary, incorporating elements of Metric, Banach space, Hilbert space, Space and Randomized algorithm. His studies in Discrete mathematics integrate themes in fields like Approximation algorithm and Dimension. His work carried out in the field of Planar graph brings together such families of science as Flow, Book embedding, Degree, Bounded function and Vertex.
His primary areas of investigation include Combinatorics, Embedding, Randomized algorithm, Metric space and Planar graph. His study in the field of Random graph and Conjecture is also linked to topics like Random walk, Probability distribution and Omega. Within one scientific family, James R. Lee focuses on topics pertaining to Regularization under Embedding, and may sometimes address concerns connected to Applied mathematics.
His Randomized algorithm study is focused on Discrete mathematics in general. His Discrete mathematics study frequently links to other fields, such as Abelian group. His Planar graph research is multidisciplinary, incorporating perspectives in Square, Bounded function, Unimodular matrix and Vertex.
The scientist’s investigation covers issues in Combinatorics, Planar graph, Embedding, Randomized algorithm and Metric space. His biological study spans a wide range of topics, including Bounded function, Unimodular matrix and Vertex. His Embedding research includes themes of Binary logarithm, Log-log plot, Special case and Tree.
His research integrates issues of Regularization and Competitive analysis in his study of Randomized algorithm. His work focuses on many connections between Competitive analysis and other disciplines, such as Distribution, that overlap with his field of interest in Discrete mathematics. His Discrete mathematics research includes elements of Dimension and Degree.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Bounded geometries, fractals, and low-distortion embeddings
A. Gupta;R. Krauthgamer;J.R. Lee.
foundations of computer science (2003)
Navigating nets: simple algorithms for proximity search
Robert Krauthgamer;James R. Lee.
symposium on discrete algorithms (2004)
Improved Approximation Algorithms for Minimum Weight Vertex Separators
Uriel Feige;MohammadTaghi Hajiaghayi;James R. Lee.
SIAM Journal on Computing (2008)
Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities
James R. Lee;Shayan Oveis Gharan;Luca Trevisan.
Journal of the ACM (2014)
Euclidean distortion and the sparsest cut
Sanjeev Arora;James R. Lee;Assaf Naor.
Journal of the American Mathematical Society (2007)
Extending Lipschitz functions via random metric partitions
James R. Lee;Assaf Naor.
Inventiones Mathematicae (2005)
Lower Bounds on the Size of Semidefinite Programming Relaxations
James R. Lee;Prasad Raghavendra;David Steurer.
symposium on the theory of computing (2015)
Multi-way spectral partitioning and higher-order cheeger inequalities
James R. Lee;Shayan Oveis Gharan;Luca Trevisan.
symposium on the theory of computing (2012)
Embedding the diamond graph in L p and dimension reduction in L 1
James R. Lee;Assaf Naor.
Geometric and Functional Analysis (2004)
Hardness of Approximation for Vertex-Connectivity Network Design Problems
Guy Kortsarz;Robert Krauthgamer;James R. Lee.
SIAM Journal on Computing (2004)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Princeton University
Weizmann Institute of Science
Carnegie Mellon University
Hebrew University of Jerusalem
Princeton University
University of Chicago
Microsoft (United States)
Bocconi University
University of Southern California
University of California, Berkeley
University of Oxford
University of North Carolina at Charlotte
City University of Hong Kong
Nokia (United States)
Kyoto University
Institut Pasteur
Chinese University of Hong Kong
University of California, Los Angeles
Agency for Science, Technology and Research
Ohio University - Lancaster
Government of Canada
Max Planck Society
University of Western Ontario
University of Alabama at Birmingham
Iowa State University
University of Toronto