Pages that link to "Item:Q1272658"
From MaRDI portal
The following pages link to Some bounds on multiparty communication complexity of pointer jumping (Q1272658):
Displaying 9 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
- (Q4910715) (← links)
- Pointer chasing via triangular discrimination (Q4993101) (← links)
- NOF-Multiparty Information Complexity Bounds for Pointer Jumping (Q5756702) (← links)
- The communication complexity of pointer chasing (Q5943092) (← links)
- The communication complexity of pointer chasing: applications of entropy and sampling (Q6483601) (← links)