Michael J. Fischer

Publication Activity (10 Years)

Years Active: 1964-2021
Publications (10 Years): 5

Top Venues

IEEE Symposium on Security and Privacy

CoRR

IACR Cryptol. ePrint Arch.

SECRYPT

Publications

Michael J. Fischer, Jonathan E. Hochman, Daniel Boffa
Privacy-Preserving Data Sharing for Medical Research. SSS (2021)
Shea Ketsdever, Michael J. Fischer
Incentives Don't Solve Blockchain's Problems. CoRR (2019)
Shea Ketsdever, Michael J. Fischer
Incentives Don't Solve Blockchain's Problems. UEMCON (2019)
Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford
Scalable Bias-Resistant Distributed Randomness. IEEE Symposium on Security and Privacy (2017)
Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, Bryan Ford
Scalable Bias-Resistant Distributed Randomness. IACR Cryptol. ePrint Arch. 2016 (2016)
Ewa Syta, Michael J. Fischer, David Wolinsky, Abraham Silberschatz, Gina Gallegos-García, Bryan Ford
Private Eyes: Secure Remote Biometric Authentication. SECRYPT (2015)
José A. Montenegro, Michael J. Fischer, Javier López, René Peralta
Secure sealed-bid online auctions using discreet cryptographic proofs. Math. Comput. Model. 57 (11-12) (2013)
Michael J. Fischer, Michaela Iorga, René Peralta
A Public Randomness Service. SECRYPT (2011)
Michael J. Fischer, Xueyuan Su, Yitong Yin
Assigning tasks for efficiency in Hadoop: extended abstract. SPAA (2010)
Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3 (4) (2008)
Michael J. Fischer
Evolution of distributed computing theory: from concurrency to networks and beyond. PODC (2008)
Dana Angluin, Michael J. Fischer, Hong Jiang
Stabilizing Consensus in Mobile Networks. DCOSS (2006)
Michael J. Fischer, Hong Jiang
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. OPODIS (2006)
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
Computation in networks of passively mobile finite-state sensors. Distributed Comput. 18 (4) (2006)
Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
Self-stabilizing Population Protocols. OPODIS (2005)
Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
Stably Computable Properties of Network Graphs. DCOSS (2005)
Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
Computation in networks of passively mobile finite-state sensors. PODC (2004)
Michael J. Fischer
JACM 1983-1986. J. ACM 50 (1) (2003)
Michael J. Fischer, Michael Merritt
Appraising two decades of distributed computing theory research. Distributed Comput. 16 (2-3) (2003)
James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
Towards understanding the predictability of stock markets from the perspective of computational complexity. SODA (2001)
James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity CoRR (2000)
Michael J. Fischer, Mike Paterson
Optimal Layout of Edge-weighted Forests. Discret. Appl. Math. 90 (1-3) (1999)
Michael J. Fischer
Estimating Parameters of Monotone Boolean Functions (Abstract). COCOON (1998)
Michael J. Fischer, Silvio Micali, Charles Rackoff
A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptol. 9 (3) (1996)
Michael J. Fischer, Rebecca N. Wright
Bounds on Secret Key Exchange Using a Random Deal of Cards. J. Cryptol. 9 (2) (1996)
Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
The Wakeup Problem. SIAM J. Comput. 25 (6) (1996)
Michael J. Fischer, Mike Paterson
Fishspear: A Priority Queue Algorithm. J. ACM 41 (1) (1994)
Yehuda Afek, Hagit Attiya, Alan D. Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck
Reliable Communication Over Unreliable Channels. J. ACM 41 (6) (1994)
Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45 (2) (1993)
Michael J. Fischer
Lambda-Calculus Schemata. LISP Symb. Comput. 6 (3-4) (1993)
Michael J. Fischer, Rebecca N. Wright
An Efficient Protocol for Unconditionally Secure Secret Key Exchange. SODA (1993)
Michael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch
Optimal Placement of Identical Resources in a Tree Inf. Comput. 96 (1) (1992)
Michael J. Fischer, Rebecca N. Wright
Multiparty Secret Key Exchange Using a Random Deal of Cards. CRYPTO (1991)
Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
The Wakeup Problem (Extended Abstract) STOC (1990)
Michael J. Fischer, Rebecca N. Wright
An Application of Game-Theoretic Techniques to Cryptography. Advances In Computational Complexity Theory (1990)
Michael J. Fischer, Michael S. Paterson, Charles Rackoff
Secret Bit Transmission Using a Random Deal of Cards. Distributed Computing And Cryptography (1989)
Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
Distributed FIFO Allocation of Identical Resources Using Small Shared Space. ACM Trans. Program. Lang. Syst. 11 (1) (1989)
Michael J. Fischer, Robert P. Fischer, Richard Beigel
Primitive recursion without implicit predecessor. SIGACT News 20 (4) (1989)
Michael J. Fischer, Lenore D. Zuck
Reasoning about Uncertainty in Fault-tolerant Distributed Systems. FTRTFT (1988)
Michael J. Fischer, Neil Immerman
Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. 25 (3) (1987)
Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
Efficient Fault-Tolerant Routings in Networks Inf. Comput. 75 (1) (1987)
Michael J. Fischer, Nancy A. Lynch, Michael Merritt
Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing (1986)
Michael J. Fischer
A Theoretician's View of Fault Tolerant Distributed Computing. Fault-Tolerant Distributed Computing (1986)
Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas
Probabilistic Analysis of a Network Resource Allocation Algorithm Inf. Control. 68 (1-3) (1986)
Michael J. Fischer, Nancy A. Lynch, Michael Merritt
Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Comput. 1 (1) (1986)
Michael J. Fischer, Neil Immerman
Foundations of Knowledge for Distributed Systems. TARK (1986)
Michael J. Fischer, Nancy A. Lynch, Michael Merritt
Easy Impossibility Proofs for Distributed Consensus Problems. PODC (1985)
Josh D. Cohen, Michael J. Fischer
A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract) FOCS (1985)
Michael J. Fischer, Mike Paterson
Dynamic Monotone Priorities on Planar Sets (Extended Abstract) FOCS (1985)
Michael J. Fischer, Nancy A. Lynch, Mike Paterson
Impossibility of Distributed Consensus with One Faulty Process J. ACM 32 (2) (1985)
Michael J. Fischer, Mike Paterson
Fishspear: A Priority Queue Algorithm (Extended Abstract) FOCS (1984)
Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
Efficient Fault Tolerant Routings in Networks STOC (1984)
Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
Efficiency of Synchronous Versus Asynchronous Distributed Systems J. ACM 30 (3) (1983)
Nancy A. Lynch, Michael J. Fischer
A Technique for Decomposing Algorithms Which Use a Single Shared Variable. J. Comput. Syst. Sci. 27 (3) (1983)
Michael J. Fischer, Mike Paterson
Storage Requirements for Fair Scheduling. Inf. Process. Lett. 17 (5) (1983)
Michael J. Fischer, Nancy A. Lynch, Mike Paterson
Impossibility of Distributed Consensus with One Faulty Process. PODS (1983)
Michael J. Fischer
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). FCT (1983)
Michael J. Fischer, Albert R. Meyer, Mike Paterson
Omega(n log n) Lower Bounds on Length of Boolean Formulas. SIAM J. Comput. 11 (3) (1982)
James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable. J. ACM 29 (1) (1982)
Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch
Global States of a Distributed System. IEEE Trans. Software Eng. 8 (3) (1982)
Danny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong
An Efficient Algorithm for Byzantine Agreement without Authentication Inf. Control. 52 (3) (1982)
Michael J. Fischer, A. Michael
Sacrificing Serializability to Attain High Availability of Data. PODS (1982)
Albert G. Greenberg, Michael J. Fischer
On computing weak transitive closure on O(log N) expected random parallel time. ICPP (1982)
Michael J. Fischer, Nancy A. Lynch
A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. 14 (4) (1982)
Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
A Difference in Efficiency between Synchronous and Asynchronous Systems STOC (1981)
Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch
Optimal Placement of Identical Resources in a Distributed Network. ICDCS (1981)
Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. 22 (3) (1981)
Edward D. Lazowska, Henry M. Levy, Guy T. Almes, Michael J. Fischer, Robert J. Fowler, Stephen C. Vestal
The Architecture of the Eden System. SOSP (1981)
Nancy A. Lynch, Michael J. Fischer
On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13 (1981)
Michael J. Fischer, Mike Paterson
Optimal Tree Layout (Preliminary Version) STOC (1980)
Richard E. Ladner, Michael J. Fischer
Parallel Prefix Computation. J. ACM 27 (4) (1980)
Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines FOCS (1979)
Nancy A. Lynch, Michael J. Fischer
On Describing the Behavior and Implementation of Distributed Systems. Semantics of Concurrent Computation (1979)
Nicholas Pippenger, Michael J. Fischer
Relations Among Complexity Measures. J. ACM 26 (2) (1979)
Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
A time-space tradeoff for sorting and related non-oblivious computations. SIGACT News 11 (2) (1979)
Michael J. Fischer, Richard E. Ladner
Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18 (2) (1979)
Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) FOCS (1979)
Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
Separating Nondeterministic Time Complexity Classes. J. ACM 25 (1) (1978)
Gary L. Peterson, Michael J. Fischer
Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) STOC (1977)
Michael J. Fischer, Richard E. Ladner
Propositional Modal Logic of Programs (Extended Abstract) STOC (1977)
Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
A Note on the Average Time to Compute Transitive Closures. ICALP (1976)
Michael J. Fischer, Albert R. Meyer, Mike Paterson
Lower Bounds on the Size of Boolean Formulas: Preliminary Report STOC (1975)
Michael J. Fischer
Hauptvortrag: The complexity of negation-limited networks - A brief survey. Automata Theory and Formal Languages (1975)
Robert A. Wagner, Michael J. Fischer
The String-to-String Correction Problem. J. ACM 21 (1) (1974)
Michael J. Fischer, Larry J. Stockmeyer
Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. 9 (3) (1974)
Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer
Sets that Don't Help STOC (1973)
Alice E. Fischer, Michael J. Fischer
Mode Modules as Representations of Domains. POPL (1973)
Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
Refinements of the Nondeterministic Time and Space Hierarchies SWAT (1973)
M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson
A note on disjunctive form tautologies. SIGACT News 5 (2) (1973)
Michael J. Fischer, Larry J. Stockmeyer
Fast On-Line Integer Multiplication STOC (1973)
Michael J. Fischer
Lambda calculus schemata. Proving Assertions About Programs (1972)
Michael J. Fischer
Efficiency of Equivalence Algorithms. Complexity of Computer Computations (1972)
Albert R. Meyer, Michael J. Fischer
Economy of Description by Automata, Grammars, and Formal Systems SWAT (1971)
Michael J. Fischer, Albert R. Meyer
Boolean Matrix Multiplication and Transitive Closure SWAT (1971)
Michael J. Fischer
Some Properties of Precedence Languages STOC (1969)
Michael J. Fischer
Two Characterizations of the Context-Sensitive Languages SWAT (1969)
Michael J. Fischer, Arnold L. Rosenberg
Real-Time Solutions of the Origin-Crossing Problem. Math. Syst. Theory 2 (3) (1968)
Michael J. Fischer, Arnold L. Rosenberg
Limited Random Access Turing Machines SWAT (1968)
Michael J. Fischer
Grammars with Macro-Like Productions SWAT (1968)
Bernard A. Galler, Michael J. Fischer
The iteration element. Commun. ACM 8 (6) (1965)

Michael J. Fischer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael J. Fischer