Data Compression

• K. Sadakane and H. Imai: An Improved Algorithm for Searching the Longest-Match String Used in Data Compression --- applications of databases, in Proceedings of Advanced Databases Matsue Workshop, pp. 333-338, Sept. 1996, ??, (in Japanese). Abstract Paper(ps)
• K. Sadakane: An Improvement on Hash-Based Algorithms for Searching the Longest-Match String Used in LZ77-type Data Compression, IPSJ SIG Notes 97-AL-56-8, IPSJ, Mar. 1997. Abstract Paper(ps)
• K. Sadakane: A Variation of Data Compression Scheme Based on Context Similarity and Implementation Using Suffix Tree, IPSJ SIG Notes 97-AL-56-9, IPSJ, Mar. 1997. Abstract Paper(ps)
• K. Sadakane: Text Compression Using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM*, in Proceedings of Compression and Complexity of SEQUENCES 1997, pages , June 1997. Abstract Paper(ps)
• K. Sadakane: On a Compression Scheme Using Recency Rank with Context, IEICE Technical Report on Information Theory IT97-38, IEICE, July 1997, (in Japanese). Abstract Paper(ps)
• K. Sadakane: Comparison among Suffix Array Construction Algorithms, IPSJ SIG Notes 97-AL-59-2, IPSJ, Nov. 1997. Abstract Paper(ps)
• K. Sadakane: On Optimality of Variants of Block Sorting Compression, in Proceedings of 20th Symposium on Information Theory and its Applications, pp. 357-360, Dec. 1997, SITA. Abstract Paper(ps)
• K. Sadakane: On Optimality of Variants of the Block Sorting Compression, in Proceedings of Data Compression Conference (DCC'98), p. 570, Mar. 1998. Abstract Paper(ps)
• K. Sadakane: A Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation, in Proceedings of Data Compression Conference (DCC'98), pp. 129-138, Mar. 1998. Abstract Paper(ps)