Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael J. Fischer
2010 – today
- 2013
[j40]José A. Montenegro, Michael J. Fischer, Javier Lopez, René Peralta: Secure sealed-bid online auctions using discreet cryptographic proofs. Mathematical and Computer Modelling 57(11-12): 2583-2595 (2013)- 2011
- [c49]Michael J. Fischer, Michaela Iorga, René Peralta: A Public Randomness Service. SECRYPT 2011: 434-438
- 2010
- [c48]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 (Eds.): 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
2000 – 2009
- 2008
- [j39]Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing population protocols. TAAS 3(4) (2008)
- [c47]Michael J. Fischer: Evolution of distributed computing theory: from concurrency to networks and beyond. PODC 2008: 460
- 2006
- [j38]Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4): 235-253 (2006)
- [c46]Dana Angluin, Michael J. Fischer, Hong Jiang: Stabilizing Consensus in Mobile Networks. DCOSS 2006: 37-50
- [c45]Michael J. Fischer, Hong Jiang: Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. OPODIS 2006: 395-409
- 2005
- [c44]Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta: Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74
- [c43]Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing Population Protocols. OPODIS 2005: 103-117
- 2004
- [c42]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
- [j37]Michael J. Fischer, Michael Merritt: Appraising two decades of distributed computing theory research. Distributed Computing 16(2-3): 239-247 (2003)
- [j36]
- 2001
- [c41]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
- [j35]Michael J. Fischer, Mike Paterson: Optimal Layout of Edge-weighted Forests. Discrete Applied Mathematics 90(1-3): 135-159 (1999)
- 1998
- [c40]
- 1996
- [j34]Michael J. Fischer, Rebecca N. Wright: Bounds on Secret Key Exchange Using a Random Deal of Cards. J. Cryptology 9(2): 71-99 (1996)
- [j33]Michael J. Fischer, Silvio Micali, Charles Rackoff: A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptology 9(3): 191-195 (1996)
- [j32]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem. SIAM J. Comput. 25(6): 1331-1332 (1996)
- 1994
- [j31]
- [j30]Yehuda Afek, Hagit Attiya, Alan 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
- [j29]Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld: Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45(2): 101-105 (1993)
- [j28]
- [c39]Michael J. Fischer, Rebecca N. Wright: An Efficient Protocol for Unconditionally Secure Secret Key Exchange. SODA 1993: 475-483
- 1992
- [j27]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)
- 1991
- [c38]Michael J. Fischer, Rebecca N. Wright: Multiparty Secret Key Exchange Using a Random Deal of Cards. CRYPTO 1991: 141-155
- 1990
- [c37]Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld: The Wakeup Problem (Extended Abstract). STOC 1990: 106-116
1980 – 1989
- 1989
- [j26]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)
- 1988
- [c36]Michael J. Fischer, Lenore D. Zuck: Reasoning about Uncertainty in Fault-tolerant Distributed Systems. FTRTFT 1988: 142-158
- 1987
- [j25]Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons: Efficient Fault-Tolerant Routings in Networks. Inf. Comput. 75(1): 52-64 (1987)
- [j24]Michael J. Fischer, Neil Immerman: Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. 25(3): 175-181 (1987)
- 1986
- [j23]Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Computing 1(1): 26-39 (1986)
- [j22]Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas: Probabilistic Analysis of a Network Resource Allocation Algorithm. Information and Control 68(1-3): 47-85 (1986)
- [c35]Michael J. Fischer: A Theoretician's View of Fault Tolerant Distributed Computing. Fault-Tolerant Distributed Computing 1986: 1-9
- [c34]Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing 1986: 147-170
- [c33]Michael J. Fischer, Neil Immerman: Foundations of Knowledge for Distributed Systems. TARK 1986: 171-185
- 1985
- [j21]Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382 (1985)
- [c32]Michael J. Fischer, Mike Paterson: Dynamic Monotone Priorities on Planar Sets (Extended Abstract). FOCS 1985: 289-292
- [c31]Josh D. Cohen, Michael J. Fischer: A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract). FOCS 1985: 372-382
- [c30]Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70
- 1984
- [c29]Michael J. Fischer, Mike Paterson: Fishspear: A Priority Queue Algorithm (Extended Abstract). FOCS 1984: 375-386
- [c28]Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons: Efficient Fault Tolerant Routings in Networks. STOC 1984: 536-541
- 1983
- [j20]Michael J. Fischer, Mike Paterson: Storage Requirements for Fair Scheduling. Inf. Process. Lett. 17(5): 249-250 (1983)
- [j19]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch: Efficiency of Synchronous Versus Asynchronous Distributed Systems. J. ACM 30(3): 449-456 (1983)
- [j18]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)
- [c27]Michael J. Fischer: The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). FCT 1983: 127-140
- [c26]Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. PODS 1983: 1-7
- 1982
- [j17]Danny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong: An Efficient Algorithm for Byzantine Agreement without Authentication. Information and Control 52(3): 257-274 (1982)
- [j16]Michael J. Fischer, Nancy A. Lynch: A Lower Bound for the Time to Assure Interactive Consistency. Inf. Process. Lett. 14(4): 183-186 (1982)
- [j15]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)
- [j14]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)
- [j13]Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch: Global States of a Distributed System. IEEE Trans. Software Eng. 8(3): 198-202 (1982)
- [c25]Albert G. Greenberg, Michael J. Fischer: On computing weak transitive closure on O(log N) expected random parallel time. ICPP 1982: 199-204
- [c24]Michael J. Fischer, A. Michael: Sacrificing Serializability to Attain High Availability of Data. PODS 1982: 70-75
- [e2]Robert L. Probert, Michael J. Fischer, Nicola Santoro (Eds.): ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, CanadaAugust 18-20, 1982. ACM 1982, ISBN 0-89791-081-8
- 1981
- [j12]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)
- [j11]Nancy A. Lynch, Michael J. Fischer: On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13: 17-43 (1981)
- [c23]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
- [c22]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
- [c21]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch: A Difference in Efficiency between Synchronous and Asynchronous Systems. STOC 1981: 128-132
- 1980
- [j10]
- [c20]
1970 – 1979
- 1979
- [j9]Nicholas Pippenger, Michael J. Fischer: Relations Among Complexity Measures. J. ACM 26(2): 361-381 (1979)
- [j8]Michael J. Fischer, Richard E. Ladner: Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18(2): 194-211 (1979)
- [c19]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
- [c18]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
- [c17]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 (Eds.): Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979
- 1978
- [j7]Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer: Separating Nondeterministic Time Complexity Classes. J. ACM 25(1): 146-167 (1978)
- 1977
- [c16]Gary L. Peterson, Michael J. Fischer: Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract). STOC 1977: 91-97
- [c15]Michael J. Fischer, Richard E. Ladner: Propositional Modal Logic of Programs (Extended Abstract). STOC 1977: 286-294
- 1976
- [c14]Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer: A Note on the Average Time to Compute Transitive Closures. ICALP 1976: 425-434
- 1975
- [c13]Michael J. Fischer: Hauptvortrag: The complexity of negation-limited networks - A brief survey. Automata Theory and Formal Languages 1975: 71-82
- [c12]Michael J. Fischer, Albert R. Meyer, Mike Paterson: Lower Bounds on the Size of Boolean Formulas: Preliminary Report. STOC 1975: 37-44
- 1974
- [j6]Robert A. Wagner, Michael J. Fischer: The String-to-String Correction Problem. J. ACM 21(1): 168-173 (1974)
- [j5]Michael J. Fischer, Larry J. Stockmeyer: Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. 9(3): 317-331 (1974)
- 1973
- [c11]Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer: Refinements of the Nondeterministic Time and Space Hierarchies. SWAT (FOCS) 1973: 130-137
- [c10]Alice E. Fischer, Michael J. Fischer: Mode Modules as Representations of Domains. POPL 1973: 139-143
- [c9]
- [c8]
- 1972
- [c7]Michael J. Fischer: Efficiency of Equivalence Algorithms. Complexity of Computer Computations 1972: 153-167
- 1971
- [c6]Michael J. Fischer, Albert R. Meyer: Boolean Matrix Multiplication and Transitive Closure. SWAT (FOCS) 1971: 129-131
- [c5]Albert R. Meyer, Michael J. Fischer: Economy of Description by Automata, Grammars, and Formal Systems. SWAT (FOCS) 1971: 188-191
1960 – 1969
- 1969
- [c4]Michael J. Fischer: Two Characterizations of the Context-Sensitive Languages. SWAT (FOCS) 1969: 149-156
- [c3]
- 1968
- [j4]Michael J. Fischer, Arnold L. Rosenberg: Real-Time Solutions of the Origin-Crossing Problem. Mathematical Systems Theory 2(3): 257-263 (1968)
- [c2]
- [c1]Michael J. Fischer, Arnold L. Rosenberg: Limited Random Access Turing Machines. SWAT (FOCS) 1968: 356-367
- 1965
- [j3]
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-28 21:40 CEST by the dblp team