An optimal sublinear time parallel algorithm for some dynamic programming problems
type: Item
instance of: scholarly article
title: An optimal sublinear time parallel algorithm for some dynamic programming problems
zbMATH Open document ID: 0816.90131
DOI: 10.1016/0020-0190(94)90136-8
author: Lawrence L. Larmore
author: Wojciech Rytter
published in: Information Processing Letters
publication date: 1995-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 681767
zbMATH Keywords: optimal parallel computations
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90136-8
OpenAlex ID: W2093803005
cites work: Q4091421
cites work: Q4003168
cites work: Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
cites work: Q3992991
cites work: A sublinear parallel algorithm for some dynamic programming problems
cites work: Speed of Recognition of Context-Free Languages by Array Automata
cites work: Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
cites work: On efficient parallel computations for some dynamic programming problems
description: scientific article; zbMATH DE number 681767