{"id":"https://openalex.org/W4286209950","doi":"https://doi.org/10.1145/3519270.3538436","title":"The Laplacian Paradigm in the Broadcast Congested Clique","display_name":"The Laplacian Paradigm in the Broadcast Congested Clique","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286209950","doi":"https://doi.org/10.1145/3519270.3538436"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538436","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538436","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538436","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538436","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053481668","display_name":"Sebastian Forster","orcid":"https://orcid.org/0000-0002-2191-3381"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Sebastian Forster","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079386151","display_name":"Tijn de Vos","orcid":"https://orcid.org/0000-0002-1417-6387"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Tijn de Vos","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053481668"],"corresponding_institution_ids":["https://openalex.org/I182212641"],"apc_list":null,"apc_paid":null,"fwci":1.2071,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81367273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"344"},"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.9994000196456909,"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.9994000196456909,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9983999729156494,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8349424600601196},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.8192481398582458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6155377626419067},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.6076129078865051},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39469438791275024},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3155258595943451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3154294490814209}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8349424600601196},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.8192481398582458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6155377626419067},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.6076129078865051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39469438791275024},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3155258595943451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3154294490814209},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519270.3538436","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538436","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538436","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519270.3538436","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538436","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538436","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1317235720","display_name":"Dynamic Algorithms Against Strong Adversaries","funder_award_id":"947702","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1580716774","display_name":null,"funder_award_id":"947702","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5036817778","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innov","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5399556803","display_name":null,"funder_award_id":"This project has received funding from the Europea","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5833454457","display_name":null,"funder_award_id":"P 32863-N","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8151294431","display_name":"Distributed Algorithms for Fundamental Graph Problems","funder_award_id":"P 32863","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8633428685","display_name":null,"funder_award_id":"European Union's Horizon 2020 research and innovat","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4286209950.pdf","grobid_xml":"https://content.openalex.org/works/W4286209950.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1506342804","https://openalex.org/W1558308955","https://openalex.org/W1861736669","https://openalex.org/W1916091028","https://openalex.org/W1945899805","https://openalex.org/W1983193888","https://openalex.org/W1987099434","https://openalex.org/W2037757210","https://openalex.org/W2040011014","https://openalex.org/W2045760791","https://openalex.org/W2084990336","https://openalex.org/W2096908304","https://openalex.org/W2107805020","https://openalex.org/W2129575457","https://openalex.org/W2509547575","https://openalex.org/W2609880033","https://openalex.org/W2616345629","https://openalex.org/W2767763836","https://openalex.org/W2950542405","https://openalex.org/W2950813619","https://openalex.org/W2963098024","https://openalex.org/W2963489806","https://openalex.org/W3010935026","https://openalex.org/W3013346861","https://openalex.org/W3028705187","https://openalex.org/W3101974321","https://openalex.org/W3112410551","https://openalex.org/W3127041097","https://openalex.org/W3159770304","https://openalex.org/W3167705025","https://openalex.org/W3214887360","https://openalex.org/W4205300528","https://openalex.org/W4231761369","https://openalex.org/W4244670803","https://openalex.org/W4256354285"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W8322802","https://openalex.org/W314331466","https://openalex.org/W2049545441","https://openalex.org/W3120490799"],"abstract_inverted_index":{"In":[0],"this":[1,41],"paper,":[2],"we":[3,43],"bring":[4],"the":[5,9,13,45],"main":[6],"tools":[7],"of":[8,29,49],"Laplacian":[10,37],"paradigm":[11],"to":[12,21,34],"Broadcast":[14],"Congested":[15],"Clique.":[16],"We":[17],"introduce":[18],"an":[19,35],"algorithm":[20],"compute":[22],"spectral":[23],"sparsifiers":[24],"in":[25],"a":[26],"polylogarithmic":[27],"number":[28],"rounds,":[30],"which":[31],"directly":[32],"leads":[33],"efficient":[36],"solver.":[38],"Based":[39],"on":[40],"primitive,":[42],"consider":[44],"linear":[46],"program":[47],"solver":[48],"Lee":[50],"and":[51],"Sidford":[52],"[30].":[53]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":6}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}