{"id":"https://openalex.org/W4380880046","doi":"https://doi.org/10.1145/3583668.3594577","title":"Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique","display_name":"Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380880046","doi":"https://doi.org/10.1145/3583668.3594577"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594577","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594577","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594577","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 2023 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/3583668.3594577","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"],"raw_orcid":"https://orcid.org/0000-0002-2191-3381","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"],"raw_orcid":"https://orcid.org/0000-0002-1417-6387","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":0.3871,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63319835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"75","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6879985928535461},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.6694329977035522},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5817654132843018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5494562387466431},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5490676164627075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5137315988540649},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4381568431854248},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.41380536556243896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3947160243988037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3673425614833832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3668718934059143},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3572297990322113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33512938022613525},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.11499759554862976},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10904645919799805}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6879985928535461},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.6694329977035522},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5817654132843018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5494562387466431},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5490676164627075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5137315988540649},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4381568431854248},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.41380536556243896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3947160243988037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3673425614833832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3668718934059143},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3572297990322113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33512938022613525},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.11499759554862976},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10904645919799805},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"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":1,"locations":[{"id":"doi:10.1145/3583668.3594577","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594577","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594577","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 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583668.3594577","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594577","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594577","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 2023 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/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/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"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"}],"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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380880046.pdf","grobid_xml":"https://content.openalex.org/works/W4380880046.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1861736669","https://openalex.org/W1979505770","https://openalex.org/W1987099434","https://openalex.org/W2033177550","https://openalex.org/W2067661972","https://openalex.org/W2084990336","https://openalex.org/W2099143789","https://openalex.org/W2102560346","https://openalex.org/W2133352257","https://openalex.org/W2139535340","https://openalex.org/W2140097884","https://openalex.org/W2208409594","https://openalex.org/W2949824190","https://openalex.org/W2950813619","https://openalex.org/W2963324223","https://openalex.org/W2963751092","https://openalex.org/W3034415339","https://openalex.org/W3034903651","https://openalex.org/W3126680358","https://openalex.org/W3127810600","https://openalex.org/W3128057791","https://openalex.org/W3129191225","https://openalex.org/W3159770304","https://openalex.org/W4213060883","https://openalex.org/W4249075686","https://openalex.org/W4254419859","https://openalex.org/W4286209950","https://openalex.org/W4313203312"],"related_works":["https://openalex.org/W4366835705","https://openalex.org/W2034363746","https://openalex.org/W4399505169","https://openalex.org/W2008097580","https://openalex.org/W2930989993","https://openalex.org/W4308900515","https://openalex.org/W2949905238","https://openalex.org/W2149754020","https://openalex.org/W2110659829","https://openalex.org/W1675505269"],"abstract_inverted_index":{"In":[0,22],"this":[1,45],"paper,":[2],"we":[3,24,76,102,118],"bring":[4],"the":[5,8,12],"techniques":[6],"of":[7,122],"Laplacian":[9,30],"paradigm":[10],"to":[11,19,27,33,43],"congested":[13],"clique,":[14],"while":[15],"further":[16],"restricting":[17],"ourselves":[18],"deterministic":[20],"algorithms.":[21],"particular,":[23],"show":[25,41],"how":[26,42],"solve":[28],"a":[29,67,94,104],"system":[31],"up":[32],"precision":[34],"\u03f5":[35],"in":[36,111],"no(1)":[37,81],"log(1/\u03f5)":[38],"rounds.":[39],"We":[40,56],"leverage":[44],"result":[46],"within":[47],"existing":[48],"interior":[49],"point":[50],"methods":[51],"for":[52,63,87,107],"solving":[53],"flow":[54,65,92],"problems.":[55],"obtain":[57,77],"an":[58,78],"m3/7+o(1)":[59],"U1/7":[60],"round":[61,85],"algorithm":[62,86],"maximum":[64,72,98],"on":[66,93],"weighted":[68],"directed":[69,95],"graph":[70,96],"with":[71,97],"weight":[73],"U,":[74],"and":[75],"\u00d5(m3/7(n0.158":[79],"+":[80],"poly":[82],"log":[83],"W))":[84],"unit":[88],"capacity":[89],"minimum":[90],"cost":[91,99],"W.":[100],"Hereto,":[101],"give":[103],"novel":[105],"routine":[106],"computing":[108],"Eulerian":[109],"orientations":[110],"O(log":[112],"n":[113],"log*":[114],"n)":[115],"rounds,":[116],"which":[117],"believe":[119],"may":[120],"be":[121],"separate":[123],"interest.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-27T08:22:11.395708","created_date":"2025-10-10T00:00:00"}