Pages that link to "Item:Q1329159"
From MaRDI portal
The following pages link to Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159):
Displaying 13 items.
- An insight on PRAM computational bounds (Q287202) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- The queue-read queue-write asynchronous PRAM model (Q1128706) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q1373140) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs (Q1904664) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms (Q4210175) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
- Gossiping and broadcasting versus computing functions in networks (Q5047171) (← links)
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs (Q5056126) (← links)
