Connectivity lower bounds in broadcast congested clique (Q6839872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8175978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity lower bounds in broadcast congested clique |
scientific article; zbMATH DE number 8175978 |
Statements
Connectivity lower bounds in broadcast congested clique (English)
0 references
23 March 2026
0 references
distributed algorithms
0 references
broadcast congested clique
0 references
connectivity
0 references
lower bounds
0 references
indistinguishability
0 references
communication complexity
0 references
information theory
0 references
0 references
