Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs

by Shenfeng Chen , John H. Reif
Citations:17 - 4 self

Documents Related by Co-Citation

696 Art of Computer Programming Volume 3: Sorting and Searching – D E Knuth - 1998
1137 A universal algorithm for sequential data compression – Jacob Ziv, Abraham Lempel - 1977
27 On the Entropy of DNA: Algorithms and Measurements based on Memory and Rapid Convergence – Martin Farach, Michiel Noordewier, Serap Savari, Larry Shepp, Abraham Wyner, Jacob Ziv - 1994
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
9 Prefixes and the Entropy Rate for Long-Range Sources – Ioannis Kontoyiannis, Yurii M. Suhov - 1994
57 Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression – Aaron D Wyner, Jacob Ziv - 1989
69 Entropy and data compression schemes – Donald S Ornstein, Benjamin Weiss - 1993
8569 Elements of Information Theory – T M Cover, J A Thomas - 1991
15 Entropy and prefixes – P C Shields - 1992
22 Estimating the Information Content of Symbol Sequences and Efficient Codes – P Grassberger - 1989
203 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
57 Asymptotical growth of a class of random trees – B PITTEL - 1985
36 The Entropy Of English Using Ppm-Based Models – W. J. Teahan, John G. Cleary - 1996
46 Priority queues: Small, monotone and trans-dichotomous – R Raman - 1996
115 Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters – P van - 1977
149 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
87 Log-logarithmic worst-case range queries are possible in space Theta(N – D E Willard - 1983
35 Sublogarithmic Searching Without Multiplications – Arne Andersson - 1995
6 The ergodic theorem for a sequence of functions – P T Maker - 1940