NOF-Multiparty Information Complexity Bounds for Pointer Jumping

DOI10.1007/11821069_40MaRDI QIDQ5756702zbMATH OpenOpenAlexFDO

Authors André Gronemeier

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_40

Mathematics Subject Classification ID

Network protocols (68M12) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Some bounds on multiparty communication complexity of pointer jumping
• Some bounds on multiparty communication complexity of pointer jumping
• One-way multiparty communication lower bound for pointer jumping with applications
• scientific article; zbMATH DE number 6146451
• The NOF multiparty communication complexity of composed functions
• The NOF multiparty communication complexity of composed functions
• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
• Optimal collapsing protocol for multiparty pointer jumping
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise

Cited in

(7)

• Some bounds on multiparty communication complexity of pointer jumping
• Optimal collapsing protocol for multiparty pointer jumping
• Some bounds on multiparty communication complexity of 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
• The communication complexity of pointer chasing
• Pointer chasing with unlimited interaction

This page was built for publication: NOF-Multiparty Information Complexity Bounds for Pointer Jumping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756702)