Connectivity lower bounds in broadcast congested clique

DOI10.4230/LIPICS.FSTTCS.2020.32MaRDI QIDQ6839872zbMATH OpenFDO

Authors Shreyas Pai, Sriram Pemmaraju

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

lower boundsdistributed algorithmsinformation theoryconnectivitycommunication complexityindistinguishabilitybroadcast congested clique

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

This page was built for publication: Connectivity lower bounds in broadcast congested clique

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