|
I got my PhD in CS from Berkeley, advised by Christos Papadimitriou.
Research interests: Algorithms, complexity, optimization. High-dimensional geometry.
|
| not a blog: | tcsmath (just some expository articles) |
| Planar multi-flows, L1 embeddings, and differentiation | |
| The pseudorandom subspace problem |
| teaching: | CSE 431 Introduction to the Theory of Computation (Spring '08) |
| funding: | NSF CAREER Award (CCF 0644037) - Geometric phenomena in algorithms and complexity |
| BSF grant 2006052 - On some complexity issues between P and NP | |
| (with Arora, Papadimidtriou, Safra) |
committees: APPROX 2006, FOCS 2007, SODA 2009
local stuff: [focs'07 hits reading group | UGC/SDP reading group | theory seminar]
happiness is a warm theorem.
| old teaching: | CSE 525 Randomized Algorithms & Probabilistic Analysis (Winter'08) |
| CSE 321 Discrete Structures (Autumn'07) | |
| CSE 525 Randomized algorithms and probabilistic analysis (Spring'07) | |
| CSE 599I Geometric embeddings and high-dimensional phenomena (Winter'07) | |
| CSE 321 Discrete Structures (Autumn'06) |
address:
James R. Lee
Department of Computer Science and Engineering
Box 352350
University of Washington
Seattle, WA 98195-2350