The following pages link to (Q3730022):
Displaying 17 items.
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q1373140) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Parallel pointer machines (Q2366720) (← links)
- An unambiguous class possessing a complete set (Q5048936) (← links)
- PRAM's towards realistic parallelism: BRAM's (Q5055910) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)
- StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)
- Advocating ownership (Q6567779) (← links)
