Mesh-connected array processors with bypass capability for signal/image processing
Proceedings of the Twenty-First Annual Hawaii International Conference on Architecture Track
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
Applications of generalized matrix searching to geometric algorithms
Discrete Applied Mathematics - Computational combinatiorics
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
Journal of Parallel and Distributed Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
An efficient parallel algorithm for the row minima of a totally monotone matrix
Journal of Algorithms
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Scalable Hardware-Algorithms for Binary Prefix Sums
IEEE Transactions on Parallel and Distributed Systems
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications
IEEE Transactions on Parallel and Distributed Systems
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A matrix A of size m脳n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 驴i 2. In case $m = n^\epsilon$ for some constant $\epsilon,$$(0