{"id":"https://openalex.org/W2734687249","doi":"https://doi.org/10.1145/3188745.3188764","title":"Round compression for parallel matching algorithms","display_name":"Round compression for parallel matching algorithms","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2734687249","doi":"https://doi.org/10.1145/3188745.3188764","mag":"2734687249"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188764","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/267189","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051815913","display_name":"Artur Czumaj","orcid":"https://orcid.org/0000-0002-7743-438X"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Artur Czumaj","raw_affiliation_strings":["University of Warwick, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044510135","display_name":"Jakub \u0141\u0105cki","orcid":"https://orcid.org/0000-0001-9347-0041"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jakub \u0141\u0105cki","raw_affiliation_strings":["Google Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032574693","display_name":"Aleksander M\u0105dry","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aleksander M\u0105dry","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040763434","display_name":"Krzysztof Onak","orcid":"https://orcid.org/0000-0003-0226-7449"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krzysztof Onak","raw_affiliation_strings":["IBM Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["University of Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"471","last_page":"484"},"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.9991000294685364,"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.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.8374912738800049},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7991049289703369},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6965277194976807},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6952366232872009},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.6034067869186401},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4671907424926758},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42905205488204956},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.42571738362312317},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42279157042503357},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3975425362586975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.345514714717865},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11532887816429138},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10033372044563293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06911545991897583}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8374912738800049},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7991049289703369},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6965277194976807},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6952366232872009},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.6034067869186401},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4671907424926758},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42905205488204956},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.42571738362312317},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42279157042503357},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3975425362586975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.345514714717865},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11532887816429138},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10033372044563293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06911545991897583},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":3,"locations":[{"id":"doi:10.1145/3188745.3188764","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:101747","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"},{"id":"pmh:oai:infoscience.epfl.ch:267189","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/267189","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:267189","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/267189","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3046054759","display_name":null,"funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3329116365","display_name":"CAREER: Fast Graph Algorithms and Continuous Optimization","funder_award_id":"1553428","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3869665861","display_name":null,"funder_award_id":"CCF-1553428","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8657054497","display_name":"Sublinear Algorithms for Big Graphs","funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1503698146","https://openalex.org/W1514707655","https://openalex.org/W1530955034","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1980155175","https://openalex.org/W1998137177","https://openalex.org/W2008199814","https://openalex.org/W2011595776","https://openalex.org/W2057082426","https://openalex.org/W2059608229","https://openalex.org/W2073975876","https://openalex.org/W2074629498","https://openalex.org/W2096413587","https://openalex.org/W2100061495","https://openalex.org/W2100830825","https://openalex.org/W2107600509","https://openalex.org/W2133673025","https://openalex.org/W2137373960","https://openalex.org/W2149565746","https://openalex.org/W2153977620","https://openalex.org/W2173213060","https://openalex.org/W2261727491","https://openalex.org/W2275325805","https://openalex.org/W2294952190","https://openalex.org/W2295466155","https://openalex.org/W2318040034","https://openalex.org/W2341465683","https://openalex.org/W2464065967","https://openalex.org/W2546514055","https://openalex.org/W2569455249","https://openalex.org/W2593074473","https://openalex.org/W2619776170","https://openalex.org/W2755229948","https://openalex.org/W2767578875","https://openalex.org/W2951652158","https://openalex.org/W4239429564","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W3015859229","https://openalex.org/W3159871278","https://openalex.org/W2230552005","https://openalex.org/W1975949872","https://openalex.org/W2070865675","https://openalex.org/W1970073092","https://openalex.org/W1657646819","https://openalex.org/W338671845","https://openalex.org/W2054653010","https://openalex.org/W2070426974"],"abstract_inverted_index":{"For":[0],"over":[1],"a":[2],"decade":[3],"now":[4],"we":[5,77],"have":[6],"been":[7],"witnessing":[8],"the":[9,26,32,42,51],"success":[10,30],"of":[11,25,44],"massive":[12],"parallel":[13,86],"computation":[14],"(MPC)":[15],"frameworks,":[16],"such":[17],"as":[18],"MapReduce,":[19],"Hadoop,":[20],"Dryad,":[21],"or":[22,55],"Spark.":[23],"One":[24],"reasons":[27],"for":[28,61],"their":[29],"is":[31,74],"fact":[33],"that":[34,69],"these":[35,58],"frameworks":[36,59],"are":[37],"able":[38],"to":[39,50,82],"accurately":[40],"capture":[41],"nature":[43],"large-scale":[45],"computation.":[46,65],"In":[47],"particular,":[48],"compared":[49],"classic":[52],"distributed":[53],"algorithms":[54],"PRAM":[56],"models,":[57],"allow":[60],"much":[62],"more":[63],"local":[64],"The":[66],"fundamental":[67],"question":[68],"arises":[70],"in":[71],"this":[72,79],"context":[73],"though:":[75],"can":[76],"leverage":[78],"additional":[80],"power":[81],"obtain":[83],"even":[84],"faster":[85],"algorithms?":[87]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}