Sciweavers

    ECCC
    2011
    223views ECommerce» more  ECCC 2011»
    A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
    12 years 11 months ago
    A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
    Download  eprint.iacr.org
    Gilad Asharov, Yehuda Lindell
    claim paper
    Read More »
    ECCC
    2011
    207views ECommerce» more  ECCC 2011»
    Balls and Bins: Smaller Hash Families and Faster Evaluation
    12 years 11 months ago
    Balls and Bins: Smaller Hash Families and Faster Evaluation
    Download  research.microsoft.com
    A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
    L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
    claim paper
    Read More »
    ECCC
    2011
    160views ECommerce» more  ECCC 2011»
    Robust Lower Bounds for Communication and Stream Computation
    12 years 11 months ago
    Robust Lower Bounds for Communication and Stream Computation
    Download  www.cs.umass.edu
    Amit Chakrabarti, Graham Cormode, Andrew McGregor
    claim paper
    Read More »
    ECCC
    2011
    185views ECommerce» more  ECCC 2011»
    Property Testing Lower Bounds via Communication Complexity
    12 years 11 months ago
    Property Testing Lower Bounds via Communication Complexity
    Download  web.mit.edu
    We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
    Eric Blais, Joshua Brody, Kevin Matulef
    claim paper
    Read More »
    ECCC
    2011
    323views ECommerce» more  ECCC 2011»
    A Linear-Optical Proof that the Permanent is #P-Hard
    12 years 11 months ago
    A Linear-Optical Proof that the Permanent is #P-Hard
    Download  www.scottaaronson.com
    Scott Aaronson
    claim paper
    Read More »
    ECCC
    2011
    180views ECommerce» more  ECCC 2011»
    Two Comments on Targeted Canonical Derandomizers
    12 years 11 months ago
    Two Comments on Targeted Canonical Derandomizers
    Download  www.wisdom.weizmann.ac.il
    We revisit the notion of a targeted canonical derandomizer, introduced in our recent ECCC Report (TR10-135) as a uniform notion of a pseudorandom generator that suffices for yield...
    Oded Goldreich
    claim paper
    Read More »
    ECCC
    2011
    202views ECommerce» more  ECCC 2011»
    New strong direct product results in communication complexity
    12 years 11 months ago
    New strong direct product results in communication complexity
    Download  www.comp.nus.edu.sg
    We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
    Rahul Jain
    claim paper
    Read More »
    ECCC
    2011
    183views ECommerce» more  ECCC 2011»
    Extractors and Lower Bounds for Locally Samplable Sources
    12 years 11 months ago
    Extractors and Lower Bounds for Locally Samplable Sources
    Download  www.cs.berkeley.edu
    We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
    Anindya De, Thomas Watson
    claim paper
    Read More »
    ECCC
    2011
    188views ECommerce» more  ECCC 2011»
    Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
    12 years 11 months ago
    Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
    Download  www.cs.utexas.edu
    Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
    Anna Gál, Andrew Mills
    claim paper
    Read More »
    ECCC
    2011
    205views ECommerce» more  ECCC 2011»
    Graphs of Bounded Treewidth can be Canonized in AC1
    12 years 11 months ago
    Graphs of Bounded Treewidth can be Canonized in AC1
    Download  www.uni-ulm.de
    In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
    Fabian Wagner
    claim paper
    Read More »
    « first‹ previous123next ›last »
    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.