The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael J. Fischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael J. Fischer, A. Michael
    Sacrificing Serializability to Attain High Availability of Data. [Citation Graph (20, 14)][DBLP]
    PODS, 1982, pp:70-75 [Conf]
  2. Michael J. Fischer, Nancy D. Griffeth, Nancy A. Lynch
    Global States of a Distributed System. [Citation Graph (13, 0)][DBLP]
    IEEE Trans. Software Eng., 1982, v:8, n:3, pp:198-202 [Journal]
  3. Michael J. Fischer, Nancy A. Lynch, Mike Paterson
    Impossibility of Distributed Consensus with One Faulty Process [Citation Graph (6, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:374-382 [Journal]
  4. Robert A. Wagner, Michael J. Fischer
    The String-to-String Correction Problem. [Citation Graph (5, 0)][DBLP]
    J. ACM, 1974, v:21, n:1, pp:168-173 [Journal]
  5. Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
    A Note on the Average Time to Compute Transitive Closures. [Citation Graph (3, 0)][DBLP]
    ICALP, 1976, pp:425-434 [Conf]
  6. Michael J. Fischer, Nancy A. Lynch, Mike Paterson
    Impossibility of Distributed Consensus with One Faulty Process. [Citation Graph (2, 8)][DBLP]
    PODS, 1983, pp:1-7 [Conf]
  7. Michael J. Fischer, Nancy A. Lynch
    A Lower Bound for the Time to Assure Interactive Consistency. [Citation Graph (2, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:4, pp:183-186 [Journal]
  8. Nancy A. Lynch, Michael J. Fischer
    On Describing the Behavior and Implementation of Distributed Systems. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:17-43 [Journal]
  9. Michael J. Fischer
    The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). [Citation Graph (1, 0)][DBLP]
    FCT, 1983, pp:127-140 [Conf]
  10. Michael J. Fischer, Albert R. Meyer
    Boolean Matrix Multiplication and Transitive Closure [Citation Graph (1, 0)][DBLP]
    FOCS, 1971, pp:129-131 [Conf]
  11. Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas
    Probabilistic Analysis of a Network Resource Allocation Algorithm [Citation Graph (1, 0)][DBLP]
    Information and Control, 1986, v:68, n:1-3, pp:47-85 [Journal]
  12. Richard E. Ladner, Michael J. Fischer
    Parallel Prefix Computation. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:831-838 [Journal]
  13. Michael J. Fischer, Richard E. Ladner
    Propositional Dynamic Logic of Regular Programs. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:2, pp:194-211 [Journal]
  14. Michael J. Fischer
    Hauptvortrag: The complexity of negation-limited networks - A brief survey. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:71-82 [Conf]
  15. Michael J. Fischer
    Estimating Parameters of Monotone Boolean Functions (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:3- [Conf]
  16. Michael J. Fischer, Rebecca N. Wright
    Multiparty Secret Key Exchange Using a Random Deal of Cards. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:141-155 [Conf]
  17. Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
    Stably Computable Properties of Network Graphs. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2005, pp:63-74 [Conf]
  18. Dana Angluin, Michael J. Fischer, Hong Jiang
    Stabilizing Consensus in Mobile Networks. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2006, pp:37-50 [Conf]
  19. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
    A Time-Space Tradeoff for Sorting on Non-Oblivious Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:319-327 [Conf]
  20. Josh D. Cohen, Michael J. Fischer
    A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:372-382 [Conf]
  21. Michael J. Fischer, Mike Paterson
    Fishspear: A Priority Queue Algorithm (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:375-386 [Conf]
  22. Michael J. Fischer, Mike Paterson
    Dynamic Monotone Priorities on Planar Sets (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:289-292 [Conf]
  23. Michael J. Fischer, Arnold L. Rosenberg
    Limited Random Access Turing Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:356-367 [Conf]
  24. Michael J. Fischer
    Grammars with Macro-Like Productions [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:131-142 [Conf]
  25. Michael J. Fischer
    Two Characterizations of the Context-Sensitive Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:149-156 [Conf]
  26. Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
    Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:234-254 [Conf]
  27. Albert R. Meyer, Michael J. Fischer
    Economy of Description by Automata, Grammars, and Formal Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:188-191 [Conf]
  28. Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
    Refinements of the Nondeterministic Time and Space Hierarchies [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:130-137 [Conf]
  29. Michael J. Fischer
    A Theoretician's View of Fault Tolerant Distributed Computing. [Citation Graph (0, 0)][DBLP]
    Fault-Tolerant Distributed Computing, 1986, pp:1-9 [Conf]
  30. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
    Easy Impossibility Proofs for Distributed Consensus Problems. [Citation Graph (0, 0)][DBLP]
    Fault-Tolerant Distributed Computing, 1986, pp:147-170 [Conf]
  31. Michael J. Fischer, Lenore D. Zuck
    Reasoning about Uncertainty in Fault-tolerant Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1988, pp:142-158 [Conf]
  32. Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch
    Optimal Placement of Identical Resources in a Distributed Network. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1981, pp:324-336 [Conf]
  33. Michael Fischer, Hong Jiang
    Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:395-409 [Conf]
  34. Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
    Self-stabilizing Population Protocols. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:103-117 [Conf]
  35. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
    Computation in networks of passively mobile finite-state sensors. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:290-299 [Conf]
  36. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
    Easy Impossibility Proofs for Distributed Consensus Problems. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:59-70 [Conf]
  37. Alice E. Fischer, Michael J. Fischer
    Mode Modules as Representations of Domains. [Citation Graph (0, 0)][DBLP]
    POPL, 1973, pp:139-143 [Conf]
  38. Nancy A. Lynch, Michael J. Fischer
    On Describing the Behavior and Implementation of Distributed Systems. [Citation Graph (0, 0)][DBLP]
    Semantics of Concurrent Computation, 1979, pp:147-172 [Conf]
  39. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:745-754 [Conf]
  40. Michael J. Fischer, Rebecca N. Wright
    An Efficient Protocol for Unconditionally Secure Secret Key Exchange. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:475-483 [Conf]
  41. Edward D. Lazowska, Henry M. Levy, Guy T. Almes, Michael J. Fischer, Robert J. Fowler, Stephen C. Vestal
    The Architecture of the Eden System. [Citation Graph (0, 0)][DBLP]
    SOSP, 1981, pp:148-159 [Conf]
  42. Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
    A Difference in Efficiency between Synchronous and Asynchronous Systems [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:128-132 [Conf]
  43. Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
    Efficient Fault Tolerant Routings in Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:536-541 [Conf]
  44. Michael J. Fischer
    Some Properties of Precedence Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:181-190 [Conf]
  45. Michael J. Fischer, Richard E. Ladner
    Propositional Modal Logic of Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:286-294 [Conf]
  46. Michael J. Fischer, Albert R. Meyer, Mike Paterson
    Lower Bounds on the Size of Boolean Formulas: Preliminary Report [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:37-44 [Conf]
  47. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
    The Wakeup Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:106-116 [Conf]
  48. Michael J. Fischer, Mike Paterson
    Optimal Tree Layout (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:177-189 [Conf]
  49. Michael J. Fischer, Larry J. Stockmeyer
    Fast On-Line Integer Multiplication [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:67-72 [Conf]
  50. Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer
    Sets that Don't Help [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:130-134 [Conf]
  51. Gary L. Peterson, Michael J. Fischer
    Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:91-97 [Conf]
  52. Michael J. Fischer, Neil Immerman
    Foundations of Knowledge for Distributed Systems. [Citation Graph (0, 0)][DBLP]
    TARK, 1986, pp:171-185 [Conf]
  53. Bernard A. Galler, Michael J. Fischer
    An improved equivalence algorithm. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1964, v:7, n:5, pp:301-303 [Journal]
  54. Bernard A. Galler, Michael J. Fischer
    In defense of the equivalence algorithm. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1964, v:7, n:8, pp:506- [Journal]
  55. Bernard A. Galler, Michael J. Fischer
    The iteration element. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:6, pp:349- [Journal]
  56. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  57. Michael J. Fischer, Mike Paterson
    Optimal Layout of Edge-weighted Forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:135-159 [Journal]
  58. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
    Computation in networks of passively mobile finite-state sensors. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:235-253 [Journal]
  59. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
    Easy Impossibility Proofs for Distributed Consensus Problems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1986, v:1, n:1, pp:26-39 [Journal]
  60. Michael J. Fischer, Michael Merritt
    Appraising two decades of distributed computing theory research. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:239-247 [Journal]
  61. Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
    Efficient Fault-Tolerant Routings in Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:75, n:1, pp:52-64 [Journal]
  62. Danny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, H. Raymond Strong
    An Efficient Algorithm for Byzantine Agreement without Authentication [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:3, pp:257-274 [Journal]
  63. Michael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch
    Optimal Placement of Identical Resources in a Tree [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:1, pp:1-54 [Journal]
  64. Michael J. Fischer, Neil Immerman
    Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:3, pp:175-181 [Journal]
  65. Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld
    Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:2, pp:101-105 [Journal]
  66. Michael J. Fischer, Mike Paterson
    Storage Requirements for Fair Scheduling. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:5, pp:249-250 [Journal]
  67. Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
    Efficiency of Synchronous Versus Asynchronous Distributed Systems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:449-456 [Journal]
  68. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:6, pp:1267-1297 [Journal]
  69. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:1, pp:183-205 [Journal]
  70. Michael J. Fischer
    JACM 1983-1986. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:17- [Journal]
  71. Michael J. Fischer, Mike Paterson
    Fishspear: A Priority Queue Algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:1, pp:3-30 [Journal]
  72. Nicholas Pippenger, Michael J. Fischer
    Relations Among Complexity Measures. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:2, pp:361-381 [Journal]
  73. Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
    Separating Nondeterministic Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:146-167 [Journal]
  74. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
    A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:351-364 [Journal]
  75. Michael J. Fischer, Larry J. Stockmeyer
    Fast On-Line Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:317-331 [Journal]
  76. Nancy A. Lynch, Michael J. Fischer
    A Technique for Decomposing Algorithms Which Use a Single Shared Variable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:27, n:3, pp:350-377 [Journal]
  77. Michael J. Fischer, Silvio Micali, Charles Rackoff
    A Secure Protocol for the Oblivious Transfer (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:3, pp:191-195 [Journal]
  78. Michael J. Fischer, Rebecca N. Wright
    Bounds on Secret Key Exchange Using a Random Deal of Cards. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:2, pp:71-99 [Journal]
  79. Michael J. Fischer
    Lambda-Calculus Schemata. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1993, v:6, n:3-4, pp:259-288 [Journal]
  80. Michael J. Fischer, Arnold L. Rosenberg
    Real-Time Solutions of the Origin-Crossing Problem. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1968, v:2, n:3, pp:257-263 [Journal]
  81. Michael J. Fischer, Albert R. Meyer, Mike Paterson
    Omega(n log n) Lower Bounds on Length of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:416-427 [Journal]
  82. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
    The Wakeup Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1331-1332 [Journal]
  83. Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
    Distributed FIFO Allocation of Identical Resources Using Small Shared Space. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1989, v:11, n:1, pp:90-114 [Journal]

  84. On computing weak transitive closure on O(log N) expected random parallel time. [Citation Graph (, )][DBLP]


  85. Evolution of distributed computing theory: from concurrency to networks and beyond. [Citation Graph (, )][DBLP]


  86. Assigning tasks for efficiency in Hadoop: extended abstract. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002