Skip to main content
  • An Upper Bound on the Convergence Time for Distributed Binary Voting on an Arbitrary Graph

  • Posted in Posters : Thursday, December 1, 2011

    The problem of interest in this work is the convergence time of the distributed binary consensus algorithm proposed by Benezit et al 1, which the nodes can update their states by communicating with neighbors via a 2-\xad?bit message in an asynchronous setting.

    Part of 2011 NSF Site VisitPoster Session


    /docs/poster-111201-shang.pdf

Copyright © Purdue University, all rights reserved. Purdue University is an equal access/equal opportunity university.

Contact the College of Science at sciencehelp@purdue.edu for trouble accessing this page. Made possible by grant NSF CCF-0939370