Sciweavers

    13841 search results - page 2769 / 2769
    » Algorithms and Constraint Programming
    Sort
    View
    IANDC
    2008
    141views more  IANDC 2008»
    Graph connectivity, partial words, and a theorem of Fine and Wilf
    14 years 9 months ago
    Graph connectivity, partial words, and a theorem of Fine and Wilf
    Download  www.uncg.edu
    The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
    Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
    claim paper
    Read More »
    « Prev « First page 2769 / 2769 Last » Next »
    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-2025, USA.