Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIROCCO
1997
12 years 3 months ago
Better Expanders and Superconcentrators by Kolmogorov Complexity
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...
Uwe Schöning
SIROCCO
1997
12 years 3 months ago
Static Frequency Assignment in Cellular Networks
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...
Lata Narayanan, Sunil M. Shende
SIROCCO
2000
12 years 3 months ago
Cooperative computing with fragmentable and mergeable groups
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...
Chryssis Georgiou, Alexander A. Shvartsman
SIROCCO
2000
12 years 3 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: 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...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
SIROCCO
2000
12 years 3 months ago
Lower bounds for (weak) sense of direction
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...
Paolo Boldi, Sebastiano Vigna
SIROCCO
2000
12 years 3 months ago
Consensus in byzantine asynchronous systems
Roberto Baldoni, Jean-Michel Hélary, Michel...
SIROCCO
1998
12 years 3 months ago
The counting pyramid: an adaptive distributed counting scheme
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...
Roger Wattenhofer, Peter Widmayer
SIROCCO
1998
12 years 3 months ago
Characterization results of all shortest paths interval routing schemes
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...
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...
SIROCCO
1998
12 years 3 months ago
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
Stefan Dobrev, Peter Ruzicka, Gerard Tel
books