Information Sciences, Volume 135

Volume 135, Number 1-2, June 2001

• Jon Louis Bentley, M. Douglas McIlroy: Data compression with long repeated strings. 1-11 BibTeX
• Paolo Ferragina, Giovanni Manzini: An experimental study of a compressed index. 13-28 BibTeX
• Michael Factor, Dafna Sheinwald: Compression in the presence of shared data. 29-41 BibTeX
• Sergio De Agostino: Parallelism and dictionary based data compression. 43-56 BibTeX
• Yuriy A. Reznik, Wojciech Szpankowski: On the average redundancy rate of the Lempel-Ziv code with the k-error protocol. 57-70 BibTeX
• Bruno Carpentieri: Block matching displacement estimation: a sliding window approach. 71-86 BibTeX
• John H. Reif, James A. Storer: Optimal encoding of non-stationary sources. 87-105 BibTeX
• Francesco Rizzo, James A. Storer, Bruno Carpentieri: LZ-based image compression. 107-122 BibTeX

Volume 135, Number 3-4, July 2001

• H. H. L. M. Donkers, Jos W. H. M. Uiterwijk, H. Jaap van den Herik: Probabilistic opponent-model search. 123-149 BibTeX
• Jonathan Schaeffer, Aske Plaat, Andreas Junghanns: Unifying single-agent and two-player search. 151-175 BibTeX
• Keh-Hsun Chen: A study of decision error in selective game tree search. 177-186 BibTeX
• Martin Müller: Global and local game tree search. 187-206 BibTeX
• R. Wu, Donald F. Beal: Solving Chinese chess endgames by database construction. 207-228 BibTeX