Nick Pippenger | |
Field: | Computer science |
Work Institution: | Harvey Mudd College, Princeton University, University of British Columbia |
Alma Mater: | B.S., Shimer College Ph.D., Massachusetts Institute of Technology |
Spouse: | Maria Klawe, 1980 |
Children: | Two children |
Nicholas John Pippenger is a researcher in computer science. He has produced a number of fundamental results many of which are being widely used in the field of theoretical computer science, database processing and compiler optimization. He has also achieved the rank of IBM Fellow at Almaden IBM Research Center in San Jose, California. He has taught at the University of British Columbia in Vancouver, British Columbia, Canada and at Princeton University in the US. In the Fall of 2006 Pippenger joined the faculty of Harvey Mudd College.
Pippenger holds a B.S. in Natural Sciences from Shimer College and a PhD from the Massachusetts Institute of Technology. He is married to Maria Klawe, President of Harvey Mudd College. In 1997 he was inducted as a Fellow of the Association for Computing Machinery.[1] In 2013 he became a fellow of the American Mathematical Society.[2]
The complexity class, Nick's Class (NC), of problems quickly solvable on a parallel computer, was named by Stephen Cook after Nick Pippenger for his research on circuits with polylogarithmic depth and polynomial size.[3] [4]
Pippenger became one of the most recent mathematicians to write a technical article in Latin, when he published a brief derivation of a new formula for e,[5] [6] whereby the Wallis product for is modified by taking roots of its terms:
e | |
2 |
=\left(
2 | |
1 |
\right)1/2\left(
2 | |
3 |
4 | |
3 |
\right)1/4\left(
4 | |
5 |
6 | |
5 |
6 | |
7 |
8 | |
7 |
\right)1/8 … .
. Christos Papadimitriou . 1993 . Computational Complexity . Addison Wesley . 1st . 978-0-201-53082-7 . Section 15.3: The class NC . 375–381.
. Dexter Kozen . 2006 . Theory of Computation . Springer . 978-1-84628-297-3 . Lecture 12: Relation of NC to Time-Space Classes.