Sankar Basu
Journal of the Franklin Institute
In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
Sankar Basu
Journal of the Franklin Institute
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Nimrod Megiddo
Journal of Symbolic Computation