{"id":"https://openalex.org/W2612688822","doi":"https://doi.org/10.1145/3210377.3210391","title":"Towards a Complexity Theory for the Congested Clique","display_name":"Towards a Complexity Theory for the Congested Clique","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2612688822","doi":"https://doi.org/10.1145/3210377.3210391","mag":"2612688822"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1705.03284","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085809864","display_name":"Janne H. Korhonen","orcid":"https://orcid.org/0009-0000-5494-1218"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Janne H. Korhonen","raw_affiliation_strings":["Aalto University, Helsinki, Finland","Aalto University Helsinki, Finland#TAB#"],"affiliations":[{"raw_affiliation_string":"Aalto University, Helsinki, Finland","institution_ids":["https://openalex.org/I9927081"]},{"raw_affiliation_string":"Aalto University Helsinki, Finland#TAB#","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025555126","display_name":"Jukka Suomela","orcid":"https://orcid.org/0000-0001-6117-8089"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jukka Suomela","raw_affiliation_strings":["Aalto University, Helsinki, Finland","Aalto University Helsinki, Finland#TAB#"],"affiliations":[{"raw_affiliation_string":"Aalto University, Helsinki, Finland","institution_ids":["https://openalex.org/I9927081"]},{"raw_affiliation_string":"Aalto University Helsinki, Finland#TAB#","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085809864"],"corresponding_institution_ids":["https://openalex.org/I9927081"],"apc_list":null,"apc_paid":null,"fwci":0.6412,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69577096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"163","last_page":"172"},"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.9998999834060669,"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.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9993000030517578,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7814381122589111},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7696207761764526},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5993900895118713},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.592686653137207},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5575966238975525},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5325101017951965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5047873258590698},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4698570966720581},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4478133022785187},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4318251609802246},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.42584189772605896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.425646036863327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4024673402309418},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3922611474990845},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37733182311058044},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19899588823318481},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.15356802940368652}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7814381122589111},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7696207761764526},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5993900895118713},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.592686653137207},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5575966238975525},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5325101017951965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5047873258590698},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4698570966720581},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4478133022785187},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4318251609802246},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.42584189772605896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.425646036863327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4024673402309418},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3922611474990845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37733182311058044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19899588823318481},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.15356802940368652},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3210377.3210391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1705.03284","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.03284","pdf_url":"https://arxiv.org/pdf/1705.03284","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},{"id":"mag:2612688822","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1705.03284","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"doi:10.48550/arxiv.1705.03284","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1705.03284","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1705.03284","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.03284","pdf_url":"https://arxiv.org/pdf/1705.03284","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4798357039","display_name":null,"funder_award_id":"285721","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"}],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2612688822.pdf","grobid_xml":"https://content.openalex.org/works/W2612688822.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W1522036931","https://openalex.org/W1534484868","https://openalex.org/W1845051857","https://openalex.org/W1973852671","https://openalex.org/W1987099434","https://openalex.org/W1992996565","https://openalex.org/W2004471951","https://openalex.org/W2015819397","https://openalex.org/W2017345786","https://openalex.org/W2023425290","https://openalex.org/W2030825457","https://openalex.org/W2040011014","https://openalex.org/W2056295140","https://openalex.org/W2067202579","https://openalex.org/W2094090625","https://openalex.org/W2100061495","https://openalex.org/W2107008873","https://openalex.org/W2107282727","https://openalex.org/W2107284348","https://openalex.org/W2107805020","https://openalex.org/W2116087731","https://openalex.org/W2120248756","https://openalex.org/W2125495920","https://openalex.org/W2139535340","https://openalex.org/W2156047991","https://openalex.org/W2174199856","https://openalex.org/W2184633425","https://openalex.org/W2243868910","https://openalex.org/W2281539709","https://openalex.org/W2331029490","https://openalex.org/W2423472978","https://openalex.org/W2478193891","https://openalex.org/W2478525310","https://openalex.org/W2488670996","https://openalex.org/W2511108295","https://openalex.org/W2552279664","https://openalex.org/W2593376981","https://openalex.org/W2914414140","https://openalex.org/W2949232331","https://openalex.org/W2962850638","https://openalex.org/W2963204136","https://openalex.org/W3103882277","https://openalex.org/W6717701438"],"related_works":["https://openalex.org/W2005285611","https://openalex.org/W2417744963","https://openalex.org/W25732316","https://openalex.org/W2950617606","https://openalex.org/W2153788141","https://openalex.org/W1970149677","https://openalex.org/W1588175467","https://openalex.org/W3083920957","https://openalex.org/W3139077408","https://openalex.org/W3178133733","https://openalex.org/W1969550276","https://openalex.org/W2407924029","https://openalex.org/W2068490784","https://openalex.org/W3000033813","https://openalex.org/W1557841126","https://openalex.org/W3194724515","https://openalex.org/W3196775331","https://openalex.org/W1706481075","https://openalex.org/W2461225692","https://openalex.org/W2063926602"],"abstract_inverted_index":{"The":[0],"congested":[1,42,52,86,97,163,175,207,229],"clique":[2,53,98,208],"model":[3,13,99],"of":[4,28,37,80,84,183,223,227],"distributed":[5,17],"computing":[6],"has":[7,21],"been":[8,22],"receiving":[9],"attention":[10],"as":[11,57,59],"a":[12,77,108,152,169,212,219],"for":[14,40,155,161,173],"densely":[15],"connected":[16],"systems.":[18],"While":[19],"there":[20,106,179],"significant":[23],"progress":[24],"on":[25],"the":[26,41,81,85,95,131,137,146,162,174,189,206,224,228],"side":[27],"upper":[29],"bounds,":[30],"we":[31,67,167],"have":[32],"very":[33],"little":[34],"in":[35,118,188,205],"terms":[36],"lower":[38,54,62,142,159],"bounds":[39,55,160],"clique;":[43],"indeed,":[44],"it":[45],"is":[46,56,107],"now":[47],"known":[48],"that":[49,105,113,178,211],"proving":[50,60,156],"explicit":[51],"difficult":[58],"circuit":[61],"bounds.":[63],"In":[64,165],"this":[65],"work,":[66],"use":[68],"various":[69,202],"more":[70],"traditional":[71],"complexity":[72,82,214,225],"theory":[73,215],"tools":[74],"to":[75,101,136,151],"build":[76],"clearer":[78],"picture":[79,222],"landscape":[83,226],"clique:":[87],"\\beginitemize":[88],"\u0131tem":[89,140,194],"Nondeterminism":[90],"and":[91,103,191],"beyond:":[92],"We":[93,124,144,197],"introduce":[94],"nondeterministic":[96,122,192],"(analogous":[100,135],"NP)":[102],"show":[104],"natural":[109,203],"canonical":[110],"problem":[111],"family":[112],"captures":[114],"all":[115,185],"problems":[116,182,204],"solvable":[117],"constant":[119],"time":[120,170],"with":[121],"algorithms.":[123],"further":[125],"generalise":[126],"these":[127],"notions":[128],"by":[129],"introducing":[130],"constant-round":[132],"decision":[133,181],"hierarchy":[134,171],"polynomial":[138],"hierarchy).":[139],"Non-constructive":[141],"bounds:":[143],"lift":[145],"prior":[147],"non-uniform":[148],"counting":[149],"arguments":[150],"general":[153],"technique":[154],"non-constructive":[157],"uniform":[158],"clique.":[164,230],"particular,":[166],"prove":[168],"theorem":[172],"clique,":[176],"showing":[177],"are":[180],"essentially":[184],"complexities,":[186],"both":[187],"deterministic":[190],"settings.":[193],"Fine-grained":[195],"complexity:":[196],"map":[198],"out":[199],"relationships":[200],"between":[201],"model,":[209],"arguing":[210],"reduction-based":[213],"currently":[216],"gives":[217],"us":[218],"fairly":[220],"good":[221],"\\enditemize":[231]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}