Sciweavers

    23 search results - page 4 / 5
    » sigact 2008
    Sort
    View
    SIGACT
    2008
    50views more  SIGACT 2008»
    Transactions are back---but are they the same?: "Le Retour de Martin Guerre" (Sommersby)
    13 years 7 months ago
    Transactions are back---but are they the same?: "Le Retour de Martin Guerre" (Sommersby)
    Download  doc.rero.ch
    Pascal Felber, Christof Fetzer, Rachid Guerraoui, ...
    claim paper
    Read More »
    SIGACT
    2008
    71views more  SIGACT 2008»
    Theory research at Google
    13 years 7 months ago
    Theory research at Google
    Download  www.cs.huji.ac.il
    Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal...
    claim paper
    Read More »
    SIGACT
    2002
    61views more  SIGACT 2002»
    Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
    13 years 7 months ago
    Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
    Download  people.csail.mit.edu
    When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all ...
    Seth Gilbert, Nancy A. Lynch
    claim paper
    Read More »
    SIGACT
    2008
    116views more  SIGACT 2008»
    On-line bipartite matching made simple
    13 years 7 months ago
    On-line bipartite matching made simple
    Download  www.cs.washington.edu
    We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
    Benjamin E. Birnbaum, Claire Mathieu
    claim paper
    Read More »
    SIGACT
    2010
    74views more  SIGACT 2010»
    Typically-correct derandomization
    13 years 6 months ago
    Typically-correct derandomization
    Download  cs.haifa.ac.il
    A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
    Ronen Shaltiel
    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.