The qualitative modeling and compression of the request sequences in ARQ protocols. Proc. of Data Compression Conference 2001 (USA, Utah, Snowbird, March 27--29). IEEE Cjmputer Society Press, 2001, p. 494.

Context--Tree Maximizing. Proc. of 2000 Conf. on Inform. Sciences and Systems (Princeton Univ., March 15--17). Princeton, NJ, pp. TP6--TP12.

Universal coding of non--prefix context tree sources. In: "Numbers, information and complexity", Kluves academical publishers, The Netherlands, 2000, pp. 391--402.

Modifications of the Barrow and Wheeler Data Compression Algorithm. Proc. of Data Compression Conference 1999 (USA, Utah, Snowbird, March 29--31). IEEE Computer Society Press, 1999, pp. 188--197.

Multialphabet coding with separate alphabet description. Proc. of "Compression and Complexity of Sequences 1997" (Italy, Positano, June 11--13). IEEE Computer Sosiety Press, 1998, pp. 56--65.

Non-uniform PPM and context tree models. Proc. od Data Compression Conference 1998 (USA, Utah, Snowbird, March 30 -- April 1). IEEE Society Press, 1998, pp. 279--288.

Fuzzy estimation of unknown source model for universal coding. Proc. of IEEE Information Theory Workshop (Ireland, Killarney, June 1998). IEEE Press, 1998, pp. 17--18.

Simple Models of Two--Dimensional Information Sources and Codes. Proc. of Internat. Symposium. on Information Theory (USA, Boston, August 1998), IEEE Press, 1998.