Volume 85, Number 1, 16 January 2003
Volume 85, Number 2, 31 January 2003
: Some non finitely generated monoids of repetition-free endomorphisms.
: Asymptotic analysis of an optimized quicksort algorithm.
Volume 85, Number 3, 14 February 2003
: A combinatorial characterization of regular anonymous perfect threshold schemes.
: Proxy signature schemes based on factoring.
Volume 85, Number 4, 28 February 2003
, Guochuan Zhang
: On-line scheduling with extendable working time on a small number of machines.
: On-line grid-packing with a single active grid.
Volume 85, Number 5, 16 March 2003
Jean Marcel Pallo
: Generating binary trees by Glivenko classes on Tamari lattices.
: Finding smooth maps is NP-complete.
: Derivation of a parallel string matching algorithm.
Volume 85, Number 6, 31 March 2003
: Note on winning positions on pushdown games with [omega]-regular conditions.
: A lower bound on the size of [epsiv]-free NFA corresponding to a regular expression.
: A simple algorithm for edge-coloring bipartite multigraphs.
Ioan Cristian Trelea
: The particle swarm optimization algorithm: convergence analysis and parameter selection.