Pages that link to "Item:Q5691290"
From MaRDI portal
The following pages link to Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines (Q5691290):
Displaying 8 items.
- Multiprocessor simulation strategies with optimal speed-up (Q1349734) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q1373140) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Circuit and decision tree complexity of some number theoretic problems (Q1854439) (← links)
- Computing with light: toward parallel Boolean algebra (Q2909100) (← links)
- Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM (Q3798245) (← links)
- CREW PRAM<scp>s</scp> and Decision Trees (Q3985804) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q5060110) (← links)
