A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
type: Item
instance of: scholarly article
title: A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
zbMATH Open document ID: 0677.68040
DOI: 10.1016/0020-0190(89)90023-9
author: A. Gibbons
author: Y. N. Srikant
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4110104
zbMATH Keywords: efficient parallel algorithms
zbMATH Keywords: list ranking problem
zbMATH Keywords: recognition of bracket and input-driven languages
zbMATH Keywords: divide and conquer
zbMATH Keywords: dynamic expression evaluation
zbMATH Keywords: mesh-connected computers
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90023-9
OpenAlex ID: W2033440408
cites work: Graph Problems on a Mesh-Connected Processor Array
cites work: Q3992991
cites work: Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
cites work: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
cites work: A new parallel algorithm for parsing arithmetic infix expressions
cites work: Sorting on a mesh-connected parallel computer
description: scientific article; zbMATH DE number 4110104