We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
—In a distributed wireless network, it is possible to employ several relays and mimic a multiple antenna transmission system. In this paper we propose a MAC layer solution that a...
Pei Liu, Yuanpeng Liu, Thanasis Korakis, Anna Scag...