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

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
  
• Jonathan Schaeffer, Aske Plaat, Andreas Junghanns:
  Unifying single-agent and two-player search. 151-175
  
• Keh-Hsun Chen:
  A study of decision error in selective game tree search. 177-186
  
• Martin Müller:
  Global and local game tree search. 187-206
  
• Ren Wu, Donald F. Beal:
  Solving Chinese chess endgames by database construction. 207-228
  

Last update Tue Feb 14 04:19:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page