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

Active Bibliography

Using Learning and Difficulty of Prediction to Decrease Computation: A Fast Sort and Priority Queue on Entropy Bounded Inputs – Shenfeng Chen, John H. Reif
776 Compression of Individual Sequences via Variable-Rate Coding – Jacob Ziv, Abraham Lempel - 1978
869 A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks – Shafi Goldwasser, Silvio Micali, Ronald L. Rivest - 1995
501 The Quickhull algorithm for convex hulls – C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa - 1996
1923 Randomized Algorithms – Rajeev Motwani - 1995
551 Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks – Hui Zhang - 1995
1221 A universal algorithm for sequential data compression – Jacob Ziv, Abraham Lempel - 1977
716 Non-Uniform Random Variate Generation – Luc Devroye - 1986
700 Quantization – Robert M. Gray, David L. Neuhoff - 1998