Sciweavers

    STOC
    1996
    ACM
    97views Algorithms» more  STOC 1996»
    Deterministic Restrictions in Circuit Complexity
    13 years 8 months ago
    Deterministic Restrictions in Circuit Complexity
    Download  www.tcs.tifr.res.in
    We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
    Shiva Chaudhuri, Jaikumar Radhakrishnan
    claim paper
    Read More »
    STOC
    1996
    ACM
    185views Algorithms» more  STOC 1996»
    Adaptively Secure Multi-Party Computation
    13 years 8 months ago
    Adaptively Secure Multi-Party Computation
    Download  publications.csail.mit.edu
    A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
    Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
    claim paper
    Read More »
    STOC
    1996
    ACM
    95views Algorithms» more  STOC 1996»
    Pushing Disks Together - The Continuous-Motion Case
    13 years 8 months ago
    Pushing Disks Together - The Continuous-Motion Case
    Download  www.cs.ucla.edu
    If disks are moved so that each center
    Marshall W. Bern, Amit Sahai
    claim paper
    Read More »
    STOC
    1996
    ACM
    92views Algorithms» more  STOC 1996»
    Constructing Evolutionary Trees in the Presence of Polymorphic Characters
    13 years 8 months ago
    Constructing Evolutionary Trees in the Presence of Polymorphic Characters
    Download  www.lsi.upc.edu
    Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
    Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
    claim paper
    Read More »
    STOC
    1996
    ACM
    83views Algorithms» more  STOC 1996»
    Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs
    13 years 8 months ago
    Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs
    Download  www.inf.ethz.ch
    László Babai, Anna Gál, J&aac...
    claim paper
    Read More »
    STOC
    1996
    ACM
    86views Algorithms» more  STOC 1996»
    Modular Competitiveness for Distributed Algorithms
    13 years 8 months ago
    Modular Competitiveness for Distributed Algorithms
    Download  cs-www.cs.yale.edu
    James Aspnes, Orli Waarts
    claim paper
    Read More »
    STOC
    1996
    ACM
    101views Algorithms» more  STOC 1996»
    The Space Complexity of Approximating the Frequency Moments
    13 years 8 months ago
    The Space Complexity of Approximating the Frequency Moments
    Download  www.math.tau.ac.il
    The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
    Noga Alon, Yossi Matias, Mario Szegedy
    claim paper
    Read More »
    STOC
    1996
    ACM
    125views Algorithms» more  STOC 1996»
    Modular Coloring Formulas Are Hard for Cutting Planes Proofs
    13 years 8 months ago
    Modular Coloring Formulas Are Hard for Cutting Planes Proofs
    Download  www.cs.helsinki.fi
    Xudong Fu
    claim paper
    Read More »
    « first‹ previous12
    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.