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.
Nick Pippenger | |
|---|---|
| Alma mater | B.S., Shimer College Ph.D., Massachusetts Institute of Technology |
| Spouse(s) | Maria Klawe, 1980 |
| Children | Two children |
| Scientific career | |
| Fields | Computer science |
| Institutions | Harvey Mudd College, Princeton University, University of British Columbia |
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, former 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][non-primary source needed] whereby the Wallis product for π is modified by taking roots of its terms:
References
edit- ^ "ACM: Fellow Awards / Nicholas Pippenger". ACM Fellows. Association for Computing Machinery. Archived from the original on 2012-03-01. Retrieved 2010-01-24.
- ^ List of Fellows of the American Mathematical Society Archived 2012-12-05 at archive.today, retrieved 2013-05-05.
- ^ Papadimitriou, Christos (1993). "Section 15.3: The class NC". Computational Complexity (1st ed.). Addison Wesley. pp. 375–381. ISBN 978-0-201-53082-7.
- ^ Kozen, Dexter (2006). "Lecture 12: Relation of NC to Time-Space Classes". Theory of Computation. Springer. ISBN 978-1-84628-297-3.
- ^ Pippinger, Nicholas (1976). "Formula nova pro numero cujus logarithmus hyperbolicus unitas est". IBM Research Report RC 6217.
- ^ Pippenger, N. (1976). "Formula Nova Pro Numero Cujus Logarithmus Hyperbolicus Unitas Est - N. Pippenger - Google Books". Retrieved 2020-06-19.
External links
edit- Pippenger's web page at HMC