1528 search results - page 111 / 306 » On Signatures for Communication Graphs |
149
click to vote
PODC
1990
ACM
15 years 9 months ago
1990
ACM
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
166
Voted
OPODIS
2004
15 years 6 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
171
click to vote
HIPEAC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
157
click to vote
PODC
2006
ACM
15 years 11 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...
125
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...