Photo by Tony RinaldoPhoto by Tony Rinaldo
Philip N.Klein
Perrin Moorhead Grayson and Bruns Grayson Fellow
Brown University
Computer Science
Applying Planarity-Exploiting Algorithms to Spatial Problems in Computational Social Science

Philip N. Klein is a professor of computer science at Brown University. His research area is the design and analysis of algorithms, especially algorithms for problems in graphs (abstract networks).

Klein’s research has focused on algorithms for graphs that can be drawn on the plane. Such graphs arise, for example, in modeling geographic phenomena. Algorithms can take advantage of this structure to more quickly compute answers or to compute more accurate answers. Klein seeks to apply algorithms to computational problems of a spatial or geographical nature, especially problems arising in the study of cities.

Klein graduated summa cum laude from Harvard University, received his PhD from the Massachusetts Institute of Technology, and was a postdoctoral fellow at Harvard. He is a recipient of the Presidential Young Investigator Award and of Brown’s Philip J. Bray Award for teaching excellence in the physical sciences. Klein is also a fellow of the Association for Computing Machinery.


2015–2016 Radcliffe Institute Fellows

This information is accurate as of the fellowship year indicated for each fellow.
Photo by Tony Rinaldo