Nick Pippenger

From Wikipedia, the free encyclopedia
  (Redirected from Nicholas Pippenger)
Jump to: navigation, search
Nick Pippenger
Fields Computer science
Institutions 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, 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 2012 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]

References[edit]

  1. ^ "ACM: Fellow Awards / Nicholas Pippenger". ACM Fellows. Association for Computing Machinery. Retrieved 2010-01-24. 
  2. ^ List of Fellows of the American Mathematical Society, retrieved 2013-05-05.
  3. ^ Papadimitriou, Christos (1993). "Section 15.3: The class NC". Computational Complexity (1st ed.). Addison Wesley. pp. 375–381. ISBN 0-201-53082-1. 
  4. ^ Kozen, Dexter (2006). "Lecture 12: Relation of NC to Time-Space Classes". Theory of Computation. Springer. ISBN 1-84628-297-7. 
  5. ^ Pippinger, Nicholas (1976). "Formula nova pro numero cujus logarithmus hyperbolicus unitas est". IBM Research Report RC 6217. 

External links[edit]