13 search results - page 2 / 3 » spaa 2000 |
104
Voted
SPAA
2000
ACM
15 years 7 months ago
2000
ACM
100
Voted
SPAA
2000
ACM
15 years 6 months ago
2000
ACM
Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment...
103
Voted
SPAA
2000
ACM
15 years 7 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
134
Voted
SPAA
2000
ACM
15 years 7 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
140
Voted
SPAA
2000
ACM
15 years 6 months ago
2000
ACM
Modern VLSI processing supports a two-dimensional surface for active devices along with multiple stacked layers of interconnect. With the advent of planarization, the number of la...