Sciweavers

    STOC
    2007
    ACM
    127views Algorithms» more  STOC 2007»
    First to market is not everything: an analysis of preferential attachment with fitness
    14 years 11 months ago
    First to market is not everything: an analysis of preferential attachment with fitness
    Download  research.microsoft.com
    The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
    Christian Borgs, Jennifer T. Chayes, Constantinos ...
    claim paper
    Read More »
    STOC
    2007
    ACM
    133views Algorithms» more  STOC 2007»
    Interpolation of depth-3 arithmetic circuits with two multiplication gates
    14 years 11 months ago
    Interpolation of depth-3 arithmetic circuits with two multiplication gates
    Download  www.cs.technion.ac.il
    In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
    Amir Shpilka
    claim paper
    Read More »
    STOC
    2007
    ACM
    111views Algorithms» more  STOC 2007»
    Low-end uniform hardness vs. randomness tradeoffs for AM
    14 years 11 months ago
    Low-end uniform hardness vs. randomness tradeoffs for AM
    Download  eccc.hpi-web.de
    In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
    Ronen Shaltiel, Christopher Umans
    claim paper
    Read More »
    STOC
    2007
    ACM
    117views Algorithms» more  STOC 2007»
    Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
    14 years 11 months ago
    Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
    Download  eccc.hpi-web.de
    We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
    Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
    claim paper
    Read More »
    STOC
    2007
    ACM
    121views Algorithms» more  STOC 2007»
    An efficient parallel repetition theorem for Arthur-Merlin games
    14 years 11 months ago
    An efficient parallel repetition theorem for Arthur-Merlin games
    Download  www.iacr.org
    Rafael Pass, Muthuramakrishnan Venkitasubramaniam
    claim paper
    Read More »
    STOC
    2007
    ACM
    100views Algorithms» more  STOC 2007»
    Linear probing with constant independence
    14 years 11 months ago
    Linear probing with constant independence
    Download  www.it-c.dk
    Anna Pagh, Rasmus Pagh, Milan Ruzic
    claim paper
    Read More »
    STOC
    2007
    ACM
    97views Algorithms» more  STOC 2007»
    Search via quantum walk
    14 years 11 months ago
    Search via quantum walk
    Download  www.lri.fr
    Frédéric Magniez, Ashwin Nayak, Jere...
    claim paper
    Read More »
    STOC
    2007
    ACM
    84views Algorithms» more  STOC 2007»
    Lower bounds in communication complexity based on factorization norms
    14 years 11 months ago
    Lower bounds in communication complexity based on factorization norms
    Download  www.cs.huji.ac.il
    We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
    Nati Linial, Adi Shraibman
    claim paper
    Read More »
    STOC
    2007
    ACM
    181views Algorithms» more  STOC 2007»
    How to rank with few errors
    14 years 11 months ago
    How to rank with few errors
    Download  cs.brown.edu
    We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
    Claire Kenyon-Mathieu, Warren Schudy
    claim paper
    Read More »
    STOC
    2007
    ACM
    116views Algorithms» more  STOC 2007»
    On achieving the "best of both worlds" in secure multiparty computation
    14 years 11 months ago
    On achieving the "best of both worlds" in secure multiparty computation
    Download  eprint.iacr.org
    Jonathan Katz
    claim paper
    Read More »
    1234567next ›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.