We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
—An inherent problem to a cooperation incentive mechanism implemented into a dynamic system where peers may join or leave at any time is the whitewashing problem. Whitewashers ar...
We address the problem of minimum mean-squared error (MMSE) estimation where the estimator is constrained to belong to a prede ned set of functions. We derive a simple closed form...
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...