Pages that link to "Item:Q5943092"
From MaRDI portal
The following pages link to The communication complexity of pointer chasing (Q5943092):
Displaying 7 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- The Hardness of Median in the Synchronized Bit Communication Model (Q3010421) (← links)
- The quantum communication complexity of the pointer chasing problem: The bit version (Q4415257) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Pointer chasing via triangular discrimination (Q4993101) (← links)
- The communication complexity of pointer chasing: applications of entropy and sampling (Q6483601) (← links)