Latex/Postcript files: under construction, some files available
1. THE THEORY OF BERNOULLI SHIFTS. University of Chicago Press, Chicago, Illinois, 1973.
2. "Universal almost sure data compression," (with D. Ornstein), Annals of Probability, 18(1990), 441-452.
3. "Universal almost sure data compression using Markov types," Problems of Control and Information Theory, 19(1990), 269-277.
4. "String matching - the general ergodic case," Annals of Probability, 20(1992), 1199-1203.
5. "Entropy and prefixes," Annals of Probability, 20(1992), 403-9.
6. "The dbar-recognition of processes,"(with D. S. Ornstein), Advances in Mathematics, 104(1994), 182-224.
7. "The entropy theorem via coding bounds," IEEE Transactions on Information Theory, IT-37(1991), 1645-1647.
8. "Cutting and stacking. A method for constructing stationary processes," IEEE Transactions on Information Theory, IT-37(1991), 1605-1617. For a more general discussion of cutting and stacking see Section I.10 of my recent book.
9. "Universal redundancy rates don't exist," IEEE Transactions on Information Theory, IT-39(1993), 520-524.
10. "The positive-divergence and blowing-up properties," (with K. Marton), Israel Journal of Mathematics, 86(1994), 331-348.
11. "Entropy and the consistent estimation of joint distributions," (with K. Marton), Annals of Probability, 22(1994), 960-977.
12. "Two divergence-rate counterexamples," Journal of Theoretical Probability, 6(1993), 521-545.
13. "Waiting times: positive and negative results on the Wyner-Ziv problem," Journal of Theoretical Probability, 6(1993), 499-519.
14. "Universal redundancy rates for B-processes do not exist," (with B. Weiss), IEEE Transactions on Information Theory, 41(1995), 508-512.
15. "Almost sure waiting time results for weak and very weak Bernoulli processes," (with K. Marton), Ergodic Theory and Dynamical Systems, 15(1995), 951-960.
16. "Redundancy rates for renewal and other processes," (with I. Csiszar), IEEE Transactions on Information Theory, 42(1996), 2065-2072.
17. "String matching bounds via coding," Annals of Probability, 25(1997), 329-336.
18. "Simplistic universal coding," (with D. Neuhoff), IEEE Trans. Inform. Th., IT-44(1998), 778-781.
19. "The interactions between ergodic theory and information theory," IEEE Trans. Inform. Th., IT-44(1998), 2079-2093.
20. "Performance of LZ algorithms on individual sequences," IEEE Trans. Inform. Th., IT-45(1999), 1283-88.
21. "How many future measures can there be?" (with K. Marton), Ergodic theory and dynamical systems, 22(2002), 257-280.
22. "Sequences incompressible by SLZ (LZW), yet fully compressible by ULZ," (with Larry Pierce II), I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker, A. Sarközy, I. Wegener, and Z. Zhang (eds.), {\em Numbers, Information and Complexity}, Kluwer Academic Publishers, (2000) 385-390.
23. "Consistency of the BIC Markov order estimator," (with I. Csiszár), Ann. Statist., 28(2000), 1601-1619. (See also Electron. Res. Announc. Amer. Math. Soc. 5 (1999), 123-127.)
24. "Loose almost blowing-up and related properties", Israel Journal of Mathematics, 126(2001), 157-171.
25. "Information Theory and Statistics: a Tutorial," by Imre Csiszár and Paul Shields, (2004)
26. "Two new Markov order estimators," by Yuval Peres and Paul Shields, (2004)
27. "Bounds for Dirichlet mixtures," (2005)
28. "Relative Code Length (RCL) and Model Selection ," slides for UW Talk to Social Science and Statistics Working Group, (2005)
|
Return to Home Page.