Sciweavers

    121
    Voted
    JACM
    2008
    90views more  JACM 2008»
    Bit complexity of breaking and achieving symmetry in chains and rings
    15 years 2 months ago
    Bit complexity of breaking and achieving symmetry in chains and rings
    Download  www.cs.technion.ac.il
    We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
    Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.