Browsing LCS Technical Memos (1974 - 2003) by Title
Now showing items 479-492 of 492
-
Verifiable Secret Sharing as Secure Computation
(1994-03)We present a stronger notion of verifiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever verifiable secret sharing is used as a tool within larger ... -
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study*
(1997-06)The Probabilistic I/O Automaton model of [20] is used as the basis for a formal presentation and proof of the randomized consensus algorithm of Aspnes and Herlihy. The algorithm guarantees termination within expected ... -
Virtual Wires: Overcoming Pin Limitations in FPGA-based Logic Emulators
(1992-11)Existing FPGA-based logic emulators suffer from limited inter-chip communication bandwidth, resulting in low gate utilization (10 20 percent). This resource imbalance increases the number of chips needed to emulate a ... -
Wafer-scale Integration of Systolic Arrays
(1983-02)VLSI technologists are fast developing wafer-scale integration. Rather than partitioning a silicon wafer into chips as is usually done, the idea behind wafer-scale integration is to assemble an entire system (or network ... -
Weak Monadic Second Order Theory of Successor is not Element-recurive
(1973-12)Let L SIS be the set of formulas expressible in a week monadic second order logic using only the predicates [x =y+1] and [x E z]. Bucci and Elgot [3,4] have shown that the truth of sentences in L SIS (under the standard ... -
What are principal typings and what are they good for?
(1995-11)We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection ... -
What are principal typings and what are they good for?
(1995-08)We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection ... -
What is a Model of the Lamda Calculus? Expanded Version
(1981-07)An elementary, purely algebraic definition of model for the untypes lambda calculus is given. This definition is shown to be equivalent to the natural semantic definition based on environments. These definitions of model ... -
What Price for Eliminating Expression Side-effects?
(1985-06)Separating a programming language into side-effect-free expressions and effect-only statements should make the language more amenable to axiomatization, as well as providing benefits for style, pedagogy, and implementation ... -
Width-3 Permutation Branching Programs
(1985-12)We consider a restricted class of width-3 branching programs where each column of nodes depends on a single variable, and the 0-edges and the 1-edges out of each column form a permutation. In this model, parity and the ... -
With what Frequency are Apparently Intractable Problems Difficult?
(1979-02)An algorithm is almost polynomial-time (apt) iff there is a polynomial p such that for all n, the algorithm halts within p(n) steps on all by at most p(n) inputs of size at most n. It is nown that for NP-complete and ... -
Workstation Services and Kerberos Authentication at Project Athena
(1989-03)This document proposes solutions for two problems obstructing Project Athena's implementation of workstation services. The principal problem is that workstation services demand a more flexible mutual-authentication ... -
Worst-case and Probabilistic Analysis of a Geometric Location Problem
(1980-02)We consider the problem of choosing K "medians" among n points on the Euclidean plane such that the sum of the distances from each of the n points to its closest median is minimized. We show that this problem is NP-complete. ... -
Ω(n log n) Lower Bounds on Length of Boolean Formulas
(1980-11)A property of Boolean functions of n variables is described and shown to imply lower bounds as large as Ω(n log n) on the number of literals in any Boolean formula for any function with the property. Formulas over the full ...
