search
Get Started
search
Michael Fischer - Computer Scientist
zoom_in Click to enlarge

Michael Fischer

description Michael Fischer Overview

Michael J. Fischer is an American computer scientist and professor at Yale University, specializing in distributed computing, cryptography, and theoretical computer science. He is most recognized as the lead author of the 1985 FLP impossibility theorem, which mathematically proved that no asynchronous distributed system can reach consensus in the presence of even a single process failure. This theorem fundamentally influenced the design of fault-tolerant distributed systems and databases.

He is an ACM Fellow.

insights Ranking position

Michael Fischer ranks #50 of 185 in the Computer Scientist ranking, behind Rob Pike, ahead of Dan Boneh.

help Michael Fischer FAQ

What does the FLP impossibility theorem proved by Michael Fischer state?

The FLP theorem, published by Fischer, Lynch, and Paterson in 1985, proves that no asynchronous deterministic consensus protocol can tolerate even a single process crash failure. This result fundamentally shaped the design of distributed systems by showing consensus is impossible without additional assumptions like randomization or partial synchrony.

Who were Michael Fischer's co-authors on the FLP paper?

The FLP impossibility result was co-authored with Nancy Lynch of MIT and Michael Paterson of the University of Warwick. The paper was published in the Journal of the ACM in 1985 and later won the Dijkstra Prize for its foundational impact on distributed computing.

What institution is Michael Fischer affiliated with?

Michael Fischer is a professor of Computer Science at Yale University, where he has worked on distributed computing theory, concurrency, and computational complexity. He received his PhD from MIT.

How does the FLP result impact real-world distributed system design?

The FLP result forced system designers to relax assumptions to achieve consensus in practice, leading to protocols like Paxos (which uses partial synchrony) and randomized consensus algorithms. Systems such as Google's Chubby and Apache ZooKeeper are built on insights derived from working around the FLP impossibility.

Reviews & Comments

Write a Review

rate_review

Be the first to review

Share your thoughts with the community and help others make better decisions.

Save to your list

Save your favorites and follow how their scores change over time.

Save favorites
Get updates
Compare scores

Already have an account? Sign in

Compare Items

See how they stack up against each other

Comparing
VS
Select 1 more item to compare