14084 search results - page 2573 / 2817 » A Theory for Game Theories |
159
click to vote
PLDI
2006
ACM
16 years 17 days ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
212
click to vote
PODC
2006
ACM
16 years 17 days 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...
153
click to vote
PODC
2006
ACM
16 years 17 days 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...
179
Voted
PODC
2006
ACM
16 years 17 days ago
2006
ACM
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
205
click to vote
PODC
2006
ACM
16 years 17 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...