Volume 67, Number 1, August 2003
, Ju-wook Jang
, Sung-Chun Kim
: A simple reduction of non-uniformity in dynamic load balancing of quantized loads on hypercube multiprocessors and hiding balancing overheads.
: Proof theory of higher-order equations: conservativity, normal forms and term rewriting.
Volume 67, Number 2, September 2003
Special Issue on STOC 2002
: Computing the Betti numbers of arrangements via spectral sequences.
, Martin E. Dyer
: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant.
: The price of anarchy is independent of the network topology.
Volume 67, Number 3, November 2003
Volume 67, Number 4, December 2003
Parameterized Computation and Complexity 2003
: The Turing way to parameterized complexity.
: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems.
, Iyad A. Kanj
: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms.