Volume 101, Number 1, January 2007
: Binary equality implication constraints, normal forms and data redundancy.
Volume 101, Number 2, January 2007
: Lower bounds on the OBDD size of two fundamental functions' graphs.
: Bounds for the expected duration of the monopolist game.
Volume 101, Number 3, February 2007
: A power-set construction for reducing Büchi automata to non-determinism degree two.
: The Ford-Johnson algorithm still unbeaten for less than 47 elements.
Volume 101, Number 4, February 2007
: Substitutions into propositional tautologies.
, Jiangtao Meng
: An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity).
Volume 101, Number 5, March 2007
: A linear time algorithm for max-min length triangulation of a convex polygon.
Volume 101, Number 6, March 2007