Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
We define a new paradigm for distributed computing, almost-everywhere agreement, in which we require only that almost all correct processors reach consensus. Unlike the traditional Byzantine agreement problem, almost-everywhere agreement can be solved on networks of bounded degree. Specifically, we can simulate any sufficiently resilient Byzantine agreement algorithm on a network of bounded degree using our communication scheme described above. Although we 'lose' some correct processors, effectively treating them as faulty, the vast majority of correct processors decide on a common value.
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Eric Price, David P. Woodruff
FOCS 2011
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004