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