Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
From MaRDI portal
Publication:5096776
DOI10.1007/3-540-55210-3_178zbMath1493.68394MaRDI QIDQ5096776
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
68W40: Analysis of algorithms
68Q45: Formal languages and automata
90C39: Dynamic programming
68W10: Parallel algorithms in computer science
Related Items
On a sublinear time parallel construction of optimal binary search trees, An optimal sublinear time parallel algorithm for some dynamic programming problems
Cites Work
- On the parallel recognition of unambiguous context-free languages
- Time complexity of unambiguous path systems
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- On efficient parallel computations of costs of paths on a grid graph
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item