-
2
-
-
84976831429
-
A distributed algorithm for minimum spanning tree
-
R. G. Gallager, P. A. Humblet, and P. M. Spira, A distributed algorithm for minimum spanning tree, ACM Transactions on Programming Languages and Systems, 5(1) (1983), 66-77.
-
(1983)
ACM Transactions on Programming Languages and Systems
, vol.5
, Issue.1
, pp. 66-77
-
-
Gallager, R.G.1
Humblet, P.A.2
Spira, P.M.3
-
3
-
-
84992367528
-
A new characterization of tree medians with applications to distributed algorithms
-
O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed algorithms, Networks 24(1) (1994) 23-29; also: Proceedings of the 18th International Workshop on Graph-Theoretic Concept in Computer Science (WG '92), Frankfurt, June 1992. LNCS 657, Springer-Verlag, Berlin, pp. 135-144.
-
(1994)
Networks
, vol.24
, Issue.1
, pp. 23-29
-
-
Gerstel, O.1
Zaks, S.2
-
4
-
-
84992367528
-
-
Frankfurt, June LNCS 657, Springer-Verlag, Berlin
-
O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed algorithms, Networks 24(1) (1994) 23-29; also: Proceedings of the 18th International Workshop on Graph-Theoretic Concept in Computer Science (WG '92), Frankfurt, June 1992. LNCS 657, Springer-Verlag, Berlin, pp. 135-144.
-
(1992)
Proceedings of the 18th International Workshop on Graph-Theoretic Concept in Computer Science (WG '92)
, pp. 135-144
-
-
-
5
-
-
0346074056
-
The bit complexity of distributed sorting
-
Bad Honnef, September LNCS 726, Spnnger-Verlag, Berlin
-
O. Gerstel and S. Zaks, The bit complexity of distributed sorting, Proceedings of the 1st Annual European Symposium on Algorithm (ESA '93), Bad Honnef, September 1993, LNCS 726, Spnnger-Verlag, Berlin, pp. 181-191.
-
(1993)
Proceedings of the 1st Annual European Symposium on Algorithm (ESA '93)
, pp. 181-191
-
-
Gerstel, O.1
Zaks, S.2
-
6
-
-
0347965494
-
Distributed algorithms for ranking the vertices of a network
-
E. Korach, D. Rotem, and N. Santoro, Distributed algorithms for ranking the vertices of a network, Proceedings of the 13th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 1982, pp. 235-246.
-
(1982)
Proceedings of the 13th Southeastern Conference on Combinatorics, Graph Theory, and Computing
, pp. 235-246
-
-
Korach, E.1
Rotem, D.2
Santoro, N.3
-
7
-
-
0021293041
-
The complexity of sorting in distributed systems
-
M. C. Loui, The complexity of sorting in distributed systems, Information and Control, 60(1-3) (1984), 70-85.
-
(1984)
Information and Control
, vol.60
, Issue.1-3
, pp. 70-85
-
-
Loui, M.C.1
-
8
-
-
0022044523
-
Optimal distributed algorithms for sorting and ranking
-
S. Zaks, Optimal distributed algorithms for sorting and ranking, IEEE Transactions on Computers, 34(4) (1985), 376-379.
-
(1985)
IEEE Transactions on Computers
, vol.34
, Issue.4
, pp. 376-379
-
-
Zaks, S.1
|