All Posts

Last update on .

2010-1214.Philip.png

The Association for Computing Machinery (ACM) recently elevated Philip Klein to Fellow for his work in graph and network algorithms.

Philip, who joined the department in 1989, focuses on algorithms, especially for optimization and for graphs. He is the recipient of the 2007 Philip J. Bray Award for Excellence in Teaching in the Sciences. He created six courses for the department: 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) and Secrets and Promises: A Course on Cryptography for Non-Majors.)

Philip received his Ph.D. and S.M. in Computer Science from Massachusetts Institute of Technology and his A.B., summa cum laude in Applied Mathematics, from Harvard College. He has worked with several startup companies, served as a consultant for NEC Research Institute and Xerox Palo Alto Research Center and was a visiting scholar/scientist at MIT and Princeton. He was also a post-doctoral fellow at Harvard University.

The ACM Fellows Program was established in 1993 to recognize and honor outstanding ACM members for their achievements in computer science and information technology and for their significant contributions to the mission of the ACM. The ACM Fellows serve as distinguished colleagues to whom the ACM and its members look for guidance and leadership as the world of information technology evolves.

Philip joins the department’s eight other ACM Fellows: Tom Dean, Maurice Herlihy, Franco Preparata, John Savage, Eli Upfal, Andy van Dam, Peter Wegner and Stan Zdonik.