Sciweavers

    IPL
    2007
    100views more  IPL 2007»
    Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
    15 years 2 months ago
    Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
    Download  deron.csie.ncue.edu.tw
    We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
    Brendan Lucier, Tao Jiang, Ming Li
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.