This web page lists papers citing my paper:

"Further Gossip Problems" with D.J. Kleitman, Discrete Mathematics, 30(1980), p.151-156.

• R. T. Bumby, "A Problem with Telephones", Siam Journal of Algebraic and Discrete Methods, 2(1981), p. 13-18.
• D. B. West, "A Class of Solutions to the Gossip Problem, Part I", Discrete Mathematics, 39(1982), p. 307-326.
• D. B. West, "Gossiping Without Duplicate Transmissions", Siam Journal of Algebraic and Discrete Methods, 3(1982), p. 418-419.
• S. F. Assmann and D. J. Kleitman, "The Number of Rounds Needed to Exchange Information Within a Graph", Discrete Applied Mathematics, 6(1983), p. 117-125.
• A. L. Liestman and D. Richards, "Toward Optimal Gossiping Schemes with Conference Calls", Discrete Applied Mathematics, 7(1984), p. 183-189.
• K. A. Berman and M. Hawrylycz, "Telephone Problems with Failures", Siam Journal on Algebraic and Discrete Methods, 7(1986), p. 13-17.
• A. Seress, "Quick Gossiping without Duplicate Transmissions", Graphs and Combinatorics, 2(1986), p. 363-381.
• S. M. Hedetniemi, S. T. Hedetniemi and A. L. Liestman, "A Survey of Gossiping and Broadcasting in Communication-Networks", Networks, 18(1988), p. 319-349.
• G. Burosh, V. K. Leontiev and A. S. Markosian, "On the Possibility of Extending Information on Graphs", Doklady Akademi Nauk SSSR, 298(1988), p. 265-268.
• F. Gobel, J. O. Cerdeira and H. J. Veldman, "Label-Connected Graphs and the Gossip Problem", Discrete Mathematics, 87(1991), p. 29-40.
• H. M. Lee and G. J. Chang, "Set to Set Broadcasting in Communications-Networks", Discrete Applied Mathematics, 40(1992), p. 411-421.
• R. Labahn, "Information Flows on Hypergraphs", Discrete Mathematics, 113(1993), p. 71-97.
• J. Blazewizc, J. Brzezinski and G. Gambosi, "Graph Theoretic Issues in Computer Networks", European Journal of Operations Research, 71(1993), p. 1-16.
• K. Ravishankar and S. Singh, "Broadcasting On (0,L)" Discrete Applied Mathematics, 53(1994), p. 299-319.
• K. Ravishankar and S. Singh, "Asymptotically Optimal Gossiping in Radio Networks", Discrete Applied Mathematics, 61(1995), p. 61-82.
• R. Labahn, "Kernels of minimun size gossip schemes", Discrete Mathematics, 143(1995), p. 99-139.
• K. Ravishankar and S. Singh, "Gossiping on a Ring with Radios", Parallel Processing Letters, 6(1996), p. 115-126.
• K. A. Berman, "Vulnerability of Scheduled Networks and a Generalization of Mengers Theorem", Networks, 28(1996), p. 125-134.
• G. T. Chang and Y. Tsay, "The partial gossiping problem", Discrete Mathematics, 148(1996), 9-14.
• D. W. Krumme, "Reordered gossip schemes", Discrete Mathematics, 156(1996), p. 113-140.
• L. Gargano and A. A. Rescigno, "Communication complexity of fault-tolerant information diffusion", Theoretical Computer Science, 209(1998), p. 195-211.