Volume 84, Number 1, 16 October 2002
: A Kolmogorov complexity characterization of constructive Hausdorff dimension.
Volume 84, Number 2, 31 October 2002
: The equality problem for Parikh simple algebraic power series.
: Scheduling time-constrained multicast messages in circuit-switched tree networks.
Volume 84, Number 3, 15 November 2002
: How to decrypt or even substitute DES-encrypted messages in 228 steps.
, Shiqing Zhang
: Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application.
Hans Kleine Büning
, Xishun Zhao
: Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
: Priority algorithms for makespan minimization in the subset model.
, Yukio Shibata
: Erratum to "Pancyclicity of recursive circulant graphs": [Information Processing Letters 81 (2002) 187-190].
Volume 84, Number 4, 30 November 2002
: Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
Rakesh M. Verma
: Algorithms and reductions for rewriting problems II.
Volume 84, Number 5, 16 December 2002
: A note on models for non-probabilistic analysis of packet switching networks.
, Suhail Mahfud
: Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
: An interpretation of [lambda][mu]-calculus in [lambda]-calculus.
Volume 84, Number 6, 31 December 2002
: Efficient multi-variate abstraction using an array representation for combinators.
: Restricted rotation distance between binary trees.