A Lower Bound for the Time to Assure Interactive Consistency

  title={A Lower Bound for the Time to Assure Interactive Consistency},
  author={Michael J. Fischer and Nancy A. Lynch},
  journal={Inf. Process. Lett.},
fConttnua on ravaraa alda It nacaaaary and Idantity by block numbar) The problem of "assuring interactive consistency" is defined in [PSL]. 20 It is assumed that there are n isolated processors, of which at most m are faulty. The processors can communicate by means of two-party messages, using a medium which is reliable and of negligible delay. The sender of a message is always identifiable by the receiver. Each processor p has a private value o(p). The problem is to devise an algorithm that… CONTINUE READING
Highly Influential
This paper has highly influenced 31 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 278 extracted citations


Publications referenced by this paper.

Similar Papers

Loading similar papers…