Pages that link to "Item:Q4696646"
From MaRDI portal
The following pages link to The Parallel Simplicity of Compaction and Chaining (Q4696646):
Displaying 11 items.
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- The parallel complexity of integer prefix summation (Q1350241) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Parallel two dimensional witness computation (Q1887160) (← links)
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs (Q1904664) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
- MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗ (Q4820154) (← links)
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)