PODC
2006
ACM
13 years 11 months ago
2006
ACM
PODC
2006
ACM
13 years 11 months ago
2006
ACM
PODC
2006
ACM
13 years 11 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
PODC
2006
ACM
13 years 11 months ago
2006
ACM
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
PODC
2006
ACM
13 years 11 months ago
2006
ACM
Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, is extended inhere in two ways: First, the stack object is added to the fam...