Sciweavers

    STOC
    1991
    ACM
    167views Algorithms» more  STOC 1991»
    Counting Networks and Multi-Processor Coordination
    15 years 9 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 »
    COCO
    1991
    Springer
    173views Algorithms» more  COCO 1991»
    On the Random-Self-Reducibility of Complete Sets
    15 years 9 months ago
    On the Random-Self-Reducibility of Complete Sets
    Download  people.cs.uchicago.edu
    Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
    Joan Feigenbaum, Lance Fortnow
    claim paper
    Read More »
    165
    Voted
    COCO
    1991
    Springer
    112views Algorithms» more  COCO 1991»
    Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
    15 years 9 months ago
    Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
    Download  www.math.ias.edu
    We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
    Rafi Heiman, Avi Wigderson
    claim paper
    Read More »
    159
    Voted
    STOC
    1991
    ACM
    93views Algorithms» more  STOC 1991»
    Rounds in Communication Complexity Revisited
    15 years 9 months ago
    Rounds in Communication Complexity Revisited
    Download  www.math.ias.edu
    The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
    Noam Nisan, Avi Wigderson
    claim paper
    Read More »
    159
    Voted
    STOC
    1991
    ACM
    163views Algorithms» more  STOC 1991»
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    15 years 9 months ago
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    Download  www.combinatorics.net
    Tomás Feder, Rajeev Motwani
    claim paper
    Read More »
    All Subjects
    Algorithms
    Applied Computing
    Artificial Intelligence
    Automated Reasoning
    Communications
    Computational Geometry
    Computer Architecture
    Computer Graphics
    Computer Networks
    Control Systems
    Cryptology
    Database
    Discrete Geometry
    Distributed And Parallel Computing
    Document Analysis
    Education
    Formal Methods
    Hardware
    Information Technology
    Internet Technology
    Knowledge Management
    Logical Reasoning
    Machine Learning
    Mathematics
    Modeling and Simulation
    Natural Language Processing
    Operating System
    Programming Languages
    Robotics
    Security Privacy
    Software Engineering
    Solid Modeling
    System Software
    Theoretical Computer Science
    Visual Languages
    Visualization
    Algorithms
    Top of PageReset Settings
    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.