Philip N. Klein

Philip N. Klein
Professor of Computer Science
Brown University
Box 1910
Providence, RI 02912
email: philip@brown.edu or klein@brown.edu

Research Interests

Algorithms
Data Structures
Combinatorial Optimization
Approximation Algorithms
Graphs

planarity.org, a resource page for Optimization Algorithms on Planar Graphs

Teaching

Recipient of the 2007 Philip J. Bray Award for Excellence in Teaching in the Sciences.

Courses originated:

The Matrix in Computer Science

Computer Science: An Integrated Introduction I and II (with Leslie P. Kaelbling)

Design and Analysis of Algorithms

Topics in Advanced Algorithms

Solving Hard Problems in Combinatorial Optimization: Theory and Systems (with Pascal Van Hentenryck )

Secrets and Promises: A Course on Cryptography for Nonmajors

Other Courses Taught:

Introduction to Discrete Structures and Probability

MOOC (massive open online course):

Coding the Matrix: Linear Algebra through Computer Science Applications

Other

     Recipient of the NSF Presidential Young Investigator Award (1991)
     ACM Fellow (2010)
     Radcliffe Fellow (2015-2016)
     Program Chair of ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)
     Creator of Coding the Matrix
     Author of Coding the Matrix: Linear Algebra through Applications to Computer Science
     Author of A Cryptography Primer: Secrets and Promises
     Co-author of Optimization Algorithms for Planar Graphs