1830 search results - page 201 / 366 » Workshop on Graph Computation Models |
169
Voted
SAC
2005
ACM
15 years 11 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
161
Voted
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
138
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
159
click to vote
PODC
1990
ACM
15 years 10 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...
186
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...