Leapfrogging samplesort -- Spanning 2-trees -- Minimal linear invariants -- Parallel maximal matching on minimal vertex series parallel digraphs -- Efficient equality-testing and updating of sets -- Binary space partitions for sets of hyperrectangles -- Transformation of orthogonal term rewriting systems -- An automaton-driven frame disposal algorithm and its proof of correctness -- Labeled ?-calculus and a generalised notion of strictness -- Preemption primitives in reactive languages -- Multi-action process algebra -- Complexity as a basis for comparing semantic models of concurrency -- Combinatory formulations of concurrent languages -- Constraints for free in concurrent computation -- Formalizing inductive proofs of message recovery in distributed systems -- Detecting distributed termination in the presence of node failure -- An extended gradient model for NUMA multiprocessor systems -- Efficient parallel permutation-based range-join algorithms on mesh-connected computers -- Pipelined band join in shared-nothing systems -- Inductive logic programming based on genetic algorithm -- The equivalence of the subsumption theorem and the refutation-completeness for unconstrained resolution -- Probabilistic logic programming and Bayesian networks -- Deriving and applying logic program transformers -- Performance of a data-parallel concurrent constraint programming system -- Formalizing inductive proofs of network algorithms -- TROM - An object model for reactive system development -- Duration calculus specification of scheduling for tasks with shared resources -- Trace specifications of non-deterministic multi-object modules -- ESP-MC: An experiment in the use of verification tools.