5499 search results - page 998 / 1100 » Generalized Rewrite Theories |
97
Voted
PLDI
2006
ACM
15 years 6 months 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...
132
Voted
PODC
2006
ACM
15 years 6 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...
112
click to vote
PODC
2006
ACM
15 years 6 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 ...
118
click to vote
PODC
2006
ACM
15 years 6 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...
117
click to vote
PODC
2006
ACM
15 years 6 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...