A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
From MaRDI portal
Publication:1123611
DOI10.1016/0020-0190(89)90023-9zbMath0677.68040MaRDI 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
efficient parallel algorithms; divide and conquer; mesh-connected computers; dynamic expression evaluation; list ranking problem; recognition of bracket and input-driven languages
68Q25: Analysis of algorithms and problem complexity
68N25: Theory of operating systems
68N99: Theory of software
Related Items
List-ranking on interconnection networks., Dense edge-disjoint embedding of complete binary trees in interconnection networks, The balanced binary tree technique on mesh-connected computers
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