| 2021 | SSS | Privacy-Preserving Data Sharing for Medical Research. | Michael J. Fischer, Jonathan E. Hochman, Daniel Boffa |
| 2017 | SP | Scalable Bias-Resistant Distributed Randomness. | Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford |
| 2015 | SECRYPT | Private Eyes: Secure Remote Biometric Authentication. | Ewa Syta, Michael J. Fischer, David Wolinsky, Abraham Silberschatz, Gina Gallegos-Garca, Bryan Ford |
| 2011 | SECRYPT | A Public Randomness Service. | Michael J. Fischer, Michaela Iorga, Ren Peralta |
| 2010 | SPAA | Assigning tasks for efficiency in Hadoop: extended abstract. | Michael J. Fischer, Xueyuan Su, Yitong Yin |
| 2008 | PODC | Evolution of distributed computing theory: from concurrency to networks and beyond. | Michael J. Fischer |
| 2006 | DCOSS | Stabilizing Consensus in Mobile Networks. | Dana Angluin, Michael J. Fischer, Hong Jiang |
| 2006 | OPODIS | Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. | Michael J. Fischer, Hong Jiang |
| 2005 | DCOSS | Stably Computable Properties of Network Graphs. | Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, Ren Peralta |
| 2005 | OPODIS | Self-stabilizing Population Protocols. | Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang |
| 2004 | PODC | Computation in networks of passively mobile finite-state sensors. | Dana Angluin, James Aspnes, Zo Diamadi, Michael J. Fischer, Ren Peralta |
| 2001 | SODA | Towards understanding the predictability of stock markets from the perspective of computational complexity. | James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar |
| 1998 | COCOON | Estimating Parameters of Monotone Boolean Functions (Abstract). | Michael J. Fischer |
| 1993 | SODA | An Efficient Protocol for Unconditionally Secure Secret Key Exchange. | Michael J. Fischer, Rebecca N. Wright |
| 1991 | CRYPTO | Multiparty Secret Key Exchange Using a Random Deal of Cards. | Michael J. Fischer, Rebecca N. Wright |
| 1990 | STOC | The Wakeup Problem (Extended Abstract) | Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld |
| 1986 | TARK | Foundations of Knowledge for Distributed Systems. | Michael J. Fischer, Neil Immerman |
| 1985 | FOCS | A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract) | Josh D. Cohen, Michael J. Fischer |
| 1985 | FOCS | Dynamic Monotone Priorities on Planar Sets (Extended Abstract) | Michael J. Fischer, Mike Paterson |
| 1985 | PODC | Easy Impossibility Proofs for Distributed Consensus Problems. | Michael J. Fischer, Nancy A. Lynch, Michael Merritt |
| 1984 | FOCS | Fishspear: A Priority Queue Algorithm (Extended Abstract) | Michael J. Fischer, Mike Paterson |
| 1984 | STOC | Efficient Fault Tolerant Routings in Networks | Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons |
| 1983 | FCT | The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). | Michael J. Fischer |
| 1983 | PODS | Impossibility of Distributed Consensus with One Faulty Process. | Michael J. Fischer, Nancy A. Lynch, Mike Paterson |
| 1982 | ICPP | On computing weak transitive closure on O(log N) expected random parallel time. | Albert G. Greenberg, Michael J. Fischer |
| 1982 | PODS | Sacrificing Serializability to Attain High Availability of Data. | Michael J. Fischer, Alan Michael |
| 1981 | ICDCS | Optimal Placement of Identical Resources in a Distributed Network. | Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch |
| 1981 | STOC | A Difference in Efficiency between Synchronous and Asynchronous Systems | Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch |
| 1981 | SOSP | The Architecture of the Eden System. | Edward D. Lazowska, Henry M. Levy, Guy T. Almes, Michael J. Fischer, Robert J. Fowler, Stephen C. Vestal |
| 1980 | STOC | Optimal Tree Layout (Preliminary Version) | Michael J. Fischer, Mike Paterson |
| 1979 | FOCS | A Time-Space Tradeoff for Sorting on Non-Oblivious Machines | Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa |
| 1979 | FOCS | Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) | Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin |
| 1977 | STOC | Propositional Modal Logic of Programs (Extended Abstract) | Michael J. Fischer, Richard E. Ladner |
| 1977 | STOC | Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) | Gary L. Peterson, Michael J. Fischer |
| 1976 | ICALP | A Note on the Average Time to Compute Transitive Closures. | Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer |
| 1975 | STOC | Lower Bounds on the Size of Boolean Formulas: Preliminary Report | Michael J. Fischer, Albert R. Meyer, Mike Paterson |
| 1973 | FOCS | Refinements of the Nondeterministic Time and Space Hierarchies | Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer |
| 1973 | POPL | Mode Modules as Representations of Domains. | Alice E. Fischer, Michael J. Fischer |
| 1973 | STOC | Fast On-Line Integer Multiplication | Michael J. Fischer, Larry J. Stockmeyer |
| 1973 | STOC | Sets that Don't Help | Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer |
| 1971 | FOCS | Boolean Matrix Multiplication and Transitive Closure | Michael J. Fischer, Albert R. Meyer |
| 1971 | FOCS | Economy of Description by Automata, Grammars, and Formal Systems | Albert R. Meyer, Michael J. Fischer |
| 1969 | FOCS | Two Characterizations of the Context-Sensitive Languages | Michael J. Fischer |
| 1969 | STOC | Some Properties of Precedence Languages | Michael J. Fischer |
| 1968 | FOCS | Grammars with Macro-Like Productions | Michael J. Fischer |
| 1968 | FOCS | Limited Random Access Turing Machines | Michael J. Fischer, Arnold L. Rosenberg |