Now showing items 1-6 of 6

• #### On the Impossibility of Group Membership ﻿

(Cornell University, 1995-10)
We prove that the primary-partition group membership problem cannot be solved in asynchronous systems with crash failures, even if one allows the removal or killing of non-faulty processes that are erroneously suspected ...
• #### The Weakest Failure Detector for Solving Consensus ﻿

(Cornell University, 1992-07)
• #### Time and Message Efficient Reliable Broadcasts ﻿

(Cornell University, 1990-05)
No abstract is available.
• #### Undecidability in Macroeconomics (Preliminary Draft) ﻿

(Cornell University, 1993-04)
In this paper, we study the difficulty of solving problems in economics. For this purpose, we adopt the notion of undecidability from recursion theory. We show that certain problems in economics are undecidable, i.e., ...
• #### Unreliable Failure Detectors for Asynchronous Distributed Systems ﻿

(Cornell University, 1993-08)
It is well-known that several fundamental problems of fault-tolerant distributed computing, such as Consensus and Atomic Broadcast, cannot be solved in asynchronous systems with crash failures. These impossibility results ...
• #### The Weakest Failure Detector for Solving Consensus ﻿

(Cornell University, 1994-05)
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In [CT91], we proved that $\Diamond\cal W$, a failure detector ...