Browsing LCS Publications by Title
Now showing items 409-428 of 1163
-
Facilitating Interprocess Communication in a Heterogeneous Network Environment
(1977-07)Passing information among processors with different internal data formatting schemes has proven to be a major complication to computer networking efforts. Data format translation is necessary to support information exchange ... -
Factoring Numbers in 0(log n) Arithmetic Steps
(1977-11)In this paper we show that a non-trivial factor of a composite number n can be found by performing arithmetic steps in a number proportional to the number of bits in n, and thus there are extremely short straight-line ... -
Failsafe Key Escrow
(1994-08) -
Failsafe Key Escrow Systems (Extended Abstract)
(1994-08)This paper describes a method for escrowing cryptographic keys, which we call Failsafe Key Escrow (FKE). The method is substantially more secure than alternative such as the Fair Public Key Cryptosystem approach advocated ... -
Fair Cryptosystems
(1993-11) -
Family Values: A Beahvior Notion of Subtyping
(1993-08) -
A Fast Multiport Memory Based on Single-port Memory Cells
(1991-07)We present a new design for dual-port memories that uses single-port memory cells but guarantees fast deterministic read/write access. The basic unit of storage is the word, rather than the bit, and addresses conflicts ... -
Fast On-line Integer Multiplication
(1974-05)A Turing machine multiplies binary integers on-line if it receives its inputs low-order digits first and produces the jth digit of the product before reading in the (j+l)st digits of the two inputs. We present a general ... -
Fast Place and Route Approaches for FPGAs
(1999-02) -
A Fast Signature Scheme
(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 Faster Algorithm Computing String Edit Distances
(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 ... -
The Fastest Fourier Transform in the West
(1997-09) -
Fault Tolerance in Packet Communication Computer Archiectures
(1980-12)It is attractive to implement a large scale parallel processing system as a self-timed hardware system with decentralized control and to improve maintainability and availability in such a system through fault tolerance. ... -
A Fault-tolerant Network Kernel for Linda
(1988-08)The parallel programming system Linda consists of a number of processes and a shared memory called the tuple space. In a distributed implementation of Linda, processes and the tuple space reside on different computing ... -
File Management and Related Topics, June 12, 1970
(1970-09)The subject of these notes is file management. We will develop the problems of file management within the environment of a large information and computing service, often called a computer utility or general purpose ... -
File Systems with Multiple File Implementations
(1992-02)This thesis proposes ideas for designing file system software for the large, high-performance file server hardware we feel will be common in the middle to late nineties. In particular, the thesis examines the value and ...