Some bounds on multiparty communication complexity of pointer jumping

DOI10.1007/3-540-60922-9_52MaRDI QIDQ4593967zbMATH OpenOpenAlexFDO

Authors Carsten Damm, Jiří Sgall, Stasys Jukna

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60922-9_52

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

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

(7)

• 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

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)