Sciweavers

    PODC
    1993
    ACM
    127views Distributed and Parallel Com...» more  PODC 1993»
    A Lower Bound on Wait-Free Counting
    13 years 8 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 »
    PODC
    1993
    ACM
    94views Distributed and Parallel Com...» more  PODC 1993»
    On the Space Complexity of Randomized Synchronization
    13 years 8 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
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.