Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Geometric problems on two-dimensional array processors

From MaRDI portal
Publication:1104746
Jump to:navigation, search

DOI10.1007/BF01602097zbMath0647.68039MaRDI QIDQ1104746

Mi Lu, Peter J. Varman

Publication date: 1988

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


zbMATH Keywords

Parallel algorithmsregular languagesgeometric 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)


Related Items

Solving visibility problems on MCCs of smaller size



Cites Work

  • An efficient algorithm for determining the convex hull of a finite planar set
  • Optimal Three-Layer Channel Routing
  • A Self-Routing Benes Network and Parallel Permutation Algorithms
  • Sorting on a mesh-connected parallel computer
  • Mesh computer algorithms for computational geometry
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1104746&oldid=13144530"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki