Some bounds on multiparty communication complexity of pointer jumping
From MaRDI portal
(Redirected from Some bounds on multiparty communication complexity of pointer jumping)
Some bounds on multiparty communication complexity of pointer jumping (scientific article; zbMATH DE number 6807590)
Some bounds on multiparty communication complexity of pointer jumping (scientific article; zbMATH DE number 6807590)
Recommendations
- Some bounds on multiparty communication complexity of pointer jumping
- The communication complexity of pointer chasing: applications of entropy and sampling
- One-way multiparty communication lower bound for pointer jumping with applications
- NOF-Multiparty Information Complexity Bounds for Pointer Jumping
- scientific article; zbMATH DE number 6146451
Cited in
(8)- Some bounds on multiparty communication complexity of pointer jumping
- Hierarchy theorems for kOBDDs and kIBDDs
- Optimal collapsing protocol for multiparty pointer jumping
- scientific article; zbMATH DE number 6146451 (Why is no real title available?)
- One-way multiparty communication lower bound for pointer jumping with applications
- NOF-Multiparty Information Complexity Bounds for Pointer Jumping
- The communication complexity of pointer chasing: applications of entropy and sampling
- Optimal communication complexity of chained index
This page was built for publication: Some bounds on multiparty communication complexity of pointer jumping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593967)