
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 6: January 28
- Euclidean distortion and the Sparsest Cut Sanjeev Arora # James R. Lee + Assaf Naor #
- Eigenvalue multiplicity and volume growth James R. Lee #
- An improved approximation ratio for the minimum linear arrangement problem
- Hardness of approximation for vertex-connectivity network design problems
- Bounded geometries, fractals, and lowdistortion embeddings Anupam Gupta # Robert Krauthgamer + James R. Lee #
- Coarse differentiation and multi-flows in planar graphs James R. Lee
- Distance scales, embeddings, and metrics of negative type [preliminary draft]
- Embedding the diamond graph in Lp and dimension reduction in L1
- Extending Lipschitz functions via random metric partitions James R. Lee
- Lp metrics on the Heisenberg group and the Goemans-Linial conjecture
- L p metrics on the Heisenberg group and the GoemansLinial conjecture
- Coarse di#erentiation and multiflows in planar graphs James R. Lee # Prasad Raghavendra +
- Eigenvectors of random graphs: Nodal domains Yael Dekel
- Euclidean distortion and the Sparsest Cut Sanjeev Arora
- Metric structures in L1: Dimension, snowflakes, and average distortion
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 4: January 16, 2008
- Euclidean sections of N 1 with sublinear randomness
- Frechet embeddings of negative type metrics Sanjeev Arora
- Bounded geometries, fractals, and low-distortion embeddings Anupam Gupta
- COMBINATORICA4 (4) (1984) 297--306 A TOPOLOGICAL APPROACH TO EVASIVENESS
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 2: January 09
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 5: January 23, 2008
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 9: February 6
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 10: February 13
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 1: January 7
- Vertex Cuts, Random Walks, and Dimension Reduction in Series-Parallel Graphs
- The intrinsic dimensionality of graphs Robert Krauthgamer
- On the Geometry of Graphs with a Forbidden Minor James R. Lee
- The blackbox complexity of nearest neighbor search # Robert Krauthgamer + James R. Lee #
- Improved approximation algorithms for minimumweight vertex separators
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 8: February 4
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 3: January 14
- Almost Euclidean subspaces of N expander codes
- Metric structures in L 1 : Dimension, snowflakes, and average distortion #
- CSE 525 Randomized Algorithms & Probabilistic Analysis Winter 2008 Lecture 10: Feb 11
- The black-box complexity of nearest neighbor search Robert Krauthgamer
- Improved approximation algorithms for minimum-weight vertex separators
- Volume distortion for subsets of Euclidean spaces James R. Lee
- A Primal-Dual Randomized Algorithm for Weighted Paging Nikhil Bansal
- An improved approximation ratio for the minimum linear arrangement problem
- On the Geometry of Graphs with a Forbidden Minor James R. Lee #
- Distance scales, embeddings, and metrics of negative type # [preliminary draft]
- Notes on Gaussian processes and majorizing measures James R. Lee
- Extending Lipschitz functions via random metric partitions James R. Lee #
- Embedding the diamond graph in L p and dimension reduction in L 1
- Volume distortion for subsets of Euclidean spaces James R. Lee #
- CSE 525: Randomized Algorithms & Probabilistic Analysis Ning Lecture #1 Randomized rounding of linear programs and more tail bounds April 17, 2007
- Eigenvalue multiplicity and volume growth James R. Lee
- Frechet embeddings of negative type metrics Sanjeev Arora # James R. Lee + Assaf Naor #
- Almost Euclidean subspaces of # N expander codes #
- Eigenvectors of random graphs: Nodal domains Yael Dekel #
- Spectral Partitioning Works: Planar graphs and nite element meshes
- Eigenvalue bounds, spectral partitioning, and metrical deformations via flows