Geometric problems on two-dimensional array processors

DOI10.1007/BF01602097zbMATH Open0647.68039MaRDI QIDQ1104746FDOQ1104746

Authors: Mi Lu, Peter J. Varman 

Publication date: 1988

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Recommendations

• On the complexity of the recognition of parallel 2D-image languages
• scientific article; zbMATH DE number 4057009
• scientific article; zbMATH DE number 18635
• Parallel Parsing on a One-Way Array of Finite-State Machines
• The complexity of some decision problems about two-dimensional array grammars

zbMATH Keywords

regular languagesParallel algorithmsgeometric problemsmesh-connected computernon-regular languagestwo array processor modelstwo-dimensional systolic array

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Algorithms in computer science (68W99)

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Optimal Three-Layer Channel Routing
• Sorting on a mesh-connected parallel computer
• Mesh computer algorithms for computational geometry

Cited In (1)

• Solving visibility problems on MCCs of smaller size

This page was built for publication: Geometric problems on two-dimensional array processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104746)