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

@inproceedings{Chen1993UsingDO,
  title={Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs},
  author={Shenfeng Chen and John H. Reif},
  booktitle={FOCS},
  year={1993}
}
There is an upsurge in interest in the Markov model and also more general stationary ergodic stochastic distributions in theoretical computer science community recently (e.g. see [Vitter,KrishnanSl], [Karlin,Philips,Raghavan92], [Raghavan9 for use of Markov models for on-line algorithms, e.g., cashing and prefetching). Their results used the fact that compressible sources are predictable (and vise versa), and showed that on-line algorithms can improve their performance by prediction. Actual… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-9 of 9 references

F.Prins and J .H .Reif, Implementations of randomized sorting on large parallel machines

  • J. W .L.Hightower
  • SPAA Conference,
  • 1992

J.G.Cleary and I.H.Witten

  • T. C Bell
  • Tezt Compression, Prentice Hall Publisher,
  • 1990

Lempe 1 , A universal algorithm for sequential data compression

  • A.
  • IEEE Trans . Information Theory
  • 1981

expected behavior of typical suffix A fast probabilistic sorting algorithm

  • J. A. Storer
  • SIAM J . Comput .

Similar Papers

Loading similar papers…