Parallel and Distributed Computing Theory and Practice: First Canada-France Conference Montréal, Canada, May 19–21, 1994 Proceedings

Juggling networks....Pages 1-12
Optimal parallel verification of minimum spanning trees in logarithmic time....Pages 13-22
The parallel complexity of algorithms for pattern formation models....Pages 23-34
On the parallel complexity of iterated multiplication in rings of algebraic integers....Pages 35-44
 NC 2 Algorithms regarding Hamiltonian paths and circuits in interval graphs....Pages 45-57
Concurrency in an O (log log N ) priority queue....Pages 59-71
Embedding k-D meshes into optimum hypercubes with dilation 2k-1 extended abstract....Pages 73-80
Embedding 3-dimensional grids into optimal hypercubes....Pages 81-94
Distributed cyclic reference counting....Pages 95-100
Efficient reconstruction of the causal relationship in distributed systems....Pages 101-113
Scalable parallel computational geometry....Pages 115-119
Sorting and selection on arrays with diagonal connections....Pages 121-136
Work-Optimal thinning algorithm on SIMD machines....Pages 137-152
An efficient implementation of parallel A * ....Pages 153-168
Constant-time convexity problems on reconfigurable meshes....Pages 169-180
Deepness analysis: Bringing optimal fronts to triangular finite element method....Pages 181-196
Communications in bus networks....Pages 197-206
Fault-tolerant linear broadcasting....Pages 207-217
The minimum broadcast time problem....Pages 219-234
The complexity of systolic dissemination of information in interconnection networks....Pages 235-249
Representations of gossip schemes....Pages 251-265
On the multiply-twisted hypercube....Pages 267-278