A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation

DOI10.1016/0020-0190(89)90023-9zbMath0677.68040OpenAlexW2033440408MaRDI QIDQ1123611

Y. N. Srikant, Alan M. Gibbons

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90023-9

zbMATH Keywords

efficient parallel algorithmsdivide and conquermesh-connected computersdynamic expression evaluationlist ranking problemrecognition of bracket and input-driven languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (3)

The balanced binary tree technique on mesh-connected computers ⋮ List-ranking on interconnection networks. ⋮ Dense edge-disjoint embedding of complete binary trees in interconnection networks

Cites Work

• Unnamed Item
• A new parallel algorithm for parsing arithmetic infix expressions
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Graph Problems on a Mesh-Connected Processor Array
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Sorting on a mesh-connected parallel computer

This page was built for publication: A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation