The author investigates the following problem: Suppose m people wish to compute the
value of a function f(x 1 , x 2 , x 3 , ..., x m ), which is an integer-valued function of m integer …

In this paper we introduce a new tool for controlling the knowledge transfer process in
cryptographic protocol design. It is applied to solve a general class of problems which include …

The purpose of this paper is to introduce a new information theory and explore its appplications.
Using modern computational complexity, we study the notion of information that can be …

Recently the use of public key encryption to provide secure network communication has
received considerable attention. Such public key systems are usually effective against passive …

Let M = {0, 1, 2, ..., m—1} , N = {0, 1, 2,..., n—1} , and f:M × N → {0, 1} a Boolean-valued function.
We will be interested in the following problem and its related questions. Let i ε M, j ε N be …

This paper proposes a novel common subgraph extraction algorithm which aims to minimize
the total number of gates (reconfiguration area overhead) involved in implementing …

The problem of finding a minimum spanning tree connecting n points in a k-dimensional space
is discussed under three common distance metrics: Euclidean, rectilinear, and $L_\infty $…

We present exponential lower bounds on the size of depth-k Boolean circuits for computing
certain functions. These results imply that there exists an oracle set A such that, relative to A, …

The problem of storing and searching large sparse tables is ubiquitous in computer science.
The standard technique for storing such tables is hashing, but hashing has poor worst-case …

The purpose of this paper is to resolve several open problems in the current literature on
Boolean circuits, communication complexity, and hashing functions. These lower bound results …