Sciweavers

    4612 search results - page 923 / 923
    » More Communications
    Sort
    View
    IANDC
    2008
    141views more  IANDC 2008»
    Graph connectivity, partial words, and a theorem of Fine and Wilf
    13 years 7 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 »
    SIAMCOMP
    2002
    138views more  SIAMCOMP 2002»
    Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
    13 years 7 months ago
    Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
    Download  www.math.uni-frankfurt.de
    We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
    Hsien-Kuei Hwang, Ralph Neininger
    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.