default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. Fischer
Person information
- affiliation: Yale University, New Haven, Connecticut, USA
- award (2001): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c56]Michael J. Fischer, Jonathan E. Hochman, Daniel Boffa:
Privacy-Preserving Data Sharing for Medical Research. SSS 2021: 78-89
2010 – 2019
- 2019
- [c55]Shea Ketsdever, Michael J. Fischer:
Incentives Don't Solve Blockchain's Problems. UEMCON 2019: 873-876 - [i3]Shea Ketsdever, Michael J. Fischer:
Incentives Don't Solve Blockchain's Problems. CoRR abs/1905.04792 (2019) - 2017
- [c54]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: 444-460 - 2016
- [i2]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: 1067 (2016) - 2015
- [c53]Ewa Syta, Michael J. Fischer, David Wolinsky, Abraham Silberschatz, Gina Gallegos-García, Bryan Ford:
Private Eyes: Secure Remote Biometric Authentication. SECRYPT 2015: 243-250 - 2013
- [j43]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): 2583-2595 (2013) - 2011
- [c52]Michael J. Fischer, Michaela Iorga, René Peralta:
A Public Randomness Service. SECRYPT 2011: 434-438 - 2010
- [c51]Michael J. Fischer, Xueyuan Su, Yitong Yin:
Assigning tasks for efficiency in Hadoop: extended abstract. SPAA 2010: 30-39 - [e3]Shlomi Dolev, Jorge Arturo Cobb, Michael J. Fischer, Moti Yung:
Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings. Lecture Notes in Computer Science 6366, Springer 2010, ISBN 978-3-642-16022-6 [contents]
2000 – 2009
- 2008
- [j42]Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang:
Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3(4): 13:1-13:28 (2008) - [c50]Michael J. Fischer:
Evolution of distributed computing theory: from concurrency to networks and beyond. PODC 2008: 460 - 2006
- [j41]Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta:
Computation in networks of passively mobile finite-state sensors. Distributed Comput. 18(4): 235-253 (2006) - [c49]Dana Angluin, Michael J. Fischer, Hong Jiang:
Stabilizing Consensus in Mobile Networks. DCOSS 2006: 37-50 - [c48]Michael J. Fischer, Hong Jiang:
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. OPODIS 2006: 395-409 - 2005
- [c47]Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta:
Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74 - [c46]Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang:
Self-stabilizing Population Protocols. OPODIS 2005: 103-117 - 2004
- [c45]Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta:
Computation in networks of passively mobile finite-state sensors. PODC 2004: 290-299 - 2003
- [j40]Michael J. Fischer, Michael Merritt:
Appraising two decades of distributed computing theory research. Distributed Comput. 16(2-3): 239-247 (2003) - [j39]Michael J. Fischer:
JACM 1983-1986. J. ACM 50(1): 17 (2003) - 2001
- [c44]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: 745-754 - 2000
- [i1]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 cs.CE/0010021 (2000)
1990 – 1999
- 1999
- [j38]Michael J. Fischer, Mike Paterson:
Optimal Layout of Edge-weighted Forests. Discret. Appl. Math. 90(1-3): 135-159 (1999) - 1998
- [c43]Michael J. Fischer:
Estimating Parameters of Monotone Boolean Functions (Abstract). COCOON 1998: 3 - 1996
- [j37]Michael J. Fischer, Rebecca N. Wright:
Bounds on Secret Key Exchange Using a Random Deal of Cards. J. Cryptol. 9(2): 71-99 (1996) - [j36]Michael J. Fischer, Silvio Micali, Charles Rackoff:
A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptol. 9(3): 191-195 (1996) - [j35]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996) - 1994
- [j34]Michael J. Fischer, Mike Paterson:
Fishspear: A Priority Queue Algorithm. J. ACM 41(1): 3-30 (1994) - [j33]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): 1267-1297 (1994) - 1993
- [j32]Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld:
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45(2): 101-105 (1993) - [j31]Michael J. Fischer:
Lambda-Calculus Schemata. LISP Symb. Comput. 6(3-4): 259-288 (1993) - [c42]Michael J. Fischer, Rebecca N. Wright:
An Efficient Protocol for Unconditionally Secure Secret Key Exchange. SODA 1993: 475-483 - 1992
- [j30]Michael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch:
Optimal Placement of Identical Resources in a Tree. Inf. Comput. 96(1): 1-54 (1992) - [p1]Michael J. Fischer, Sophia A. Paleologou:
Decision Making in the Presence of Noise. Informatik 1992: 145-168 - 1991
- [c41]Michael J. Fischer, Rebecca N. Wright:
Multiparty Secret Key Exchange Using a Random Deal of Cards. CRYPTO 1991: 141-155 - 1990
- [c40]Michael J. Fischer, Rebecca N. Wright:
An Application of Game-Theoretic Techniques to Cryptography. Advances In Computational Complexity Theory 1990: 99-118 - [c39]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem (Extended Abstract). STOC 1990: 106-116
1980 – 1989
- 1989
- [j29]Michael J. Fischer, Robert P. Fischer, Richard Beigel:
Primitive recursion without implicit predecessor. SIGACT News 20(4): 87-91 (1989) - [j28]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): 90-114 (1989) - [c38]Michael J. Fischer, Michael S. Paterson, Charles Rackoff:
Secret Bit Transmission Using a Random Deal of Cards. Distributed Computing And Cryptography 1989: 173-182 - 1988
- [c37]Michael J. Fischer, Lenore D. Zuck:
Reasoning about Uncertainty in Fault-tolerant Distributed Systems. FTRTFT 1988: 142-158 - 1987
- [j27]Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons:
Efficient Fault-Tolerant Routings in Networks. Inf. Comput. 75(1): 52-64 (1987) - [j26]Michael J. Fischer, Neil Immerman:
Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. 25(3): 175-181 (1987) - 1986
- [j25]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Comput. 1(1): 26-39 (1986) - [j24]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): 47-85 (1986) - [c36]Michael J. Fischer:
A Theoretician's View of Fault Tolerant Distributed Computing. Fault-Tolerant Distributed Computing 1986: 1-9 - [c35]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing 1986: 147-170 - [c34]Michael J. Fischer, Neil Immerman:
Foundations of Knowledge for Distributed Systems. TARK 1986: 171-185 - 1985
- [j23]Michael J. Fischer, Nancy A. Lynch, Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382 (1985) - [c33]Michael J. Fischer, Mike Paterson:
Dynamic Monotone Priorities on Planar Sets (Extended Abstract). FOCS 1985: 289-292 - [c32]Josh D. Cohen, Michael J. Fischer:
A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract). FOCS 1985: 372-382 - [c31]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70 - 1984
- [c30]Michael J. Fischer, Mike Paterson:
Fishspear: A Priority Queue Algorithm (Extended Abstract). FOCS 1984: 375-386 - [c29]Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons:
Efficient Fault Tolerant Routings in Networks. STOC 1984: 536-541 - 1983
- [j22]Michael J. Fischer, Mike Paterson:
Storage Requirements for Fair Scheduling. Inf. Process. Lett. 17(5): 249-250 (1983) - [j21]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
Efficiency of Synchronous Versus Asynchronous Distributed Systems. J. ACM 30(3): 449-456 (1983) - [j20]Nancy A. Lynch, Michael J. Fischer:
A Technique for Decomposing Algorithms Which Use a Single Shared Variable. J. Comput. Syst. Sci. 27(3): 350-377 (1983) - [c28]Michael J. Fischer:
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). FCT 1983: 127-140 - [c27]Michael J. Fischer, Nancy A. Lynch, Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process. PODS 1983: 1-7 - 1982
- [j19]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): 257-274 (1982) - [j18]Michael J. Fischer, Nancy A. Lynch:
A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. 14(4): 183-186 (1982) - [j17]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): 183-205 (1982) - [j16]Michael J. Fischer, Albert R. Meyer, Mike Paterson:
Omega(n log n) Lower Bounds on Length of Boolean Formulas. SIAM J. Comput. 11(3): 416-427 (1982) - [j15]Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch:
Global States of a Distributed System. IEEE Trans. Software Eng. 8(3): 198-202 (1982) - [c26]Albert G. Greenberg, Michael J. Fischer:
On computing weak transitive closure on O(log N) expected random parallel time. ICPP 1982: 199-204 - [c25]Michael J. Fischer, Alan Michael:
Sacrificing Serializability to Attain High Availability of Data. PODS 1982: 70-75 - [e2]Robert L. Probert, Michael J. Fischer, Nicola Santoro:
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, Canada, August 18-20, 1982. ACM 1982, ISBN 0-89791-081-8 [contents] - 1981
- [j14]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): 351-364 (1981) - [j13]Nancy A. Lynch, Michael J. Fischer:
On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13: 17-43 (1981) - [c24]Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch:
Optimal Placement of Identical Resources in a Distributed Network. ICDCS 1981: 324-336 - [c23]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: 148-159 - [c22]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
A Difference in Efficiency between Synchronous and Asynchronous Systems. STOC 1981: 128-132 - 1980
- [j12]Richard E. Ladner, Michael J. Fischer:
Parallel Prefix Computation. J. ACM 27(4): 831-838 (1980) - [c21]Michael J. Fischer, Mike Paterson:
Optimal Tree Layout (Preliminary Version). STOC 1980: 177-189
1970 – 1979
- 1979
- [j11]Nicholas Pippenger, Michael J. Fischer:
Relations Among Complexity Measures. J. ACM 26(2): 361-381 (1979) - [j10]Michael J. Fischer, Richard E. Ladner:
Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18(2): 194-211 (1979) - [j9]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): 24 (1979) - [c20]Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin:
Resource Allocation with Immunity to Limited Process Failure (Preliminary Report). FOCS 1979: 234-254 - [c19]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: 319-327 - [c18]Nancy A. Lynch, Michael J. Fischer:
On Describing the Behavior and Implementation of Distributed Systems. Semantics of Concurrent Computation 1979: 147-172 - [e1]Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, Alfred V. Aho:
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979 [contents] - 1978
- [j8]Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer:
Separating Nondeterministic Time Complexity Classes. J. ACM 25(1): 146-167 (1978) - 1977
- [c17]Gary L. Peterson, Michael J. Fischer:
Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract). STOC 1977: 91-97 - [c16]Michael J. Fischer, Richard E. Ladner:
Propositional Modal Logic of Programs (Extended Abstract). STOC 1977: 286-294 - 1976
- [c15]Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer:
A Note on the Average Time to Compute Transitive Closures. ICALP 1976: 425-434 - 1975
- [c14]Michael J. Fischer:
Hauptvortrag: The complexity of negation-limited networks - A brief survey. Automata Theory and Formal Languages 1975: 71-82 - [c13]Michael J. Fischer, Albert R. Meyer, Mike Paterson:
Lower Bounds on the Size of Boolean Formulas: Preliminary Report. STOC 1975: 37-44 - 1974
- [j7]Robert A. Wagner, Michael J. Fischer:
The String-to-String Correction Problem. J. ACM 21(1): 168-173 (1974) - [j6]Michael J. Fischer, Larry J. Stockmeyer:
Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. 9(3): 317-331 (1974) - 1973
- [j5]M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson:
A note on disjunctive form tautologies. SIGACT News 5(2): 17-20 (1973) - [c12]Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer:
Refinements of the Nondeterministic Time and Space Hierarchies. SWAT 1973: 130-137 - [c11]Alice E. Fischer, Michael J. Fischer:
Mode Modules as Representations of Domains. POPL 1973: 139-143 - [c10]Michael J. Fischer, Larry J. Stockmeyer:
Fast On-Line Integer Multiplication. STOC 1973: 67-72 - [c9]Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer:
Sets that Don't Help. STOC 1973: 130-134 - 1972
- [c8]Michael J. Fischer:
Efficiency of Equivalence Algorithms. Complexity of Computer Computations 1972: 153-167 - [c7]Michael J. Fischer:
Lambda calculus schemata. Proving Assertions About Programs 1972: 104-109 - 1971
- [c6]Michael J. Fischer, Albert R. Meyer:
Boolean Matrix Multiplication and Transitive Closure. SWAT 1971: 129-131 - [c5]Albert R. Meyer, Michael J. Fischer:
Economy of Description by Automata, Grammars, and Formal Systems. SWAT 1971: 188-191
1960 – 1969
- 1969
- [c4]Michael J. Fischer:
Two Characterizations of the Context-Sensitive Languages. SWAT 1969: 149-156 - [c3]Michael J. Fischer:
Some Properties of Precedence Languages. STOC 1969: 181-190 - 1968
- [j4]Michael J. Fischer, Arnold L. Rosenberg:
Real-Time Solutions of the Origin-Crossing Problem. Math. Syst. Theory 2(3): 257-263 (1968) - [c2]Michael J. Fischer:
Grammars with Macro-Like Productions. SWAT 1968: 131-142 - [c1]Michael J. Fischer, Arnold L. Rosenberg:
Limited Random Access Turing Machines. SWAT 1968: 356-367 - 1965
- [j3]Bernard A. Galler, Michael J. Fischer:
The iteration element. Commun. ACM 8(6): 349 (1965) - 1964
- [j2]Bernard A. Galler, Michael J. Fischer:
An improved equivalence algorithm. Commun. ACM 7(5): 301-303 (1964) - [j1]Bernard A. Galler, Michael J. Fischer:
In defense of the equivalence algorithm. Commun. ACM 7(8): 506 (1964)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
