Biography:Nick Pippenger: Difference between revisions

From HandWiki
(over-write)
 
(url)
 
Line 1: Line 1:
{{short description|Computer scientist}}
{{Infobox scientist
{{Infobox scientist
| name        = Nick Pippenger
| name        = Nick Pippenger
Line 13: Line 12:
}}
}}


'''Nicholas John Pippenger''' is a researcher in [[Computer science|computer science]]. He has produced a number of fundamental results many of which are being widely used in the field of [[Theoretical computer science|theoretical computer science]], [[Database|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 {{wipe|Vancouver}}, British Columbia, Canada and at [[Organization:Princeton University|Princeton University]] in the US. In the Fall of 2006 Pippenger joined the faculty of [[Organization:Harvey Mudd College|Harvey Mudd College]].
'''Nicholas John Pippenger''' is a researcher in [[Computer science|computer science]]. He has produced a number of fundamental results many of which are being widely used in the field of [[Theoretical computer science|theoretical computer science]], [[Database|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 [[Organization:Princeton University|Princeton University]] in the US. In the Fall of 2006 Pippenger joined the faculty of [[Organization:Harvey Mudd College|Harvey Mudd College]].


Pippenger holds a B.S. in Natural Sciences from Shimer College and a PhD from the [[Organization:Massachusetts Institute of Technology|Massachusetts Institute of Technology]]. He is married to [[Biography:Maria Klawe|Maria Klawe]], President of [[Organization:Harvey Mudd College|Harvey Mudd College]]. In 1997 he was inducted as a Fellow of the Association for Computing Machinery.<ref>{{cite web|url=http://fellows.acm.org/fellow_citation.cfm?id=1421585&srt=all|title=ACM: Fellow Awards / Nicholas Pippenger|work=ACM Fellows|publisher=Association for Computing Machinery|accessdate=2010-01-24}}</ref> In 2013 he became a fellow of the American Mathematical Society.<ref>[https://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society], retrieved 2013-05-05.</ref>
Pippenger holds a B.S. in Natural Sciences from Shimer College and a PhD from the [[Organization:Massachusetts Institute of Technology|Massachusetts Institute of Technology]]. He is married to [[Biography:Maria Klawe|Maria Klawe]], former President of [[Organization:Harvey Mudd College|Harvey Mudd College]]. In 1997 he was inducted as a Fellow of the Association for Computing Machinery.<ref>{{cite web|url=http://fellows.acm.org/fellow_citation.cfm?id=1421585&srt=all|title=ACM: Fellow Awards / Nicholas Pippenger|work=ACM Fellows|publisher=Association for Computing Machinery|accessdate=2010-01-24|archive-date=2012-03-01|archive-url=https://web.archive.org/web/20120301054501/http://fellows.acm.org/fellow_citation.cfm?id=1421585&srt=all|url-status=live}}</ref> In 2013 he became a fellow of the American Mathematical Society.<ref>[https://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society] {{Webarchive|url=https://archive.today/20121205081942/http://www.ams.org/profession/fellows-list |date=2012-12-05 }}, retrieved 2013-05-05.</ref>


The complexity class, [[NC (complexity)|Nick's Class]] (NC), of problems quickly solvable on a parallel computer, was named by [[Biography:Stephen Cook|Stephen Cook]] after Nick Pippenger for his research on circuits with polylogarithmic depth and polynomial size.<ref>{{cite book|first=Christos |last=Papadimitriou | year = 1993 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st | isbn = 978-0-201-53082-7 |chapter=Section 15.3: The class '''NC''' |pages=375–381}}</ref><ref>{{cite book|authorlink =Dexter Kozen |first=Dexter |last=Kozen | year = 2006 | title = Theory of Computation | publisher = Springer | isbn = 978-1-84628-297-3 |chapter=Lecture 12: Relation of ''NC'' to Time-Space Classes}}</ref>
The complexity class, [[NC (complexity)|Nick's Class]] (NC), of problems quickly solvable on a parallel computer, was named by [[Biography:Stephen Cook|Stephen Cook]] after Nick Pippenger for his research on circuits with polylogarithmic depth and polynomial size.<ref>{{cite book|first=Christos |last=Papadimitriou | year = 1993 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st | isbn = 978-0-201-53082-7 |chapter=Section 15.3: The class '''NC''' |pages=375–381}}</ref><ref>{{cite book|authorlink =Dexter Kozen |first=Dexter |last=Kozen | year = 2006 | title = Theory of Computation | publisher = Springer | isbn = 978-1-84628-297-3 |chapter=Lecture 12: Relation of ''NC'' to Time-Space Classes}}</ref>


Pippenger became one of the most recent mathematicians to write a technical article in [[Social:Latin|Latin]], when he published a brief derivation of a new formula for ''[[E (mathematical constant)|e]]'',<ref name="Latin-e">{{cite journal |last=Pippinger |first=Nicholas |year=1976 |title=Formula nova pro numero cujus logarithmus hyperbolicus unitas est |journal=IBM Research Report RC 6217}}</ref><ref>{{cite web|url=https://books.google.com/books?id=th8UrgEACAAJ|title=Formula Nova Pro Numero Cujus Logarithmus Hyperbolicus Unitas Est - N. Pippenger - Google Books|accessdate=2020-06-19|last1=Pippenger|first1=N.|year=1976}}</ref>{{Primary source inline|date=February 2018}} whereby the [[Wallis product|Wallis product for {{pi}}]] is modified by taking roots of its terms:  
Pippenger became one of the most recent mathematicians to write a technical article in [[Social:Latin|Latin]], when he published a brief derivation of a new formula for ''[[E (mathematical constant)|e]]'',<ref name="Latin-e">{{cite journal |last=Pippinger |first=Nicholas |year=1976 |title=Formula nova pro numero cujus logarithmus hyperbolicus unitas est |journal=IBM Research Report RC 6217}}</ref><ref>{{cite web|url=https://books.google.com/books?id=th8UrgEACAAJ|title=Formula Nova Pro Numero Cujus Logarithmus Hyperbolicus Unitas Est - N. Pippenger - Google Books|accessdate=2020-06-19|last1=Pippenger|first1=N.|year=1976}}</ref>{{Primary source inline|date=February 2018}} whereby the [[Wallis product|Wallis product for {{pi}}]] is modified by taking roots of its terms:


:<math>\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.</math>
:<math>\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.</math>

Latest revision as of 20:39, 19 July 2025

Nick Pippenger
Alma materB.S., Shimer College
Ph.D., Massachusetts Institute of Technology
Spouse(s)Maria Klawe, 1980
ChildrenTwo children
Scientific career
FieldsComputer science
InstitutionsHarvey Mudd College,
Princeton University,
University of British Columbia

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, 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:

[math]\displaystyle{ \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. }[/math]

References

  1. ↑ "ACM: Fellow Awards / Nicholas Pippenger". ACM Fellows. Association for Computing Machinery. http://fellows.acm.org/fellow_citation.cfm?id=1421585&srt=all. 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 978-0-201-53082-7. 
  4. ↑ Kozen, Dexter (2006). "Lecture 12: Relation of NC to Time-Space Classes". Theory of Computation. Springer. ISBN 978-1-84628-297-3. 
  5. ↑ Pippinger, Nicholas (1976). "Formula nova pro numero cujus logarithmus hyperbolicus unitas est". IBM Research Report RC 6217. 
  6. ↑ Pippenger, N. (1976). "Formula Nova Pro Numero Cujus Logarithmus Hyperbolicus Unitas Est - N. Pippenger - Google Books". https://books.google.com/books?id=th8UrgEACAAJ. Retrieved 2020-06-19. 

External links




Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:Nick_Pippenger&oldid=3741414"