On the communication complexity of sparse set disjointness and exists-equal problems

DOI10.1109/FOCS.2013.78MaRDI QIDQ6981706zbMATH OpenFDO

Authors Mert Sağlam, Gábor Tardos

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.78

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(2)

• Multi-party set disjointness and intersection with bounded dependence
• ( + 1) vertex coloring in O(n) communication

This page was built for publication: On the communication complexity of sparse set disjointness and exists-equal problems

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