On Efficient Parallel Algorithms for Solving Set Recurrence Equations

DOI10.1006/JAGM.1993.1012zbMATH Open0773.68035OpenAlexW2075041564MaRDI QIDQ4033767FDOQ4033767

Authors: Oscar H. Ibarra, Hui Wang, Tao Jiang 

Publication date: 16 May 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1012

Recommendations

• Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
• scientific article; zbMATH DE number 1555966
• On efficient parallel computations for some dynamic programming problems
• On the parallel recognition of unambiguous context-free languages
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

zbMATH Keywords

pattern matchingsequence comparisonlanguage recognitionEREW PRAM algorithmslinear context-free languagesCREW PRAM algorithmset recurrence equations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Distributed algorithms (68W15)

Cited In (6)

• Parallel algorithms for evaluating sequences of set-manipulation operations
• On time optimal implementation of uniform recurrences onto array processors via quadratic programming
• On efficient parallel computations of costs of paths on a grid graph
• Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On Efficient Parallel Algorithms for Solving Set Recurrence Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033767)