The communication complexity of distributed maximization

DOI10.1007/978-981-96-1090-7_40MaRDI QIDQ6970703zbMATH OpenFDO

Authors Yuxiang Tian, Xiaoyi Zhu, Zengfeng Huang

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_40

zbMATH Keywords

algorithmcommunication complexitydistributed maximization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A discrepancy lower bound for information complexity
• A tight bound for set disjointness in the message-passing model
• Algorithms for distributed functional monitoring
• An optimal lower bound for distinct elements in the message passing model
• Approximate distributed top-\(k\) queries
• Beyond set disjointness: the communication complexity of finding the intersection
• Efficient top-k query calculation in distributed networks
• scientific article; zbMATH DE number 524134 (Why is no real title available?)
• Lower bounds for number-in-hand multiparty communication complexity, made easy
• On information complexity in the broadcast model
• The communication complexity of addition
• When distributed computation is communication expensive

This page was built for publication: The communication complexity of distributed maximization

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