R. G. Gallager, P. A. Humblet, and P. M. Spira, "A Distributed Algorithm for Minimum-Weight Spanning Trees," in ACM Transactions on Programming Languages and Systems, vol. 5, no. 1, January 1983, pp. 66--77. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Distributed Minimum Energy Data Gathering and - Aggregation In Sensor (Correct)
No context found.
R. G. Gallager, P. A. Humblet, and P. M. Spira, "A Distributed Algorithm for Minimum-Weight Spanning Trees," in ACM Transactions on Programming Languages and Systems, vol. 5, no. 1, January 1983, pp. 66--77.
Linear Election for Oriented Hypercubes - Gerard Tel Department (1993) (6 citations) (Correct)
No context found.
Gallager, R. G., Humblet, P. A., and Spira, P. M. A distributed algorithm for minimum weight spanning trees. ACM Trans. Program. Lang. Syst. 5 (1983), 67--77.
Semantic Overlay Clusters within Super-Peer Networks - Löser, Naumann, Siberski.. (2003) (Correct)
No context found.
Gallager, Humblet, and Spira. A distributed algorithm for minimum weight spanning trees. In ACM Transactions on Programming Languages and Systems, volume 5-1, pages 66--77, 1983.
Power Efficient Data Gathering and Aggregation - In Wireless Sensor (Correct)
No context found.
R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM Transactions on Programming Languages and Systems, vol. 5, no. 1, pp. 66--77, January 1983.
Information Theory and Communication Networks: An.. - Ephremides, Hajek (1998) (33 citations) (Correct)
No context found.
R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM Trans. Programming Language Syst., vol. 5, pp. 66--77, 1983.
Trade-offs on the Location of the Core Node in a Network - Macq, Goemans (2004) (Correct)
No context found.
R.G. Gallager, P.M. Humblet, and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transact Program Languages Syst 5 (1983), 66 --77.
win and sin: Predicate Transformers for Concurrency - Lamport (1990) (22 citations) (Correct)
No context found.
Gallager, R. G., Humblet, P. A., and Spira, P. M. A distributed algorithm for minimumweight spanning trees. ACM Trans. Program. Lang. Syst. 5, 1 (Jan. 1983), 66--77.
A Theorem on Atomicity in Distributed Algorithms - Lamport (1988) (11 citations) (Correct)
No context found.
R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66--77, January 1983.
G-REMiT: An Algorithm for Building Energy Efficient Multicast.. - Wang, Gupta (2003) (Correct)
No context found.
R. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66--77, Jan. 1983.
On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc.. - Wang, Gupta (2003) (Correct)
No context found.
R. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. ACM Trans. Programming Lang. & Systems, 5(1):66--77, Jan. 1983.
S-REMiT: A Distributed Algorithm for Source-based Energy.. - Wang, Gupta (2003) (Correct)
No context found.
R. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum weight spanning trees," ACM Trans. Programming Lang. & Systems, vol. 5, no. 1, pp. 66--77, Jan. 1983.
Energy Efficient Broadcast in Wireless Ad hoc Networks.. - Agarwal, Cho, Gao, Wu (2004) (Correct)
No context found.
R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum-weight spanning trees. In ACM Transactions on Programming Languages and Systems, 1983.
Fast Construction of Overlay Networks - Angluin, Aspnes, Chen, Yin (2004) (4 citations) (Correct)
No context found.
R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst., 5(1):66-77, 1983.
Forming Connected Topologies in Bluetooth Adhoc Networks - Guerin, Rank, Sarkar.. (2002) (2 citations) (Correct)
No context found.
R.G. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Languages and Systems, 5, 1983.
Finding Spanning Forests by Broadcasting - Chlebus, Golab, Kowalski (2002) (Correct)
No context found.
R.G. Gallager, P. Humblet, and P. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Languages and Sytems, 5 (1983) 66 - 77.
Computing Minimal Spanning Tree With The Active Programmable.. - Khan, Haque (2003) (Correct)
No context found.
R.G. Gallager, P.A. Humblet, and P.M. Spira, A distributed algorithm for minimum weight spanning trees, Tech. Rep. LIDS-P-906-A, Lab. Inform. Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA,Oct. 1979
Energy Efficient Broadcast in Wireless Ad hoc - Networks With Hitch-Hiking (Correct)
No context found.
R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum-weight spanning trees. In ACM Transactions on Programming Languages and Systems, 1983.
Distributed Algorithms - Boris Koldehofe Th (Correct)
No context found.
R.G. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66-77, January 1983.
Semantic Overlay Clusters within Super-Peer Networks - Löser, Naumann, Siberski.. (2003) (Correct)
No context found.
Gallager, Humblet, and Spira. A distributed algorithm for minimum weight spanning trees. In ACM Transactions on Programming Languages and Systems, volume 5-1, pages 66--77, 1983.
Modular Completeness - For Communication Closed (Correct)
No context found.
R.T. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM TOPLAS, 5(1):66--77, Jan 1983.
Kinetic Minimum-Power Routing and Clustering in - Mobile Ad-Hoc Networks (Correct)
No context found.
R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM Trans. on Prog. Lang. and Systems, Vol. 5, No. 1, pp. 66-77, Jan. 1983.
Design and Analysis of a Leader Election Algorithm for.. - Vasudevan, Towsley (2004) (Correct)
No context found.
R. Gallager, P. Humblet and P. Spira. A Distributed Algorithm for Minimum Weight Spanning Trees. In ACM Transactions on Programming Languages and Systems, vol.4, no.1, pages 66-77, January 1983.
Localized Low-Weight Graph and Its Applications in.. - Li, Wang, Wan, Song.. (Correct)
No context found.
R. Gallager, P. Humblet, and P. Spira, "A distributed algorithm for minimum weight spanning trees," ACM Trans. on Programming Languages and Systems, vol. 5, no. 1, pp. 66--77, 1983.
Semantic Overlay Clusters within Super-Peer Networks - Löser, Naumann, Siberski.. (2003) (Correct)
No context found.
Gallager, Humblet, and Spira. A distributed algorithm for minimum weight spanning trees. In ACM Transactions on Programming Languages and Systems, volume 5-1, pages 66--77, 1983.
Distributed Algorithms for Finding Central Paths in Tree Networks - Jennings (1999) (Correct)
No context found.
Gallager, R. G., Humblet, P. A. and Spira, P. M. (1983) A distributed algorithm for minimum weight spanning trees. ACM Trans. Program. Lang. Syst., 5, 66--77.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC