5 - Permutations
Published online by Cambridge University Press: 05 September 2016
- Type
- Chapter
- Information
- Compact Data StructuresA Practical Approach, pp. 103 - 119Publisher: Cambridge University PressPrint publication year: 2016
References
and (2013). On compressing permutations and adaptive sorting. Theoretical Computer Science, 513, 109–123.Google Scholar
, , , , and (2014). Efficient fully-compressed sequence representations. Algorithmica, 69(1), 232–268.Google Scholar
(1993). On the maximum length of Huffman codes. Information Processing Letters, 45(5), 219–223.Google Scholar
, , , and (2015). Efficient and compact representations of prefix codes. IEEE Transactions on Information Theory, 61(9), 4999–5011.Google Scholar
(2009). Cell probe lower bounds for succinct data structures. In Proc. 20th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pages 625–634.Google Scholar
and (1976). Huffman codes and self-information. IEEE Transactions on Information Theory, 22(3), 337–340.Google Scholar
(1998). The Art of Computer Programming, volume 3: Sorting and Searching. Addison- Wesley, 2nd edition.
and (1990). A fast algorithm for optimal length-limited Huffman codes. Journal of the ACM, 37(3), 464–473.Google Scholar
and (1994). Sorting shuffled monotone sequences. Information and Computation, 112(1), 37–50.Google Scholar
(1985). Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers, 34, 318–325.Google Scholar
and (2001). Bounding the inefficiency of length-restricted prefix codes. Algorithmica, 31(4), 513–529.Google Scholar
and (1992). An overview of adaptive sorting. Australian Computer Journal, 24(2), 70–77.Google Scholar
, , , and (2012). Succinct representations of permutations and functions. Theoretical Computer Science, 438, 74–88.Google Scholar
, , and (1999). Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, 2nd edition.