On shrinking binary picture patterns
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS
RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS
Parallel algorithms in cellular spaces.
Parallel algorithms in cellular spaces.
ACM Computing Surveys (CSUR)
On Multidimensional Arrays of Processors
IEEE Transactions on Computers
Square meshes are not always optimal
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers
IEEE Transactions on Computers
Square Meshes are Not Always Optimal
IEEE Transactions on Computers
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Two-dimensional cellular automata and deterministic on-line tessalation automata
Theoretical Computer Science
Mesh-Connected Computers with Broadcasting
IEEE Transactions on Computers
| Hi-index | 0.02 |
The parallel processing array consists of an n×n array of processors to which a cn2 node directed graph can be input by placing c nodes at every point of the array. It is shown that every one of the following properties of the graph can be computed in order of n steps: (1) to test whether the graph is strongly connected, (2) to mark a node in every strongly connected component, (3) to mark a strong connected component that contains a given node, (4) to mark a simple directed path between a given pair of nodes, and (5) to compute the interconnectivity of the c nodes within every point. As a consequence, several open problems can be solved. For example, any language recognized by a 2-dimensional finite state automaton with 1 pebble can be recognized in order of n steps by a parallel processing array. (It was not even known whether the languages recognized by 2-dimensional finite state automata without pebbles can be recognized in order of n steps by a parallel processing array). Note that a 1 pebble automaton can run for order of n4 steps before accepting an input.