| 词条 | Nick Pippenger |
| 释义 |
| name = Nick Pippenger | image = | caption = | birth_date = | birth_place = | 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]{{Primary source inline|date=February 2018}} References1. ^{{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}} 2. ^List of Fellows of the American Mathematical Society, retrieved 2013-05-05. 3. ^{{cite book|authorlink = Christos Papadimitriou |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}} 4. ^{{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}} 5. ^{{cite journal |last=Pippinger |first=Nicholas |year=1976 |title=Formula nova pro numero cujus logarithmus hyperbolicus unitas est |journal=IBM Research Report RC 6217}} External links
9 : Harvey Mudd College faculty|IBM Fellows|Fellows of the Association for Computing Machinery|Fellows of the American Mathematical Society|Theoretical computer scientists|American computer scientists|Living people|Shimer College alumni|Year of birth missing (living people) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。