Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

INFOCOM
2009
IEEE

147views Communications» more INFOCOM 2009»

Using Three States for Binary Consensus on Complete Graphs

15 years 9 months ago

Using Three States for Binary Consensus on Complete Graphs

Download research.microsoft.com

Etienne Perron, Dinkar Vasudevan, Milan Vojnovic

Real-time Traffic

Communications | INFOCOM 2009 |

claim paper

Related Content

» Average LongLived Memoryless Consensus The ThreeValue Case

» On the Hardness of Planning Problems with Simple Causal Graphs

» The Complexity of Planning Problems With Simple Causal Graphs

» The monadic secondorder logic of graphs XV On a conjecture by D Seese

» Modular Consensus Algorithms for the CrashRecovery Model

» Tracking on a graph

» Homomorphisms and edgecolourings of planar graphs

» SAT based ATPG using fast justification and propagation in the implication graph

» Model Checking Historical Perspective and Example Extended Abstract

Post Info
More Details (n/a)

Added	24 May 2010
Updated	24 May 2010
Type	Conference
Year	2009
Where	INFOCOM
Authors	Etienne Perron, Dinkar Vasudevan, Milan Vojnovic

Comments (0)