-
1
-
-
0031634978
-
Communication-optimal parallel minimum spanning tree algorithms
-
M. ADLER, W. DITTRICH, B. JUURLINK, M. KUTYLOWSKI, AND I. RIEPING, Communication-optimal parallel minimum spanning tree algorithms, in Proceedings of the 1998 ACM Symposium on Parallel Algorithms and Architecture, 1998, pp. 27-36.
-
(1998)
Proceedings of the 1998 ACM Symposium on Parallel Algorithms and Architecture
, pp. 27-36
-
-
Adler, M.1
Dittrich, W.2
Juurlink, B.3
Kutylowski, M.4
Rieping, I.5
-
2
-
-
0022144867
-
Complexity of network synchronization
-
B. AWERBUCH, Complexity of network synchronization, J. ACM, 32 (1985), pp. 804-823.
-
(1985)
J. ACM
, vol.32
, pp. 804-823
-
-
Awerbuch, B.1
-
3
-
-
0023581508
-
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems
-
B. AWERBUCH, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 230-240.
-
(1987)
Proceedings of the 19th Annual ACM Symposium on Theory of Computing
, pp. 230-240
-
-
Awerbuch, B.1
-
4
-
-
0000019758
-
New connectivity and MSF algorithms for the shuffle-exchange network and PRAM
-
B. AWERBUCH AND Y. SHILOACH, New connectivity and MSF algorithms for the shuffle-exchange network and PRAM, IEEE Trans. Comput., 36 (1987), pp. 1258-1263.
-
(1987)
IEEE Trans. Comput.
, vol.36
, pp. 1258-1263
-
-
Awerbuch, B.1
Shiloach, Y.2
-
5
-
-
0030387155
-
Finding minimum spanning forests in logarithmic time and linear work using random sampling
-
R. COLE, P. N. KLEIN, AND R. E. TRAJAN, Finding minimum spanning forests in logarithmic time and linear work using random sampling, in Proceedings of the ACM Symposium on Parallel Algorithms and Architecture, 1996, pp. 243-250.
-
(1996)
Proceedings of the ACM Symposium on Parallel Algorithms and Architecture
, pp. 243-250
-
-
Cole, R.1
Klein, P.N.2
Trajan, R.E.3
-
6
-
-
84976831429
-
A distributed algorithm for minimum-weight spanning trees
-
R. G. GALLAGER, P. A. HUMBLET, AND P. M. SPIRA, A distributed algorithm for minimum-weight spanning trees, ACM Trans. Prog. Lang. and Syst., 5 (1983), pp. 66-77.
-
(1983)
ACM Trans. Prog. Lang. and Syst.
, vol.5
, pp. 66-77
-
-
Gallager, R.G.1
Humblet, P.A.2
Spira, P.M.3
-
7
-
-
0000601523
-
A sublinear time distributed algorithm for minimum-weight spanning trees
-
J. A. GARAY, S. KUTTEN, AND D. PELEG, A sublinear time distributed algorithm for minimum-weight spanning trees, SIAM J. Comput., 27 (1998), pp. 302-316.
-
(1998)
SIAM J. Comput.
, vol.27
, pp. 302-316
-
-
Garay, J.A.1
Kutten, S.2
Peleg, D.3
-
8
-
-
84975880325
-
Overcast: Reliable multicasting with an overlay network
-
J. JANNOTTI, D. GIFFORD, K. L. JOHNSON, M. F. KAASHOEK, AND J. J. W. O'TOOLE, Overcast: Reliable multicasting with an overlay network, in Proceedings of the 4th Annual USENIX OSDI, 2000, pp. 197-212.
-
(2000)
Proceedings of the 4th Annual USENIX OSDI
, pp. 197-212
-
-
Jannotti, J.1
Gifford, D.2
Johnson, K.L.3
Kaashoek, M.F.4
O'Toole, J.J.W.5
-
9
-
-
0029276335
-
A randomized linear time algorithm to find minimum spanning trees
-
D. R. KARGER, P. N. KLEIN, AND R. E. TARJAN, A randomized linear time algorithm to find minimum spanning trees, J. ACM, 42 (1995), pp. 321-328.
-
(1995)
J. ACM
, vol.42
, pp. 321-328
-
-
Karger, D.R.1
Klein, P.N.2
Tarjan, R.E.3
-
10
-
-
0034776178
-
Distributed MST for constant diameter graphs
-
Z. LOTKER, B. PATT-SHAMIR, AND D. PELEG, Distributed MST for constant diameter graphs, in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, 2001, pp. 63-71.
-
(2001)
Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing
, pp. 63-71
-
-
Lotker, Z.1
Patt-Shamir, B.2
Peleg, D.3
-
12
-
-
0035188171
-
Near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
-
D. PELEG AND V. RUBINOVICH, Near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction, SIAM J. Comput., 30 (2000), pp. 1427-1442.
-
(2000)
SIAM J. Comput.
, vol.30
, pp. 1427-1442
-
-
Peleg, D.1
Rubinovich, V.2
-
13
-
-
84976845043
-
End-to-end arguments in system design
-
J. H. SALTZER, D. P. REED, AND D. D. CLARK, End-to-end arguments in system design, ACM Transactions on Computer Systems, 2 (1984), pp. 277-288.
-
(1984)
ACM Transactions on Computer Systems
, vol.2
, pp. 277-288
-
-
Saltzer, J.H.1
Reed, D.P.2
Clark, D.D.3
-
14
-
-
0002245383
-
Chord: A scalable peer-to-peer lookup service for internet applications
-
San Diego, CA
-
I. STOICA, R. MORRIS, D. KARGER, M. F. KAASHOEK, AND H. BALAKRISHNAN, Chord: A scalable peer-to-peer lookup service for internet applications, in Proceedings of the ACM SIGCOMM '01 Conference, San Diego, CA, 2001.
-
(2001)
Proceedings of the ACM SIGCOMM '01 Conference
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, M.F.4
Balakrishnan, H.5
|