Sciweavers

PODC
2006
ACM
14 years 6 months ago
Oracle size: a new measure of difficulty for communication tasks
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
PODC
2006
ACM
14 years 6 months ago
Local approximation schemes for topology control
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...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
PODC
2006
ACM
14 years 6 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
PODC
2006
ACM
14 years 6 months ago
Adversarial queuing on the multiple-access channel
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...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....
PODC
2006
ACM
14 years 6 months ago
Veracity radius: capturing the locality of distributed computations
Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schus...
PODC
2006
ACM
14 years 6 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
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...
Bogdan Caprita, Jason Nieh, Clifford Stein
PODC
2006
ACM
14 years 6 months ago
Stably computable predicates are semilinear
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...
Dana Angluin, James Aspnes, David Eisenstat
PODC
2006
ACM
14 years 6 months ago
Synchronizing without locks is inherently expensive
Hagit Attiya, Rachid Guerraoui, Danny Hendler, Pet...
PODC
2006
ACM
14 years 6 months ago
Common2 extended to stacks and unbounded concurrency
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...
Yehuda Afek, Eli Gafni, Adam Morrison