Nick Pippenger

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. In 2013 he became a fellow of the American Mathematical Society.

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.

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'', whereby the Wallis product for is modified by taking roots of its terms:

:\frac{e}{2} = \left(\frac{2}{1}\right)^{1/2} \left(\frac{2}{3}\frac{4}{3}\right)^{1/4} \left(\frac{4}{5}\frac{6}{5}\frac{6}{7}\frac{8}{7}\right)^{1/8} \cdots. Provided by Wikipedia
Showing 1 - 3 results of 3 for search 'Pippenger, Nicholas', query time: 0.02s Refine Results
  1. 1
  2. 2

    On a lower bound for the redundancy of reliable networks with noisy gates

    Published 2003
    Other Authors: “…Pippenger, Nicholas.…”
    Get full text
  3. 3

    The complexity theory of switching networks.

    Published 2004
    Other Authors: “…Pippenger, Nicholas.…”
    Get full text