Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
Blending attacks are a general class of traffic-based attacks, exemplified by the (n − 1)-attack. Adding memory or pools to mixes mitigates against such attacks, however there ...
Physical browsing is a mobile-device-based interaction method for pervasive computing. In this paper, we describe our research interests and experiences of physical browsing: the ...
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...