SIROCCO
1997
13 years 5 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
SIROCCO
1997
13 years 5 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
SIROCCO
2000
13 years 5 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
SIROCCO
2000
13 years 5 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
SIROCCO
2000
13 years 5 months ago
2000
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
SIROCCO
2000
13 years 5 months ago
2000
SIROCCO
1998
13 years 5 months ago
1998
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
SIROCCO
1998
13 years 5 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
SIROCCO
1998
13 years 5 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
SIROCCO
2003
13 years 5 months ago
2003
