{"id":"https://openalex.org/W2993631756","doi":"https://doi.org/10.1145/3406325.3451136","title":"A deterministic algorithm for the MST problem in constant rounds of congested clique","display_name":"A deterministic algorithm for the MST problem in constant rounds of congested clique","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W2993631756","doi":"https://doi.org/10.1145/3406325.3451136","mag":"2993631756"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451136","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1912.04239","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013781866","display_name":"Krzysztof Nowicki","orcid":"https://orcid.org/0000-0002-6770-6644"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["DK","PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Nowicki","raw_affiliation_strings":["University of Copenhagen, Denmark / University of Wroc\u0142aw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark / University of Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I124055696","https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013781866"],"corresponding_institution_ids":["https://openalex.org/I124055696","https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":4.0868,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.94719012,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1154","last_page":"1165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7918635010719299},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6742703914642334},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5512529015541077},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.5345780849456787},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5329084992408752},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5065010786056519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4680214822292328},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4543456733226776},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.41761982440948486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3980202078819275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3242028057575226}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7918635010719299},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6742703914642334},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5512529015541077},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.5345780849456787},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5329084992408752},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5065010786056519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4680214822292328},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4543456733226776},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.41761982440948486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3980202078819275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3242028057575226},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3406325.3451136","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1912.04239","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1912.04239","pdf_url":"https://arxiv.org/pdf/1912.04239","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2993631756","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1912.04239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ce5a366c-c40c-44c6-b59a-45f598a680d5","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/ce5a366c-c40c-44c6-b59a-45f598a680d5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nowicki , K 2021 , A deterministic algorithm for the MST problem in constant rounds of congested clique . in S Khuller & V V Williams (eds) , STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery, Inc. , pp. 1154-1165 , 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 , Virtual, Online , Italy , 21/06/2021 . https://doi.org/10.1145/3406325.3451136","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.1912.04239","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1912.04239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1912.04239","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1912.04239","pdf_url":"https://arxiv.org/pdf/1912.04239","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2993631756.pdf","grobid_xml":"https://content.openalex.org/works/W2993631756.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1985361054","https://openalex.org/W1987099434","https://openalex.org/W1992996565","https://openalex.org/W2027637765","https://openalex.org/W2071346873","https://openalex.org/W2138304862","https://openalex.org/W2139535340","https://openalex.org/W2174199856","https://openalex.org/W2488670996","https://openalex.org/W2771846305","https://openalex.org/W2951272922","https://openalex.org/W2964107726","https://openalex.org/W4213146104","https://openalex.org/W4230889046"],"related_works":["https://openalex.org/W2964107726","https://openalex.org/W94109713","https://openalex.org/W2961211810","https://openalex.org/W2952428427","https://openalex.org/W3208584311","https://openalex.org/W2963181990","https://openalex.org/W2899261484","https://openalex.org/W1801535255","https://openalex.org/W1561005397","https://openalex.org/W2480829993","https://openalex.org/W2979506797","https://openalex.org/W2488670996","https://openalex.org/W2107805020","https://openalex.org/W2083323175","https://openalex.org/W2962997742","https://openalex.org/W2963131837","https://openalex.org/W2971407628","https://openalex.org/W2489999748","https://openalex.org/W1666479227","https://openalex.org/W2802632688"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"show":[4],"that":[5],"the":[6,20],"Minimum":[7],"Spanning":[8],"Tree":[9],"problem":[10],"(MST)":[11],"can":[12],"be":[13],"solved":[14],"deterministically":[15],"in":[16],"O(1)":[17],"rounds":[18],"of":[19],"Congested":[21],"Clique":[22],"model.":[23]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2022-07-26T00:00:00"}