Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
From MaRDI portal
Publication:5096776
DOI10.1007/3-540-55210-3_178zbMATH Open1493.68394OpenAlexW1492683431MaRDI QIDQ5096776FDOQ5096776
Authors: Lawrence L. Larmore, Wojciech Rytter 
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_178
Recommendations
- Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
- An optimal sublinear time parallel algorithm for some dynamic programming problems
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
- On efficient parallel computations for some dynamic programming problems
Formal languages and automata (68Q45) Analysis of algorithms (68W40) Dynamic programming (90C39) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the parallel recognition of unambiguous context-free languages
- Title not available (Why is that?)
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- On efficient parallel computations of costs of paths on a grid graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
- Speed of Recognition of Context-Free Languages by Array Automata
- Time complexity of unambiguous path systems
Cited In (5)
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- An optimal sublinear time parallel algorithm for some dynamic programming problems
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations
- On a sublinear time parallel construction of optimal binary search trees
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
This page was built for publication: Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096776)
