Efficient parallel algorithms for a class of graph theoretic problems
SIAM Journal on Computing
Optimal Graph Algorithms on a Fixed-Size Linear Array
IEEE Transactions on Computers
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Polymorphic-Torus Architecture for Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
Information Processing Letters
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
Efficient parallel algorithms for some graph problems
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
The Image Understanding Architecture
The Image Understanding Architecture
The recognition of straight line patterns by bus automatons using parallel processing
The recognition of straight line patterns by bus automatons using parallel processing
A transitive closure based algorithm for test generation
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Constant Time Inner Product and Matrix Computations on Permutation Network Processors
IEEE Transactions on Computers
A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors
IEEE Transactions on Parallel and Distributed Systems
Matrix inversion in O(log n) on a scan-enhanced reconfigurable mesh computer
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
An Optimal Multiplication Algorithm on Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing - Special issue: high performance computing systems
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
An efficient self-simulation algorithm for reconfigurable meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Using bus linearization to scale the reconfigurable mesh
Journal of Parallel and Distributed Computing
More Efficient Topological Sort Using Reconfigurable Optical Buses
The Journal of Supercomputing
Constant Time Sorting on Reconfigurable Meshes
IEEE Transactions on Computers
On the Parallel Computation of the Algebraic Path Problem
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Constant-Time Parallel Algorithms for Image Labeling on a Reconfigurable Network of Processors
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Integer and Floating Point Matrix-Vector Multiplication on the Reconfigurable Mesh
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Basic Algorithms for the Asynchronous Reconfigurable Mes
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Parallel Transitive Closure Computation Algorithm for VLSI Test Generation
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Efficient List Ranking Algorithms on Reconfigurable Mesh
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Constant Time Algorithms for Euler Tour and Tree Operations on CRAP
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Efficient Parallel and Distributed Topological Sort Algorithms
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
Computers and Electrical Engineering
Efficient partitioning of static buses for processor arrays of small size
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
| Hi-index | 0.01 |
The transitive closure problem in O(1) time is solved by a new method that is far different from the conventional solution method. On processor arrays with reconfigurable bus systems, two O(1) time algorithms are proposed for computing the transitive closure of an undirected graph. One is designed on a three-dimensional n*n*n processor array with a reconfigurable bus system, and the other is designed on a two-dimensional n/sup 2/*n/sup 2/ processor array with a reconfigurable bus system, where n is the number ofvertices in the graph. Using the O(1) time transitive closure algorithms, many other graph problems are solved in O(1) time. These problems include recognizing bipartite graphs and finding connected components, articulation points, biconnected components, bridges, and minimum spanning trees in undirected graphs.