Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
A deterministic algorithm for the MST problem in constant rounds of congested clique.
Krzysztof Nowicki
Venue
A*
STOC
Year
2021
Proceedings
STOC
DBLP record
conf/stoc/000221a ↗
Browse the full
STOC paper archive
.