Pages that link to "Item:Q4625662"
From MaRDI portal
The following pages link to Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) (Q4625662):
Displaying 10 items.
- On the complexity of iterated shuffle (Q800086) (← links)
- On the interdependence between shuffle and crossing-over operations (Q1357806) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- (Q5091162) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)
- Distributed-prover interactive proofs (Q6581784) (← links)