Browsing LCS Technical Memos (1974 - 2003) by Title
Now showing items 365-384 of 492
-
A Randomized Data Structure for Ordered Sets
(1986-05)In this paper, we consider a simple randomized data structure for representing ordered sets, and give a precise combinatorial analysis of the time required to perform various operations. In addition to a practical data ... -
Randomized Encryption Techniques
(1983-01)A randomized encryption procedure enciphers a message by randomly choosing a ciphertext from a set of ciphertexts corresponding to the message under the current encryption key. At the cost of increasing the required ... -
Randomized Routing on Fat-trees
(1986-05)Fat-trees are a class of routing networks for hardware-efficient paralle computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the ... -
Rank 2 Type Systems and Recursive Definitions
(1995-11)We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence ... -
Rank 2 Type Systems and Recursive Definitions
(1995-08)We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence is ... -
Ratings in Distributed Systems: A Bayesian Approach
(2001-05)For distributed systems at large and e-commerce systems in particular, ratings play an increasingly important role. Rating confer reputation measures about sources. This paper reports our formalization of the rating process. ... -
Reaching Approximate Agreement in the Presence of Faults
(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 ... -
Reaching Approximate Agreement in the Presence of Faults
(1985-05)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 ... -
Real-time Simulation of Multidimensional Turing Machines by Storage Modification Machines
(1973-12)In [1] the author introduced a new machine model, now called the Storage Modification Machine (SMM). It was claimed, but not proved, that SMM's can simulate all sorts of Turing machines-- those with multidimensional worktapes ... -
Record of the Workshop on Research in Office Semantics
(1981-02)This paper is a compendium of the ideas and issues presented at the Chatham Bars Workshop of Office Semantics. The intent of the workshop was to examine the state of the art in office systems and to elucidate the issues ... -
Recursion Theoretic Operators and Morphisms on Numbered Sets
(1981-02)An operator is a map ?: Pω->Pω. By embedding Pω in two natural ways into the λ-calculus model Pω^2 (and T^ω) the computable maps on this latter structure induce several classes of recursion theoretic operators. -
Recursive Decomposition Ordering and Multiset Orderings
(1982-06)The Recursive Decomposition Ordering, a simplification ordering on terms, is useful to prove termination of term rewriting systems. In this paper we give the definition of the decomposition ordering and prove that it is a ... -
The Reduction Method for Establishing Lower Bounds on the Number of Additions
(1974-06)A method for establishing lower bounds on the number of multiplications and divisions has been developed by Pan, Winograd and Strassen. A similar method is developed for establishing lower bounds on the number of additions ... -
The Relational Approach to the Management of Data Bases
(1971-04)The ultimate goal of Project MacAIMS (MAC Advanced Interactive Management System) is to build a computer facility which will be able to support non-trivial decision making processes. (See reference 4). In the early stages ... -
Reliable Communication Over Unreliable Channels
(1992-10)Layered communication protocols frequently implement a FIFO message facility on top of an unreliable non-FIFO service such as that provided by a packet-switching network. This paper investigates the possibility of implementing ... -
Replication in the Harp File System
(1991-08)This paper describes the design and implementation of the Harp file system. Harp is a replicated Unix file system accessible via the VFS interface. It provides highly available and reliable storage for files and guarantees ... -
Report on the Second Workshop on Data Flow Computer and Program Organization
(1979-06)The following report comprises an edited transcript of presentations made at the Workshop of Data Flow Computer and Program Organization, held at MIT on July 9-13, 1978, and co-sponsored by the Lawrence Livermore Laboratory ... -
Report on the Workshop on Data Flow Computer and Program Organization
(1977-11)The following report comprises an edited transcript of presentations made at the Workshop of Data Flow Computer and Program Organization, held at MIT on July 10-14, 1977 and co-sponsored by the Lawrence Livermore Laboratory ...
