On the parallel-decomposability of geometric problems
type: Item
instance of: scholarly article
title: On the parallel-decomposability of geometric problems
zbMATH Open document ID: 0748.68079
DOI: 10.1007/BF01758844
author: Mikhail J. Atallah
author: Jyh-Jong Tsay
published in: Algorithmica
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 64258
zbMATH Keywords: mesh-connected arrays of processors
MaRDI profile type: Publication
cites work: Q3798233
cites work: Sorting n objects with a k-sorter
cites work: Multidimensional divide-and-conquer
cites work: Q3798234
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
cites work: Parallel geometric algorithms on a mesh-connected computer
cites work: On Finding the Maxima of a Set of Vectors
cites work: An On-Chip Compare/Steer Bubble Sorter
cites work: Mesh computer algorithms for computational geometry
cites work: Sorting numbers using limited systolic coprocessors
cites work: Q3992847
description: scientific article; zbMATH DE number 64258