Other References from DCC

• S. Rein, C. Guhmann, and F.H.P. Fitzek, "Low-complexity compression of short messages," Proc. Data Compression Conference (2006) 123-132.
• P. Ratanaworabhan, Jian Ke, and M. Burtscher, "Fast lossless compression of scientific floating-point data," Proc. Data Compression Conference (2006) 133-142.
• Yonghui Wu, S. Lonardi, and W. Szpankowski, "Error-resilient LZW data compression," Proc. Data Compression Conference (2006) 193-202.
• M.D. Cao, T.I. Dix, L. Allison, C. Mears, "A simple statistical algorithm for biological sequence compression," Proc. Data Compression Conference (2007) 43-52.
• R. Nakamura, H. Bannai, S. Inenaga, and M. Takeda, "Simple linear-time off-line text compression by longesr-first substitution," Proc. Data Compression Conference (2007) 123-132.
• M. Burtscher and P. Ratanaworabhan, "High throughput compression of double-precision floating-point data," Proc. Data Compression Conference (2007) 293-302.
• M.T. Biskup, "Guaranteed synchronization of Huffman codes," Proc. Data Compression Conference (2008) 462-471.
• S.T. Klein and M.K. Ben-Nissan, "Using Fibonacci compression codes as alternatives to dense codes," Proc. Data Compression Conference (2008) 472-481.
• R. Dorrigiv, A. Lopez-Ortiz, and J.I. Munro, "List update algorithms for data compression," Proc. Data Compression Conference (2008) 512-512.
• S.A. Savari, "On minimum-redundancy fix-free codes," Proc. Data Compression Conference (2009) 3-12.
• T. Gagie, M. Karpinskim and Y. Nekrich, "Low-memory adaptive prefix coding," Proc. Data Compression Conference (2009) 13-22.
• J. Adiego, M.A. Martinez-Prieto, and P. de la Fuente, "High performance word-codeword mapping algorithm on PPM," Proc. Data Compression Conference (2009) 23-32.
• M.T. Biskup and W. Plandowski, "Guaranteed synchronization of Huffman codes with known position of decoder," Proc. Data Compression Conference (2009) 33-42.
• D. Shapira, "Compressed transitive delta encoding," Proc. Data Compression Conference (2009) 203-212.
• N. Abedini, S.P. Khatri, and S.A. Savari, "A SAT-based scheme to determine optimal fix-free codes," Proc. Data Compression Conference (2010) 169-178.
• N.R. Brisaboa, A. Faria, J.R. Lopez, G. Navarro, and E.R. Lopez, "A new searchable variable-to-variable compressor," Proc. Data Compression Conference (2010) 199-208.
• D. Dube and V. Beaudoin, "Lossless data compression via substring enumeration," Proc. Data Compression Conference (2010) 229-238.
• Y.A. Reznik, "Coding of sets of words," Proc. Data Compression Conference (2011) 43-52.
• S.T. Klein and D. Shapira, "The string-to-dictionary matching problem," Proc. Data Compression Conference (2011) 143-152.
• M.O. Kulecki, "Compressed context-modeling for text compression," Proc. Data Compression Conference (2011) 373-382.