Sciweavers

    11395 search results - page 141 / 2279
    » Beyond computer science
    Sort
    View
    FOCS
    2002
    IEEE
    116views Theoretical Computer Science» more  FOCS 2002»
    The Parameterized Complexity of Counting Problems
    15 years 11 months ago
    The Parameterized Complexity of Counting Problems
    Download  www2.informatik.hu-berlin.de
    Jörg Flum, Martin Grohe
    claim paper
    Read More »
    FOCS
    2002
    IEEE
    76views Theoretical Computer Science» more  FOCS 2002»
    On Random Symmetric Travelling Salesman Problems
    15 years 11 months ago
    On Random Symmetric Travelling Salesman Problems
    Download  www.math.cmu.edu
    Alan M. Frieze
    claim paper
    Read More »
    FOCS
    2002
    IEEE
    78views Theoretical Computer Science» more  FOCS 2002»
    An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree
    15 years 11 months ago
    An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree
    Download  dcg.ethz.ch
    Seth Pettie
    claim paper
    Read More »
    CSR
    2010
    Springer
    86views Theoretical Computer Science» more  CSR 2010»
    Monotone Complexity of a Pair
    15 years 11 months ago
    Monotone Complexity of a Pair
    Download  www.lif.univ-mrs.fr
    Pavel Karpovich
    claim paper
    Read More »
    CSR
    2010
    Springer
    101views Theoretical Computer Science» more  CSR 2010»
    Time Optimal d-List Colouring of a Graph
    15 years 11 months ago
    Time Optimal d-List Colouring of a Graph
    Download  logic.pdmi.ras.ru
    Nick Gravin
    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.