LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 391-393 of 486

    • A Fast Signature Scheme 

      Shamir, Adi (1978-05)
      In this paper we propose a new scheme for generating and verifying "electronic signatures" in public-key communications. The scheme is based on the difficulty of solving the knapsack problem, and its two main advantages ...

    • A Completeness Result for a Propositional Dynamic Logic 

      Parikh, Rohit (1978-07)
      Propositional modal logic of programs has been introduced by Fischer and Ladner [1], following ideas of Pratt [4]. We shall call it propositional dynamic logic (PDL) following the terminology of Heral, Meyer and Pratt. In ...

    • A Faster Algorithm Computing String Edit Distances 

      Masek, William J.; Patterson, Michael S. (1978-05)
      The edit-distance between two character strings can be defined as the minimum cost of a sequence of editing operations which transforms one string into the other. The operations allowed are deleteing, inserting and replacing ...