Joel Friedman

Professor

Office
ICCS
X561
Office Phone #
604-822-0674

Academic Information

A.B., Harvard College (1984); Ph.D., University of California, Berkeley (1987); Assistant Professor, Princeton University (1987-1993); Associate Professor, UBC (1994-2001); Quantitative Analyst, D.E. Shaw & Co. (1998-99); Professor, UBC (2001-);

Interests

My research focuses on graph eigenvalues and expansion and their connections to other fields. These other fields are quite numerous, and include error correcting codes, nonblocking networks, differential geometry, number theory, mathematical physics concerning eigenvalues of random structures, etc.

Selected Publications

Joel Friedman, "A Proof of Alon's Second Eigenvalue Conjecture and Related Problems,'' Memoirs of the American Mathematical Society, 2008, no. 910.

Joel Friedman, "On the Bit Extraction Problem,'' 33rd IEEE Symposium on Foundations of Computer Science, 1992, 314--319.

Paul Feldman, Joel Friedman, and Nicholas Pippenger, "On Non-Blocking Networks,'' SIAM J. Disc. Math., 1 (1988), 185--173.

Joel Friedman, "Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function,'' SIAM Journal on Computing, 15 (1986), 641-654.

Research Interests

algorithms

Research Groups

Algorithms Lab

Latest Courses

2020 Winter

CPSC 531F - Topics in Theory of Computation
CPSC 421 - Introduction to Theory of Computing
CPSC 501 - Theory of Automata, Formal Languages and Computability
CPSC 531F - Topics in Theory of Computation

2019 Winter

CPSC 303 - Numerical Approximation and Discretization
CPSC 421 - Introduction to Theory of Computing
CPSC 501 - Theory of Automata, Formal Languages and Computability

2018 Winter

CPSC 536J - Topics in Algorithms and Complexity

2017 Winter

CPSC 421 - Introduction to Theory of Computing
CPSC 501 - Theory of Automata, Formal Languages and Computability

2015 Winter

CPSC 421 - Introduction to Theory of Computing
CPSC 501 - Theory of Automata, Formal Languages and Computability