3052 search results - page 4 / 611 » Weakly Distributive Domains |
84
Voted
ICDCS
1999
IEEE
15 years 5 months ago
1999
IEEE
PODC
2005
ACM
15 years 6 months ago
2005
ACM
PODC
2004
ACM
15 years 6 months ago
2004
ACM
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
107
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...