Search
Now showing items 1-10 of 18
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 ...
An Application of Number Theory to the Organization of Raster Graphics Memory
(1984-04)
A high-resolution raster-graphics display is usually combined with processing power and a memory organization that facilitates basic graphics operations. For many applications, including interactive text processing, the ...
Time-lock Puzzles and Timed-release Crypto
(1996-02)
Our motivation is the notion of ``timed-release crypto,'' where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a pre-determined amount of time has passed. The goal ...
On the Worst-case Behavior of String-searching Algorithms
(1976-04)
Any algorithm for finding a pattern of length k in a string of length n must examine at least n-k+1 of the characters of the string in the worst case. By considering the pattern 00…0, we prove that this is the best possible ...
Inferring Decision Trees Using the Minimum Description Length Principle
(1987-09)
We explore the use of Rissanen's Minimum Description Length Principle for the construction of decision trees. Empirical results comparing this approach to other methods are given.
The MD4 Message Digest Algorithm
(1990-10)
The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit "fingerprint" or "message digest," in such a way that it is (hopefully) computationally infeasible to produce two ...
Network Control by Bayesian Broadcast
(1985-09)
Access-Controlled Resource Discovery for Pervasive Networks
(2002-09)
Networks of the future will be characterized by a variety of computational devices that display a level of dynamism not seen in traditional wired networks. Because of the dynamic nature of these networks, resource discovery ...
Optimal Arrangement of Keys in a Hash Table
(1976-07)
When open addressing is used to resolve collisions in a hash table, a given set of keys may be arranged in many ways; typically this depends on the order in which the keys are inserted. We show that arrangements minimizing ...