Sciweavers

    10271 search results - page 386 / 2055
    » Computer Science
    Sort
    View
    80
    Voted
    SOFSEM
    2009
    Springer
    112views Theoretical Computer Science» more  SOFSEM 2009»
    Abstract Storage Devices
    16 years 1 months ago
    Abstract Storage Devices
    Download  www.sofsem.cz
    Storage Devices Robert K¨onig Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009
    Robert König, Ueli M. Maurer, Stefano Tessaro
    claim paper
    Read More »
    111
    Voted
    SOFSEM
    2009
    Springer
    112views Theoretical Computer Science» more  SOFSEM 2009»
    On Some SAT-Variants over Linear Formulas
    16 years 1 months ago
    On Some SAT-Variants over Linear Formulas
    Download  www.uni-ulm.de
    Informationen zum TheorieTag und Abstracts zu den Beitr¨agen finden Sie unter http://www.uni-ulm.de/in/theo/tt56.html.
    Stefan Porschen, Tatjana Schmidt
    claim paper
    Read More »
    STACS
    2010
    Springer
    205views Theoretical Computer Science» more  STACS 2010»
    The Traveling Salesman Problem under Squared Euclidean Distances
    15 years 11 months ago
    The Traveling Salesman Problem under Squared Euclidean Distances
    Download  www1.informatik.uni-wuerzburg.de
    The Traveling Salesman Problem Under Squared Euclidean Distances
    Fred van Nijnatten, René Sitters, Gerhard J...
    claim paper
    Read More »
    FOCS
    2009
    IEEE
    97views Theoretical Computer Science» more  FOCS 2009»
    Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
    15 years 11 months ago
    Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
    Download  web.mit.edu
    We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.
    Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madh...
    claim paper
    Read More »
    FOCS
    2009
    IEEE
    163views Theoretical Computer Science» more  FOCS 2009»
    Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
    15 years 11 months ago
    Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
    Download  www.openu.ac.il
    Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
    Zeev Nutov
    claim paper
    Read More »
    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.