Sciweavers

    240
    Voted
    PODC
    1993
    ACM
    127views Distributed and Parallel Com...» more  PODC 1993»
    A Lower Bound on Wait-Free Counting
    15 years 10 months ago
    A Lower Bound on Wait-Free Counting
    Download  www.faculty.idc.ac.il
    A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
    Shlomo Moran, Gadi Taubenfeld
    claim paper
    Read More »
    130
    Voted
    PODC
    1993
    ACM
    94views Distributed and Parallel Com...» more  PODC 1993»
    On the Space Complexity of Randomized Synchronization
    15 years 10 months ago
    On the Space Complexity of Randomized Synchronization
    Download  www.cs.brown.edu
    Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    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.