IPL
2006
14 years 17 days ago
2006
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
IPL
2006
14 years 17 days ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
IPL
2006
14 years 17 days ago
2006
IPL
2006
14 years 17 days ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
IPL
2006
14 years 17 days ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
IPL
2006
14 years 17 days ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
IPL
2006
14 years 17 days ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
IPL
2006
14 years 17 days ago
2006
This paper introduces new specificity measuring methods of terms using inside and outside information. Specificity of a term is the quantity of domain specific information contain...
IPL
2006
14 years 17 days ago
2006
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
IPL
2006
14 years 17 days ago
2006
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. We show that to...