{"id":"https://openalex.org/W4285007920","doi":"https://doi.org/10.1145/3490148.3538576","title":"Adaptive Massively Parallel Algorithms for Cut Problems","display_name":"Adaptive Massively Parallel Algorithms for Cut Problems","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285007920","doi":"https://doi.org/10.1145/3490148.3538576"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083712266","display_name":"Marina Knittel","orcid":"https://orcid.org/0009-0008-1498-7519"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marina Knittel","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083806946","display_name":"Jan Olkowski","orcid":"https://orcid.org/0000-0001-9278-3935"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Olkowski","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103122507","display_name":"Hamed Saleh","orcid":"https://orcid.org/0009-0005-0487-659X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hamed Saleh","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111876448"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.2012,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46125606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"40","issue":null,"first_page":"23","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T11181","display_name":"Advanced Data Storage Technologies","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/massively-parallel","display_name":"Massively parallel","score":0.8142685294151306},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7889611721038818},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6799867153167725},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6617749929428101},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5839243531227112},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5688338279724121},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.5664305686950684},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5186442732810974},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46094071865081787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43393367528915405},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34303778409957886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3280043601989746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13561183214187622},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09447997808456421}],"concepts":[{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.8142685294151306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7889611721038818},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6799867153167725},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6617749929428101},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5839243531227112},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5688338279724121},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.5664305686950684},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5186442732810974},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46094071865081787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43393367528915405},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34303778409957886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3280043601989746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13561183214187622},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09447997808456421},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1971680255","https://openalex.org/W1978270311","https://openalex.org/W2057082426","https://openalex.org/W2115049345","https://openalex.org/W2122466336","https://openalex.org/W2153977620","https://openalex.org/W2168919539","https://openalex.org/W2173213060","https://openalex.org/W2542459869","https://openalex.org/W2620820275","https://openalex.org/W2951744441","https://openalex.org/W3046888255","https://openalex.org/W3096540095","https://openalex.org/W4213146104","https://openalex.org/W4241298546","https://openalex.org/W6738734007"],"related_works":["https://openalex.org/W1975949872","https://openalex.org/W3159871278","https://openalex.org/W2230552005","https://openalex.org/W2905242764","https://openalex.org/W3109411864","https://openalex.org/W2144265691","https://openalex.org/W1605991620","https://openalex.org/W113683524","https://openalex.org/W4387251676","https://openalex.org/W4385261619"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,8,22,29,36,81,109,117,133,154,166,172],"Weighted":[3],"Min":[4],"Cut":[5],"problem":[6,119],"in":[7,56,153],"Adaptive":[9],"Massively":[10,30],"Parallel":[11,31],"Computation":[12,32],"(AMPC)":[13],"model.":[14,34],"In":[15,35,132],"2019,":[16],"Behnezhad":[17],"et":[18,60],"al.":[19,61],"[3]":[20],"introduced":[21,55],"AMPC":[23,134],"model":[24],"as":[25,72],"an":[26,65],"extension":[27],"of":[28,67,83,101,120,156],"(MPC)":[33],"past":[37],"decade,":[38],"research":[39],"on":[40,48],"highly":[41,94],"scalable":[42],"algorithms":[43,97,165],"has":[44,78,105,138],"had":[45],"significant":[46],"impact":[47],"many":[49],"massive":[50],"systems.":[51],"The":[52],"MPC":[53,96,130],"model,":[54,135],"2010":[57],"by":[58,108],"Karloff":[59],"[16],":[62],"which":[63,114],"is":[64,150],"abstraction":[66],"famous":[68],"practical":[69,161],"frameworks":[70],"such":[71],"MapReduce,":[73],"Hadoop,":[74],"Flume,":[75],"and":[76,124],"Spark,":[77],"been":[79,90,106],"at":[80],"forefront":[82],"this":[84,163],"research.":[85],"While":[86,159],"great":[87],"strides":[88],"have":[89],"taken":[91],"to":[92,142,168],"create":[93],"efficient":[95],"for":[98],"a":[99,143,157],"range":[100],"problems,":[102],"recent":[103],"progress":[104],"limited":[107],"1-vs-2":[110,173],"Cycle":[111,174],"Conjecture":[112],"[20],":[113],"postulates":[115],"that":[116],"simple":[118],"distinguishing":[121],"between":[122],"one":[123],"two":[125],"cycles":[126],"requires":[127],"\u03a9(log":[128],"n)":[129],"rounds.":[131],"each":[136],"machine":[137],"adaptive":[139],"read":[140],"access":[141],"distributed":[144],"hash":[145],"table":[146],"even":[147],"when":[148],"communication":[149],"restricted":[151],"(i.e.,":[152],"middle":[155],"round).":[158],"remaining":[160],"[4],":[162],"gives":[164],"power":[167],"bypass":[169],"limitations":[170],"like":[171],"Conjecture.":[175]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}