Volume 71, Number 1, July 2005
Volume 71, Number 2, August 2005
Volume 71, Number 3, October 2005
Learning Theory 2003
Volume 71, Number 4, November 2005
: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results.
: An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet.
: Bounds on the OBDD-size of integer multiplication via universal hashing.