# Michael J. Fischer

#3,870

Most Influential Person Now

Computer scientist, (1942 - ), Ann Arbor, Michigan, USA

## Michael J. Fischer's AcademicInfluence.com Rankings

Michael J. Fischercomputer-science Degrees

Computer Science

#213

World Rank

#221

Historical Rank

#126

USA Rank

Database

#469

World Rank

#491

Historical Rank

#192

USA Rank

## Download Badge

Computer Science

## Michael J. Fischer's Degrees

- Masters Mathematics Stanford University
- Bachelors Mathematics Stanford University

## Similar Degrees You Can Earn

## Why Is Michael J. Fischer Influential?

(Suggest an Edit or Addition)According to Wikipedia, Michael John Fischer is an American computer scientist who works in the fields of distributed computing, parallel computing, cryptography, algorithms and data structures, and computational complexity.

## Michael J. Fischer's Published Works

### Published Works

- The String-to-String Correction Problem (1974) (3287)
- Impossibility of distributed consensus with one faulty process (1983) (2977)
- Impossibility of distributed consensus with one faulty process (1985) (2387)
- Propositional Dynamic Logic of Regular Programs (1979) (1336)
- Parallel Prefix Computation (1980) (837)
- Computation in networks of passively mobile finite-state sensors (2004) (590)
- A Lower Bound for the Time to Assure Interactive Consistency (1982) (523)
- A robust and verifiable cryptographically secure election scheme (1985) (508)
- STRING-MATCHING AND OTHER PRODUCTS (1974) (462)
- The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) (1983) (408)
- SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC (1974) (404)
- Relations Among Complexity Measures (1979) (378)
- Easy impossibility proofs for distributed consensus problems (1985) (322)
- Grammars with Macro-Like Productions (1968) (225)
- Scalable Bias-Resistant Distributed Randomness (2017) (212)
- Boolean Matrix Multiplication and Transitive Closure (1971) (202)
- Lambda-calculus schemata (1993) (181)
- Separating Nondeterministic Time Complexity Classes (1978) (174)
- Self-stabilizing population protocols (2005) (160)
- Sacrificing serializability to attain high availability of data in an unreliable network (1982) (158)
- Propositional modal logic of programs (1977) (154)
- Economical solutions for the critical section problem in a distributed system (Extended Abstract) (1977) (149)
- An Efficient Algorithm for Byzantine Agreement without Authentication (1982) (135)
- The architecture of the Eden system (1981) (116)
- Resource allocation with immunity to limited process failure (1979) (110)
- On Describing the Behavior and Implementation of Distributed Systems (1979) (108)
- Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents (2006) (105)
- Global States of a Distributed System (1982) (103)
- A time-space tradeoff for sorting on non-oblivious machines (1979) (99)
- Stably Computable Properties of Network Graphs (2005) (91)
- Distributed FIFO allocation of identical resources using small shared space (1985) (85)
- Finding a Majority Among N Votes. (1982) (78)
- Reliable communication over unreliable channels (1994) (72)
- Foundations of Knowledge for Distributed Systems (1986) (72)
- Efficiency of Synchronous Versus Asynchronous Distributed Systems (1983) (63)
- Simple and efficient Byzantine generals algorithm (1982) (62)
- Assigning tasks for efficiency in Hadoop: extended abstract (2010) (61)
- Bounds on secret key exchange using a random deal of cards (1996) (61)
- Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable (1982) (56)
- Some properties of precedence languages (1969) (54)
- Stabilizing Consensus in Mobile Networks (2006) (51)
- Multiparty Secret Key Exchange Using a Random Deal of Cards (1991) (50)
- Efficiency of Equivalence Algorithms (1972) (46)
- The wakeup problem (1990) (43)
- Fast on-line integer multiplication (1973) (42)
- Hauptvortrag: The complexity of negation-limited networks - A brief survey (1975) (42)
- An Application of Game-Theoretic Techniques to Cryptography (1990) (41)
- AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION (1974) (40)
- A simple game for the study of trust in distributed systems (2001) (35)
- Omega(n log n) Lower Bounds on Length of Boolean Formulas (1982) (33)
- Secret Bit Transmission Using a Random Deal of Cards (1990) (32)
- Efficient fault tolerant routings in networks (1984) (28)
- A secure protocol for the oblivious transfer (extended abstract) (1996) (26)
- Two Characterizations of the Context-Sensitive Languages (1969) (26)
- Reasoning about Uncertainty in Fault-tolerant Distributed Systems (1988) (24)
- An efficient protocol for unconditionally secure secret key exchange (1993) (24)
- Efficient Fault-Tolerant Routings in Networks (1987) (23)
- A public randomness service (2011) (23)
- Proceedings of the tenth annual ACM symposium on Theory of computing (1978) (22)
- Appraising two decades of distributed computing theory research (2003) (22)
- Assigning Tasks for Efficiency in Hadoop ∗ (2010) (21)
- A difference in efficiency between synchronous and asynchronous systems (1981) (19)
- Fishspear: a priority queue algorithm (1994) (19)
- Distributed systems of simple interacting agents (2007) (16)
- Limited Random Access Turing Machines (1968) (16)
- Optimal tree layout (Preliminary Version) (1980) (15)
- Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse (1987) (15)
- A time-space tradeoff for sorting and related non-oblivious computations (1979) (14)
- Probabilistic Analysis of a Network Resource Allocation Algorithm (1985) (13)
- A Theoretician's View of Fault Tolerant Distributed Computing (1986) (13)
- Shared data requirements for implementation of mutual exclusion using a test-and-set primitive (1978) (13)
- Secure sealed-bid online auctions using discreet cryptographic proofs (2013) (12)
- The Complexity of Negation-Limited Networks-A Brief Survey t (2005) (12)
- Modes of presentation for on-line help: full screen, split screen and windowed formats (1989) (12)
- Lower bounds on the size of Boolean formulas: Preliminary Report (1975) (11)
- Space-Efficient Asynchronous Consensus Without Shared Memory Initialization (1993) (10)
- Multimodality serial follow-up of thoracic aortic aneurysms (1997) (9)
- Real-time solutions of the origin-crossing problem (1968) (7)
- Storage Requirements for Fair Scheduling (1983) (7)
- Deniable Anonymous Group Authentication (2014) (7)
- Towards understanding the predictability of stock markets from the perspective of computational complexity (2000) (7)
- Private eyes: Secure remote biometric authentication (2015) (6)
- Optimal Placement of Identical Resources in a Distributed Network (1981) (6)
- A Technique for Decomposing Algorithms Which Use a Single Shared Variable (1983) (5)
- Achieving perfect secrecy using correlated random variables (1994) (5)
- Decision Making in the Presence of Noise (1992) (4)
- Stabilization, Safety, and Security of Distributed Systems: 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings (2010) (4)
- Relative Knowledge and Belief (Extended Abstract). (1987) (4)
- Mode modules as representations of domains: preliminary report (1973) (4)
- Sets that don't help (1973) (4)
- Incentives Don't Solve Blockchain's Problems (2019) (3)
- Fishspear: A Priority Queue Algorithm (Extended Abstract) (1984) (3)
- The iteration element (1965) (3)
- Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1982) (3)
- Strong Theft-Proof Privacy-Preserving Biometric Authentication (2012) (2)
- Efficient and Privacy-Preserving Biometric Authentication ∗ (2013) (2)
- Uncertain Knowledge in Distributed Systems. (1988) (2)
- On computing weak transitive closure on O(log N) expected random parallel time (1982) (2)
- Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems (2010) (2)
- Efficient fault-tolerant infrastructure for cloud computing (2013) (2)
- Evolution of distributed computing theory: from concurrency to networks and beyond (2008) (2)
- Dynamic monotone priorities on planar sets (1985) (2)
- On Developing a Theory of Distributed Computing: Summary of Current Research. (1980) (2)
- Optimal Placement of Identical Resources in a Tree (1992) (2)
- Primitive recursion without implicit predecessor (1989) (1)
- A Review of Civil War Tax Legislation and Its Influence on the Current U.S. Income Tax System (2006) (1)
- A LOWER BOUND FOB THE TIME TO ASSUBE INTEBACTIVE CONSiSTENCV (1982) (1)
- On Backtracking Resistance in Pseudorandom Bit Generation ∗ (2012) (1)
- The Wakeup Problem (Extended Abstract) (1990) (0)
- CPSC 467 a : Cryptography and Computer Security (2006) (0)
- Contents Vol. 36, 2012 (2012) (0)
- Zero Knowledge Interactive Proof Systems (0)
- Lecture Notes 18 45 Recapitulation of Lecture 17 45.1 Zero Knowledge Interactive Proof for Graph Isomorphism (0)
- Lecture Notes 8 39 Exponentiation : Speeding up the Computation (2006) (0)
- Societies of randomly interacting finite-state automata (2004) (0)
- Estimating Parameters of Monotone Boolean Functions (Abstract) (1998) (0)
- Lecture Notes 10 23 Analyzing the Success Probability (0)
- CORACT OR GRANT NUMBE() (1990) (0)
- Lecture Notes 24 114 Bit Commitment Using Hash Functions (2008) (0)
- A Report on AMBIT/G. Volume 1 (1971) (0)
- The Colored Ticket Algorithm. (1983) (0)
- Pseudorandom Sequence Generation 1 Distinguishability and Bit Prediction (0)
- Cpsc 467b: Cryptography and Computer Security Handout #2 Problem Set 1 (0)
- Fishspear: A Priority Queue Algorithm1 (EXTENDED (1984) (0)
- Optimal Layout of Edge-weighted Forests (1999) (0)
- New Haven , CT 06520 – 8285 Urn Automata (2006) (0)
- Cpsc 461b: Foundations of Cryptography Notes 22 (rev. 1) Lecture Notes 22 58 Simple Application of Oblivious Transfer 59 Private Circuit Evaluation Using Shares (0)
- Priority Arguments in Complexity Theory (1972) (0)
- Special SIGACT issue (1972) (0)
- Lecture Notes 19 47 a Zero-knowledge Interactive Proof for Graph 3-coloring (0)
- Cpsc 461b: Foundations of Cryptography Notes 21 (rev. 1) Lecture Notes 21 53 the Millionaire's Problem (2009) (0)
- Further Remarks on Bit-Commitment 49 . 1 Prediction Versus Distinguishability (0)
- Optimal Resource Placement in a Distributed System. (Extended Abstract). (1980) (0)
- Cpsc 461b: Foundations of Cryptography Notes 8 (rev. 1) (0)
- CPSC 467 a : Cryptography and Computer Security Notes (2005) (0)
- The Wakeup Problem * • ( DRAFT ) (2014) (0)
- Yale University Department of Computer Science Private Eyes : Secure Remote Biometric Authentication (2015) (0)
- Parallel Algorithms for Shared-memory Machines. a Standard Wasteful Implementation (1996) (0)
- Assigning Tasks for Efficiency in Hadoop [ Extended (2010) (0)
- Assigning Tasks for Efficiency in Hadoop [ Extended (2010) (0)
- Dynamic Monotone Priorities on Planar Sets (Extended Abstract) (1985) (0)
- Irene K. Fischer (1907-2009) (2010) (0)
- Poster : Scalable Bias-Resistant Distributed Randomness (2017) (0)

This paper list is powered by the following services:

## Other Resources About Michael J. Fischer

## What Schools Are Affiliated With Michael J. Fischer?

Michael J. Fischer is affiliated with the following schools: