Juggling networks -- Optimal parallel verification of minimum spanning trees in logarithmic time -- The parallel complexity of algorithms for pattern formation models -- On the parallel complexity of iterated multiplication in rings of algebraic integers -- NC 2 Algorithms regarding Hamiltonian paths and circuits in interval graphs -- Concurrency in an O (log log N) priority queue -- Embedding k-D meshes into optimum hypercubes with dilation 2k-1 extended abstract -- Embedding 3-dimensional grids into optimal hypercubes -- Distributed cyclic reference counting -- Efficient reconstruction of the causal relationship in distributed systems -- Scalable parallel computational geometry -- Sorting and selection on arrays with diagonal connections -- Work-Optimal thinning algorithm on SIMD machines -- An efficient implementation of parallel A* -- Constant-time convexity problems on reconfigurable meshes -- Deepness analysis: Bringing optimal fronts to triangular finite element method -- Communications in bus networks -- Fault-tolerant linear broadcasting -- The minimum broadcast time problem -- The complexity of systolic dissemination of information in interconnection networks -- Representations of gossip schemes -- On the multiply-twisted hypercube.

This volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors. This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.