Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A typical behavior of some data compression schemesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal prefetching via data compressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal randomized parallel algorithms for computational geometryAlgorithmica, 1992
- On parallel integer sortingActa Informatica, 1992
- A logarithmic time sort for linear size networksJournal of the ACM, 1987
- Probabilistic Parallel Algorithms for Sorting and SelectionSIAM Journal on Computing, 1985
- An optimal parallel algorithm for integer sortingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977