Sciweavers

85
Voted
PODC
2004
ACM
15 years 7 months ago
On spectrum sharing games
Magnús M. Halldórsson, Joseph Y. Hal...
PODC
2004
ACM
15 years 7 months ago
On the design of distributed protocols from differential equations
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
Indranil Gupta
110
Voted
PODC
2004
ACM
15 years 7 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
124
Voted
PODC
2004
ACM
15 years 7 months ago
Gradient clock synchronization
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
Rui Fan, Nancy A. Lynch
59
Voted
PODC
2004
ACM
15 years 7 months ago
Eclecticism shrinks even small worlds
Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
71
Voted
PODC
2004
ACM
15 years 7 months ago
Lock-free linked lists and skip lists
Mikhail Fomitchev, Eric Ruppert
86
Voted
PODC
2004
ACM
15 years 7 months ago
Bringing practical lock-free synchronization to 64-bit applications
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems an...
Simon Doherty, Maurice Herlihy, Victor Luchangco, ...
106
Voted
PODC
2004
ACM
15 years 7 months ago
On the inherent weakness of conditional synchronization primitives
Faith Ellen Fich, Danny Hendler, Nir Shavit
82
Voted
PODC
2004
ACM
15 years 7 months ago
The weakest failure detectors to solve certain fundamental problems in distributed computing
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
115
Voted
PODC
2004
ACM
15 years 7 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen