A sublinear parallel algorithm for some dynamic programming problems

DOI10.1016/0304-3975(92)90258-HMaRDI QIDQ1202931zbMATH OpenOpenAlexFDO

Authors Shou-Hsuan S. Huang, Venkatraman Viswanathan, Hongfei Li

Publication date 22 April 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(92)90258-h

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites work

• scientific article; zbMATH DE number 3926247 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• On efficient parallel computations for some dynamic programming problems
• Optimum binary search trees

Cited in

(1)

• An optimal sublinear time parallel algorithm for some dynamic programming problems

This page was built for publication: A sublinear parallel algorithm for some dynamic programming problems

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