A survey and a characterization of the various parallel algorithms and architectures
developed for the problem of labeling digitized images over the last two decades are …

We consider the parallel time complexity of logic programs without function symbols, called
logical query programs, or Datalog programs. We give a PRAM algorithm for computing the …

Abstract Jwo et al.[Networks 23 (1993) 315–326] introduced the alternating group graph as
an interconnection network topology for computing systems. They showed that the proposed …

Asymptotically optimal parallel algorithms are presented for use on a mesh computer to
determine several fundamental geometric properties of figures. For example, given multiple …

This paper considers mesh computers with buses, where each bus provides a broadcasting
capability to the processors connected to it. We first disprove a published claim by showing …

We present an efficient technique for parallel manipulation of data structures that avoids
memory access conflicts. That is, this technique works on the Exclusive Read/Exclusive …

We survey the many applications of parallel algorithms and complexity to logic programming
problems. The problems examined are related to the optimization of logical query programs …

Page 1 PARALLEL ALGORITHMS FOR REGULAR ARCHITECTURES MESHES and PYRAMIDS
RUSS MILLER and QUENTIN F. STOUT Page 2 Page 3 Page 4 Page 5 Parallel Algorithms for …

We consider the problem of detecting lines in an n× n image on an n× n mesh of processors
and present two new and efficient parallel algorithms which detect lines by performing a …

Parallel algorithms for planar graph isomorphism and several related problems are
presented. Two models of parallel computation are considered: the CREW-PRAM model …