An optimal parallel algorithm for linear programming in the plane
type: Item
instance of: scholarly article
title: An optimal parallel algorithm for linear programming in the plane
zbMATH Open document ID: 0702.68057
DOI: 10.1016/0020-0190(90)90026-T
author: Xiaotie Deng
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4151822
zbMATH Keywords: computational geometry
zbMATH Keywords: parallel algorithm
zbMATH Keywords: CRCW PRAM
MaRDI profile type: Publication
cites work: Parallel computational geometry
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: An optimally efficient selection algorithm
cites work: Q3844775
cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs
cites work: Q3772828
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: Q5585020
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Finding the intersection of two convex polyhedra
cites work: Q4739657
cites work: Finding the intersection of n half-spaces in time O(n log n)
cites work: Finding the maximum, merging, and sorting in a parallel computation model
full work available at URL: 0020-0190(90)90026-t
OpenAlex ID: W1999230788
description: scientific article; zbMATH DE number 4151822