Pages that link to "Item:Q3798245"
From MaRDI portal
The following pages link to Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM (Q3798245):
Displaying 7 items.
- Fast recognition of deterministic cfl's with a smaller number of processors (Q685360) (← links)
- Fast parallel recognition of LR language suffixes (Q834947) (← links)
- Limits on the power of parallel random access machines with weak forms of write conflict resolution (Q1816745) (← links)
- (Q4281540) (← 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)
- Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines (Q5691290) (← links)