Beyond set disjointness

DOI10.1145/2611462.2611501zbMath1321.68298OpenAlexW2108884089MaRDI QIDQ2943615

David P. Woodruff, Amit Chakrabarti, Ranganath Kondapally, Joshua Brody, Grigory Yaroslavtsev

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2611462.2611501

zbMATH Keywords

distributed algorithmscommunication complexitybig datadatabasescommunication protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (8)

Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond ⋮ Communication complexity with small advantage ⋮ Distributed Testing of Distance-k Colorings ⋮ The communication complexity of functions with large outputs ⋮ Unnamed Item ⋮ Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond ⋮ Unnamed Item ⋮ The Communication Complexity of Set Intersection and Multiple Equality Testing

This page was built for publication: Beyond set disjointness