Sciweavers

    FOCS
    2007
    IEEE
    92views Theoretical Computer Science» more  FOCS 2007»
    Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
    14 years 7 months ago
    Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
    Download  research.microsoft.com
    We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
    Anna Gál, Parikshit Gopalan
    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.