Editorial Board
Three one-way heads cannot do string matching
Unique complements and decompositions of database schemata
Hypergraph languages of bounded degree
Parallel solutions to geometric problems in the scan model of computation
Gap-definable counting classes
Reversibility and surjectivity problems of cellular automata
PSPACE is provable by two provers in one round
Superconcentrators of depths 2 and 3; odd levels help (rarely)