A deterministic algorithm for the MST problem in constant rounds of congested clique

Krzysztof Nowicki 0002. A deterministic algorithm for the MST problem in constant rounds of congested clique. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 1154-1165, ACM, 2021. [doi]

Authors

Krzysztof Nowicki 0002

This author has not been identified. Look up 'Krzysztof Nowicki 0002' in Google