Pages that link to "Item:Q1824389"
From MaRDI portal
The following pages link to Optimal parallel algorithms for dynamic expression evaluation and context-free recognition (Q1824389):
Displaying 10 items.
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- On optimal parallel computations for sequences of brackets (Q808700) (← links)
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation (Q1123611) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS (Q4819984) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition (Q5096776) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)
