Title of article
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
Author/Authors
Brendan Lucier، نويسنده , , Tao Jiang، نويسنده , , Ming Li، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2007
Pages
7
From page
45
To page
51
Keywords
Incompressibility , Kolmogorov complexity , QuickSort , analysis of algorithms , Binary insertion trees
Journal title
Information Processing Letters
Serial Year
2007
Journal title
Information Processing Letters
Record number
130448
Link To Document