Philip Klein is interested in the design of algorithms and algorithmic techniques, especially algorithms for combinatorial optimization (finding the best solution among a vast but finite set) and for analyzing networks (graphs).
Professor Klein received an undergraduate degree in Applied Mathematics from Harvard and a doctoral degree in Computer Science from MIT. He was a postdoctoral fellow at Harvard before coming to Brown. He recently worked in the software industry for two years while on leave from Brown.
On The Web:
Are you Philip Klein? Click here to edit your research profile.