658 search results - page 10 / 132 » Lower bounds for sorting networks |
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
Gossiping is an information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...