8838 search results - page 1583 / 1768 » Generalizing Domain Theory |
193
click to vote
PODC
2006
ACM
15 years 12 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...
160
click to vote
PODC
2006
ACM
15 years 12 months 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 ...
174
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
164
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
187
click to vote
SACMAT
2006
ACM
15 years 12 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...