Sciweavers

    SWAT
    2010
    Springer
    270views Algorithms» more  SWAT 2010»
    An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
    13 years 9 months ago
    An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
    Download  cgm.cs.mcgill.ca
    We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
    Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
    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.