LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 415-417 of 486
-
Construction and Analysis of Network Flow Problem Which Forces Karzanov Algorithm 0(n^3) Running Time
(1977-05)The intest of this paper is to demonstrate the construction of a network flow problem which will force the Karzanov "Preflow" algorithm to run in its theoretic worst case time 0(n^3). Once such a "bad case" network has ... -
A Method for Obtaining Digital Signatures and Public-key Cryptosystems
(1977-04)We present an encryption method with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences. 1. Couriers or other secure ... -
Hardware Estimatino of a Process' Primary Memory Requirements
(1977-01)It is shown that a process' primary memory requirements can be approximated by use of the miss rate in the Honeywell 6180's page table word associative memory. This primary memory requirement estimate was employed by an ...
