World's Best Scientists 2026 revealed!
Michael Sipser

Michael Sipser

Research.com Recognitions

  • 2017 - ACM Fellow For contributions to computational complexity, particularly randomized computation and circuit complexity
  • 2016 - Fellow of the American Mathematical Society For contributions to complexity theory and for leadership and service to the mathematical community.
  • 2009 - Fellow of the American Academy of Arts and Sciences

Overview

Michael Sipser is affiliated with the Massachusetts Institute of Technology (MIT) in the United States. Their academic profile is marked by a strong recognition in the fields of computational complexity and theoretical computer science.

Sipser's professional distinctions include being named an ACM Fellow in 2017, with a citation highlighting contributions to computational complexity, particularly in randomized computation and circuit complexity. In 2016, they were also recognized as a Fellow of the American Mathematical Society for work in complexity theory as well as leadership and service to the mathematical community. Additionally, Sipser became a Fellow of the American Academy of Arts and Sciences in 2009.

The focus areas of Michael Sipser's research encompass computational complexity and related subfields, centering on the mathematical and theoretical foundations of computer science.

Best Publications

  • Parity, circuits and the polynomial time hierarchy

    Merrick L. Furst;James B. Saxe;Michael Sipser

  • Quantum Computation by Adiabatic Evolution

    Edward Farhi;Jeffrey Goldstone;Sam Gutmann;Michael Sipser

  • Expander codes

    M. Sipser;D.A. Spielman

  • Private coins versus public coins in interactive proof systems

    S Goldwasser;M Sipser

  • A complexity theoretic approach to randomness

    Michael Sipser

  • The complexity of finite functions

    Ravi B. Boppana;Michael Sipser

  • On the power of multi-prover interactive protocols

    Lance Fortnow;John Rompel;Michael Sipser

  • Borel sets and circuit complexity

    Michael Sipser

  • Maximum Matchings in Sparse Random Graphs

    Richard M. Karp;Michael Sipser

  • Nondeterminism and the size of two way finite automata

    William J. Sakoda;Michael Sipser

  • GO Is Polynomial-Space Hard

    David Lichtenstein;Michael Sipser

  • On the power of multi-power interactive protocols

    L. Fortnow;J. Rompel;M. Sipser

  • Limit on the Speed of Quantum Computation in Determining Parity

    Edward Farhi;Jeffrey Goldstone;Sam Gutmann;Michael Sipser

  • Communication complexity

    Christos H. Papadimitriou;Michael Sipser

  • Expanders, randomness, or time versus space

    Michael Sipser;Michael Sipser

  • The history and status of the P versus NP question

    Michael Sipser

  • Halting space-bounded computations

    Michael Sipser

  • Lower bounds on the size of sweeping automata

    Michael Sipser

  • Compression and ranking

    Andrew V. Goldberg;Michael Sipser

  • Errata for On the Power of Multi-Prover Interactive Protocols.

    Lance Fortnow;John Rompel;Michael Sipser

Frequent Co-Authors

Lance Fortnow
Lance Fortnow Illinois Institute of Technology
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Baruch Awerbuch
Baruch Awerbuch Johns Hopkins University
Yishay Mansour
Yishay Mansour Tel Aviv University
Ming-Yang Kao
Ming-Yang Kao Northwestern University
Shafi Goldwasser
Shafi Goldwasser University of California, Berkeley
Richard M. Karp
Richard M. Karp University of California, Berkeley
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Daniel A. Spielman
Daniel A. Spielman Yale University

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 various related online degrees that enhance both analytical and business skills. For those interested in leveraging their mathematical background in tech and business, pursuing a data analytics masters is a strategic choice. This degree equips students with essential skills in interpreting complex data sets and making data-driven decisions.

If you are considering business leadership roles, exploring the easiest MBA program options can provide accessible pathways to earn graduate business credentials quickly. Many institutions now offer flexible and streamlined programs tailored for professionals balancing work and study commitments.

For those looking for more convenience, the easiest online MBA programs combine flexibility with quality education, making them a popular choice for mathematicians seeking to broaden their expertise without relocating or sacrificing their current careers.

At the executive level, a 1 year DBA program online offers an advanced Doctorate in Business Administration for professionals aiming to specialize in research, leadership, and strategic decision-making. Such programs are ideal for mathematicians seeking to transition into higher management and academia.

Best Scientists Citing Michael Sipser

Recently Published Articles