Sciweavers

    19 search results - page 1 / 4
    » stacs 1999
    Sort
    View
    STACS
    1999
    Springer
    79views Theoretical Computer Science» more  STACS 1999»
    Some Undecidability Results Related to the Star Problem in Trace Monoids
    13 years 8 months ago
    Some Undecidability Results Related to the Star Problem in Trace Monoids
    Download  www2.informatik.hu-berlin.de
    Daniel Kirsten
    claim paper
    Read More »
    STACS
    1999
    Springer
    83views Theoretical Computer Science» more  STACS 1999»
    How to Forget a Secret
    13 years 8 months ago
    How to Forget a Secret
    Download  www.macfergus.com
    Giovanni Di Crescenzo, Niels Ferguson, Russell Imp...
    claim paper
    Read More »
    STACS
    1999
    Springer
    64views Theoretical Computer Science» more  STACS 1999»
    Supporting Increment and Decrement Operations in Balancing Networks
    13 years 8 months ago
    Supporting Increment and Decrement Operations in Balancing Networks
    Download  www.cs.rpi.edu
    William Aiello, Costas Busch, Maurice Herlihy, Mar...
    claim paper
    Read More »
    10
    Voted
    STACS
    1999
    Springer
    87views Theoretical Computer Science» more  STACS 1999»
    Upper Bounds for Vertex Cover Further Improved
    13 years 8 months ago
    Upper Bounds for Vertex Cover Further Improved
    Download  theinf1.informatik.uni-jena.de
    tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of G...
    Rolf Niedermeier, Peter Rossmanith
    claim paper
    Read More »
    STACS
    1999
    Springer
    108views Theoretical Computer Science» more  STACS 1999»
    In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
    13 years 8 months ago
    In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
    Download  www.cs.rutgers.edu
    Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
    Mario Szegedy
    claim paper
    Read More »
    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.