Editorial Board
Obituary for our editor Arthur W. Burks
Content-dependent chunking for differential compression, the local maximum approach
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Communication algorithms with advice
Numberings optimal for learning
Decision problems for language equations
An approximation trichotomy for Boolean #CSP
Corrigendum to “Shifting: One-inclusion mistake bounds and sample compression” [J. Comput. System Sci. 75 (1) (2009) 37–59]
Contents