Juraj Hromkovic, Ralf Klasing, Burkhard Monien, Regine Peine  Home/Search
Context Related
| unipaderborn.de/f...ossiping_Book.ps.Z deptinfo.labri.u...ssiping_Book.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unipaderborn.de/...communication (more) Homepages: J.Hromkovic |
Rate this article:      (best)Comment on this article |
Abstract: this article follows the aims stated above. The first section introduces this research area. The basic definitions are given and the fundamental, simple observations concerning the relations among the complexity measures defined are carefully explained. This section is (Update)
Cited by: More
Optimal Gossiping in Paths and Cycles - Francis Lau Department (Correct)
Fast Gossiping in Meshes/Tori with Bounded-Size Packets - Lau, Zhang (1997) (Correct)
Efficient Gossiping by Short Messages - Bermond, Gargano, al. (1994) (Correct)
Active bibliography (related documents): More All
2.7: Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
1.0: Dissemination of Information in Vertex-Disjoint Paths.. - Hromkovic, Klasing.. (1993) (Correct)
0.5: Optimal Algorithms for Broadcast and Gossip in the.. - Hromkovic, al. (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Gossiping in Vertex-Disjoint Paths Mode in.. - Hromkovic.. (1993) (Correct)
0.3: Broadcasting in a Wrapped Butterfly Network - Joshi, Vipranarayanan (2001) (Correct)
0.3: Effective Systolic Algorithms for Gossiping in Cycles and.. - Hromkovic, al. (1995) (Correct)
Related documents from co-citation: More All
67: A survey of gossiping and broadcasting in communication networks (context) - Hedetniemi, Hedetniemi et al. - 1988
61: Methods and problems of communication in usual networks (context) - Fraigniaud, Lazard - 1991
30: Gossiping in minimal time - Krumme, Cybenko et al. - 1992
BibTeX entry: (Update)
J. Hromkovic, R. Klasing, B. Monien, and R. Peine, "Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)," in Combinatorial Network Theory, pp. 125--212, D.-Z. Du and D.F. Hsu (Eds.), Kluwer Academic Publishers, Netherlands, 1996. http://citeseer.ist.psu.edu/hromkovic96dissemination.html More
@misc{ hromkovic96dissemination,
author = "J. Hromkovic and R. Klasing and B. Monien and R. Peine",
title = "Dissemination of Information in Interconnection Networks (Broadcasting
& Gossiping",
text = "J. Hromkovic, R. Klasing, B. Monien, and R. Peine, Dissemination of Information
in Interconnection Networks (Broadcasting & Gossiping), in Combinatorial
Network Theory, pp. 125--212, D.-Z. Du and D.F. Hsu (Eds.), Kluwer Academic
Publishers, Netherlands, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/hromkovic96dissemination.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1968
624 The algebraic eigenvalue problem (context) - Wilkinson - 1965
184 A survey of gossiping and broadcasting in communication netw.. (context) - Hedetniemi, Hedetniemi et al. - 1988
127 A group-theoretic model for symmetric interconnection networ.. (context) - Akers, Krishnamurthy - 1989
118 Methods and problems of communication in usual networks (context) - Fraigniaud, Lazard - 1991
61 Embedding one Interconnection Network in Another (context) - Monien, Sudborough - 1990
48 Gossiping in minimal time - Cybenko, Krumme et al. - 1992
48 Group action graphs and parallel architectures (context) - Annexstein, Baumslag et al. - 1990
46 An adaptation of the Fast Fourier transform for parallel pro.. (context) - Pease - 1968
38 de Bruijn multiprocessor network: a versatile parallel proce.. (context) - Samatham, Pradhan - 1989
35 New gossips and telephones (context) - Knodel - 1975
30 Optimal algorithms for dissemination of information in some .. - Hromkovic, Jeschke et al. - 1990
30 Optimal algorithms for dissemination of information in gener.. - Feldmann, Hromkovic et al. - 1992
30 Minimum-Time Line Broadcast Networks (context) - Farley - 1980
30 Optimal algorithms for dissemination of information in some .. - Hromkovic, Jeschke et al.
29 the number of rounds necessary to disseminate information - Even, Monien - 1989
29 De Bruijn and Kautz networks: a competitor for the hypercube (context) - Bermond, Peyrat - 1989
28 A combinatorial problem (context) - De Bruijn - 1946
26 Rinehart and Winston (context) - Brown, Purdom et al. - 1985
23 Broadcasting in bounded degree graphs (context) - Bermond, Hell et al. - 1992
20 Fast gossiping for the hypercube - Krumme - 1992
18 Broadcast networks of bounded degree (context) - Liestman, Peters - 1988
16 Generalization of broadcasting and gossiping (context) - Richards, Liestman - 1988
14 Optimal broadcasting on the star graph (context) - Mendia, Sarkar - 1990
13 A cure for the telephone disease (context) - Hajnal, Milner et al. - 1972
11 The Cube-Connected Cycles Network is a Subgraph of the Butte.. - Feldmann, Unger - 1992
11 Gossips and telegraphs (context) - Entringer, Slater - 1979
8 Gossiping in grid graphs (context) - Farley, Proskurowski - 1980
8 Broadcasting in recursively decomposable Cayley graphs (context) - Gowrisankaran - 1992
7 Fast information sharing in a complete network - Sunderam, Winkler - 1993
7 Broadcasting and spanning trees in de Bruijn and Kautz netwo.. (context) - Heydemann, Opatrny et al. - 1991
6 Quick gossiping by multi-telegraphs (context) - Labahn, Warnke - 1990
4 Compressing cube-connected cycles and butterfly networks - Klasing, Luling et al. - 1990
4 Parallel algorithms for gossiping by mail (context) - Bagchi, Hakimi et al. - 1990
4 Decomposing hierarchical Cayley graphs, with applications to.. (context) - Berthom'e, Ferreira et al. - 1992
4 Broadcasting in Butterfly and DeBruijn networks - Klasing, Monien et al. - 1992
4 Simultaneous broadcasting in multiprocessor networks (context) - Cybenko, Krumme et al. - 1986
2 the broadcast time of the butterfly network (context) - Stohr - 1991
2 Broadcasting in the butterfly network (context) - Stohr - 1991
2 Broadcasting in deBruijn networks (context) - Bermond, Peyrat - 1988
2 Time Bounds for Broadcasting in Bounded Degree Graphs (context) - Capocelli, Gargano et al. - 1989
1 personal communication (context) - Djelloul, Sotteau - 1993
1 An upper bound for broadcasting in the butterfly network (context) - Stohr
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/communication.html): More
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
Gossiping in Vertex-Disjoint Paths Mode in.. - Hromkovic.. (1993) (Correct)
Note on Optimal Gossiping in some Weak-Connected Graphs - Hromkovic, Jeschke, Monien (Correct)
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