We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
Alysson Neves Bessani, Joni da Silva Fraga, Miguel...
Hashing technique have been widely adopted for various computer network applications such as IP address lookup and intrusion detection, among which XOR-hashing is one of most popu...
—This paper considers the medium access problem in the IEEE 802.11 standard. Although the transmission bit rates have clearly increased, some MAC related problems remain unsolved...
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...