LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 259-261 of 486

    • On the Sequential Nature of Unification 

      Dwork, Cynthia; Kanellakis, Paris C.; Mitchell, John C. (1984-03)
      The problem of unification of terms is log-space complete for P. In deriving this lower bound no use is made of the potentially concise representation of terms by directed acyclic graphs. In addition, the problem remains ...

    • On the Numbers of Close-and-equal Pairs of Bits in a String (with Implications on the Security of RSA'S L.S.B.) 

      Goldreich, Oded (1984-03)
      We consider the following problem: Let s be a n-bit string with m ones and n-m zeros. Denote by CEt(s) the number of pairs, of equal bits which are within distance t apart, in the string s. What is the minimum value of ...

    • How to Assemble Tree Machines 

      Bhatt, Sandeep Nautam; Leiserson, Charles E. (1984-03)
      Many researchers have proposed that ensembles of processing elements be organized as trees. This paper explores how large tree machines can be assembled efficiently from smaller components. A principal constraint considered ...