Parallel and Distributed Computing: Theory and Practice

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 inbus 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.