Jorma Rissanen Discussion of Paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe. [Citation Graph (0, 0)][DBLP] Comput. J., 1999, v:42, n:4, pp:327-329 [Journal]
Jorma Rissanen Bounds for Weight Balanced Trees. [Citation Graph (0, 0)][DBLP] IBM Journal of Research and Development, 1973, v:17, n:2, pp:101-105 [Journal]
Jorma Rissanen Generalized Kraft Inequality and Arithmetic Coding. [Citation Graph (0, 0)][DBLP] IBM Journal of Research and Development, 1976, v:20, n:3, pp:198-203 [Journal]
Jorma Rissanen Strong optimality of the normalized ML models as universal codes and information in data. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1712-1717 [Journal]
Jorma Rissanen Complexity of simple nonlogarithmic loss functions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:476-484 [Journal]
Jorma Rissanen Tight lower bounds for optimum code length. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:348-0 [Journal]
Jorma Rissanen A universal data compression system. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:656-663 [Journal]
Jorma Rissanen Universal coding, information, prediction, and estimation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:629-636 [Journal]
Jorma Rissanen Complexity of strings in the class of Markov sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:526-532 [Journal]
Jorma Rissanen Fisher information and stochastic complexity. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:40-47 [Journal]
Jorma Rissanen Fast Universal Coding With Context Models. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1065-1071 [Journal]
Jorma Rissanen, Marl Wax Measures of mutual and causal dependence between two time series. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:598-0 [Journal]
Ioan Tabus, Jorma Rissanen Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:2022-2035 [Journal]