Sciweavers

    STOC   1991 Annual ACM Symposium on Theory of Computing
    Wall of Fame | Most Viewed STOC-1991 Paper
    STOC
    1991
    ACM
    167views Algorithms» more  STOC 1991»
    Counting Networks and Multi-Processor Coordination
    13 years 8 months ago
    Counting Networks and Multi-Processor Coordination
    Download  www.hpl.hp.com
    d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
    James Aspnes, Maurice Herlihy, Nir Shavit
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source167
    Counting Networks and Multi-Processor Coordination
    claim
    2Download preprint from source163
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    claim
    3Download preprint from source127
    Lower Bounds for Randomized k-Server and Motion Planning Algorithms
    claim
    4Download preprint from source126
    Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
    claim
    5Download preprint from source109
    Checking Computations in Polylogarithmic Time
    claim
    6Download preprint from source105
    An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
    claim
    7Download preprint from source95
    Fast Approximation Algorithms for Multicommodity Flow Problems
    claim
    8Download preprint from source93
    Rounds in Communication Complexity Revisited
    claim
    9Download preprint from source89
    The Expressive Power of Voting Polynomials
    claim
    10Download preprint from source87
    Fast Monte Carlo Algorithms for Permutation Groups
    claim
    11Download preprint from source87
    Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
    claim
    12Download preprint from source85
    On Deterministic Approximation of DNF
    claim
    13Download preprint from source84
    Self-Testing/Correcting for Polynomials and for Approximate Functions
    claim
    14Download preprint from source75
    Probabilistic Recurrence Relations
    claim
    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.