World's Best Scientists 2026 revealed!
Nicholas Pippenger

Nicholas Pippenger

D-Index & Metrics

Computer Science

D-Index
50
Citations
8507
World Ranking
5682
National Ranking
2582

Mathematics

D-Index
47
Citations
7309
World Ranking
1292
National Ranking
575

Research.com Recognitions

  • 2013 - Fellow of the American Mathematical Society
  • 1997 - ACM Fellow For numerous contributions to the theory of computation, to communication theory and information theory, and to related areas of mathematics.
  • 1996 - Fellow of the Royal Society of Canada Academy of Science
  • 1995 - IEEE Fellow For contributions to the design of switching networks, complexity theory, parallel computing, and reliable computation.

Overview

Nicholas Pippenger is affiliated with Harvey Mudd College in the United States. Their research contributions span several areas closely related to theoretical computer science, communication theory, and information theory.

Throughout their career, they have been recognized with several professional distinctions. These include being named a Fellow of the American Mathematical Society in 2013 and an ACM Fellow in 1997, the latter awarded for numerous contributions to the theory of computation, communication theory, information theory, and related mathematical disciplines.

Further honors include being designated as a Fellow of the Royal Society of Canada in 1996, recognized by the Academy of Science, and an IEEE Fellow in 1995 for work encompassing the design of switching networks, complexity theory, parallel computing, and reliable computation.

Best Publications

  • Extendible hashing—a fast access method for dynamic files

    Unknown

  • Relations Among Complexity Measures

    Nicholas Pippenger;Michael J. Fischer

  • A fast parallel algorithm for routing in permutation networks

    G. F. Lev;L. G. Valiant;N. Pippenger

  • On simultaneous resource bounds

    Nicholas Pippenger

  • Asymptotic behavior of the chromatic index for hypergraphs

    N. Pippenger;J. Spencer

  • Expanding graphs contain all small trees

    J. Friedman;N. Pippenger

  • The computational complexity of knot and link problems

    Joel Hass;Jeffrey C. Lagarias;Nicholas Pippenger

  • On networks of noisy gates

    Nicholas Pippenger

  • Knots in random walks

    N. Pippenger

  • Parallel computation for well-endowed rings and space-bounded probabilistic machines

    A Borodin;S Cook;N Pippenger

  • On determinism versus non-determinism and related problems

    Wolfgang J. Paul;Nicholas Pippenger;Endre Szemeredi;William T. Trotter

  • Finding the Median

    A. Schonhage;M. S. Paterson;N. Pippenger

  • ON THE EVALUATION OF POWERS AND MONOMIALS

    Nicholas Pippenger

  • Reliable computation by formulas in the presence of noise

    N. Pippenger

  • Polynomial Hash Functions Are Reliable (Extended Abstract)

    Martin Dietzfelbinger;Joseph Gil;Yossi Matias;Yossi Matias;Nicholas Pippenger

  • The inequalities of quantum information theory

    N. Pippenger

  • Galois theory for minors of finite functions

    Nicholas Pippenger

  • Bounds on the performance of protocols for a multiple-access broadcast channel

    N. Pippenger

  • On Random Knots

    Yuanan Diao;Nicholas Pippenger;De Witt Sumners

  • Superconcentrators

    Unknown

  • On Simultaneous Resource Bounds (Preliminary Version)

    Nicholas Pippenger

  • On Determinism versus Non-Determinism and Related Problems (Preliminary Version)

    Wolfgang J. Paul;Nicholas Pippenger;Endre Szemerédi;William T. Trotter

Frequent Co-Authors

Wolfgang J. Paul
Wolfgang J. Paul Saarland University
Maria Klawe
Maria Klawe Harvey Mudd College
Jeffrey C. Lagarias
Jeffrey C. Lagarias University of Michigan–Ann Arbor
Cynthia Dwork
Cynthia Dwork Harvard University
David Peleg
David Peleg Weizmann Institute of Science
Yossi Matias
Yossi Matias Google (United States)
Mihalis Yannakakis
Mihalis Yannakakis Columbia University
Eli Upfal
Eli Upfal Brown University
Avi Wigderson
Avi Wigderson Institute for Advanced Study
William T. Trotter
William T. Trotter Georgia Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to a variety of related online degrees that can enhance your career options. For those interested in analyzing large data sets, pursuing a master in data analytics offers specialized skills that are highly sought after across industries.

Many mathematics graduates also consider pivoting into business by exploring MBA options. If you're wondering what MBA programs can I get into, there are several flexible online programs tailored to varying academic backgrounds and career goals.

For professionals seeking convenience, the easiest MBA online programs provide a manageable workload without compromising educational quality. These programs often fit well with a data-driven mindset developed through mathematics studies.

Additionally, for those aiming for leadership roles or advanced research, the cheapest AACSB online DBA programs offer an affordable pathway to a Doctorate in Business Administration, combining mathematical rigor with strategic management expertise.

Best Scientists Citing Nicholas Pippenger

Trending Scientists

Recently Published Articles