LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 265-267 of 486

    • Reaching Approximate Agreement in the Presence of Faults 

      Dolev, Danny; Lynch, Nancy A.; Pinter, Shlomit S.; Stark, Eugene W.; Weihl, William E. (1985-10)
      This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Booleann values or values from some bounded range, and in which approximate, rather than ...

    • On Concurrent Identification Protocols 

      Goldreich, Oded (1983-12)
      We consider communication networks in which it is not possible to identify the source of a message which is broadcastes through the network. A natural question is whether it is possible for two users to identify each other ...

    • The Markov Chain Tree Theorem 

      Leighton, Frank Thomson; Rivest, Ronald L. (1983-11)
      Let M be a finite first-order stationary Markov chain. We define an arborescence to be a set of edges in the directed graph for M having at most one edge out of every vertex, no cyles, and maximum cardinality. The weight ...