{"id":"https://openalex.org/W4412480887","doi":"https://doi.org/10.1145/3694906.3743328","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","display_name":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480887","doi":"https://doi.org/10.1145/3694906.3743328"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743328","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743328","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743328","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743328","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063743357","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0003-4213-9898"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4213-9898","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024456125","display_name":"Jaehyun Koo","orcid":"https://orcid.org/0009-0005-7599-3662"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jaehyun Koo","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0009-0005-7599-3662","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13429518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9919999837875366,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9919999837875366,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9900000095367432,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/decomposition","display_name":"Decomposition","score":0.6688829660415649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6663316488265991},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5152642726898193},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3540840148925781}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6688829660415649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6663316488265991},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5152642726898193},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3540840148925781},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/3694906.3743328","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743328","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743328","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2507.06334","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.06334","pdf_url":"https://arxiv.org/pdf/2507.06334","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/162352","is_oa":true,"landing_page_url":"https://dspace.mit.edu/bitstream/1721.1/162352/1/3694906.3743328.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743328","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743328","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743328","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412480887.pdf","grobid_xml":"https://content.openalex.org/works/W4412480887.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1501843896","https://openalex.org/W1977458171","https://openalex.org/W2010042187","https://openalex.org/W2015255856","https://openalex.org/W2103766763","https://openalex.org/W2118136127","https://openalex.org/W2133131640","https://openalex.org/W2133238553","https://openalex.org/W2152993997","https://openalex.org/W2164648353","https://openalex.org/W2291620117","https://openalex.org/W2340222647","https://openalex.org/W2429442430","https://openalex.org/W2436525433","https://openalex.org/W2725219117","https://openalex.org/W2802440256","https://openalex.org/W2803164760","https://openalex.org/W2914676137","https://openalex.org/W2923254968","https://openalex.org/W2928353730","https://openalex.org/W2945994473","https://openalex.org/W3012623728","https://openalex.org/W3013028797","https://openalex.org/W3025430826","https://openalex.org/W3028730956","https://openalex.org/W3033544197","https://openalex.org/W3035455649","https://openalex.org/W3103041003","https://openalex.org/W3105712299","https://openalex.org/W3173581101","https://openalex.org/W4280508381","https://openalex.org/W4285005134","https://openalex.org/W4390575862","https://openalex.org/W4399339454","https://openalex.org/W4399343417","https://openalex.org/W6772239946"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,45,50,76,89,92,97],"first":[3],"parallel":[4],"batch-dynamic":[5],"algorithm":[6,24,69],"for":[7],"approximating":[8],"coreness":[9],"decomposition":[10],"with":[11,70,88],"worst-case":[12,35],"update":[13],"times.":[14],"Given":[15],"any":[16],"batch":[17,46,51],"of":[18,38,79,91],"edge":[19],"insertions":[20],"and":[21,84,95],"deletions,":[22],"our":[23],"processes":[25],"all":[26],"these":[27],"updates":[28],"in":[29,54],"poly(log":[30,40],"n)":[31,41],"depth,":[32],"using":[33],"a":[34],"work":[36,78,93],"bound":[37],"b.":[39],"where":[42],"b":[43],"denotes":[44],"size.":[47],"This":[48],"means":[49],"gets":[52],"processed":[53],"\u00d5(b/p)":[55],"time,":[56],"given":[57],"p":[58],"processors,":[59],"which":[60],"is":[61],"optimal":[62],"up":[63],"to":[64],"logarithmic":[65],"factors.":[66],"Previously,":[67],"an":[68],"similar":[71],"guarantees":[72],"was":[73],"known":[74],"by":[75],"celebrated":[77],"Liu,":[80],"Shi,":[81],"Yu,":[82],"Dhulipala,":[83],"Shun":[85],"[SPAA'22],":[86],"but":[87],"caveat":[90],"bound,":[94],"thus":[96],"runtime,":[98],"being":[99],"only":[100],"amortized.":[101]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}