#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1964

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

- Michael J. Fischer, Nancy A. Lynch, Mike Paterson
- J. ACM
- 1983

The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the… (More)

- Michael J. Fischer, Richard E. Ladner
- J. Comput. Syst. Sci.
- 1979

We introduce a fundamental propositional logical system based on modal logic for describing correctness, termination and equivalence of programs. We define a formal syntax and semantics for the propositional dynamic logic of regular programs and give several consequences of the definition. Principal conclusions are that deciding satisfiability of length n… (More)

- Robert A. Wagner, Michael J. Fischer
- J. ACM
- 1974

The <italic>string-to-string correction problem</italic> is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol from a… (More)

- Richard E. Ladner, Michael J. Fischer
- J. ACM
- 1980

The prefix problem is to compute all the products x t o x2 . . . . o xk for i ~ k .~ n, where o is an associative operation A recurstve construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast, small Boolean ctrcmts to simulate fimte-state transducers.… (More)

- Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
- Distributed Computing
- 2004

We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size. With a fairness condition on interactions, we define the concept of stable computation of a function or predicate, and give… (More)

- Michael J. Fischer, Nancy A. Lynch
- Inf. Process. Lett.
- 1982

- Michael J. Fischer
- SWAT
- 1968

- Michael J. Fischer, Hong Jiang
- OPODIS
- 2006

This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly… (More)

- Josh Daniel Cohen, Michael J. Fischer
- 26th Annual Symposium on Foundations of Computer…
- 1985

Cryptographic techniques are becoming important for a wide variety of distributed computing tasks where the processing agents are either unreliable or untrustworthy. (Cf. [DiHe76], [DLM82], [Rab83], [RSA78], etc.) This paper describes a cryptographic scheme for holding a secure secret ballot election in which all communication is public. Voters cast their… (More)

- Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
- TAAS
- 2005

This article studies self-stabilization in networks of anonymous, asynchronously interacting nodes where the size of the network is unknown. Constant-space protocols are given for Dijkstra-style round-robin token circulation, leader election in rings, two-hop coloring in degree-bounded graphs, and establishing consistent global orientation in an undirected… (More)