Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Michael Borokhovich, Chen Avin, Zvi Lotker. Bounds for algebraic gossip on graphs. Random Struct. Algorithms, 45(2):185-217, 2014. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Tight bounds for algebraic gossip on graphsMichael Borokhovich, Chen Avin, Zvi Lotker. isit 2010: 1758-1762 [doi]
The following publications are possibly variants of this publication: