{"id":"https://openalex.org/W4412480881","doi":"https://doi.org/10.1145/3694906.3743322","title":"Parallel Batch-Dynamic Algorithms for Spanners, and Extensions","display_name":"Parallel Batch-Dynamic Algorithms for Spanners, and Extensions","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480881","doi":"https://doi.org/10.1145/3694906.3743322"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743322","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743322","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743322","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.3743322","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.17069517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"313"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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.7095056772232056},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46173131465911865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4209526777267456}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7095056772232056},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46173131465911865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4209526777267456}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3694906.3743322","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743322","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743322","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.06338","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.06338","pdf_url":"https://arxiv.org/pdf/2507.06338","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/162350","is_oa":true,"landing_page_url":"https://dspace.mit.edu/bitstream/1721.1/162350/1/3694906.3743322.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.3743322","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743322","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743322","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/W4412480881.pdf","grobid_xml":"https://content.openalex.org/works/W4412480881.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1506345875","https://openalex.org/W1968301997","https://openalex.org/W2002041206","https://openalex.org/W2005580106","https://openalex.org/W2015255856","https://openalex.org/W2017322423","https://openalex.org/W2025919541","https://openalex.org/W2034501275","https://openalex.org/W2044112344","https://openalex.org/W2051540665","https://openalex.org/W2057994027","https://openalex.org/W2063860324","https://openalex.org/W2099556589","https://openalex.org/W2149100736","https://openalex.org/W2152993997","https://openalex.org/W2336483534","https://openalex.org/W2419092805","https://openalex.org/W2436525433","https://openalex.org/W2503099161","https://openalex.org/W2797929180","https://openalex.org/W2885760180","https://openalex.org/W2898134584","https://openalex.org/W2914676137","https://openalex.org/W2923254968","https://openalex.org/W3013028797","https://openalex.org/W3016564237","https://openalex.org/W3025430826","https://openalex.org/W3032246104","https://openalex.org/W3101090353","https://openalex.org/W3103041003","https://openalex.org/W3104306072","https://openalex.org/W4206441762","https://openalex.org/W4231761369","https://openalex.org/W4280508381","https://openalex.org/W4285005134","https://openalex.org/W4285077651","https://openalex.org/W4399339454","https://openalex.org/W4399343417","https://openalex.org/W6661489715","https://openalex.org/W6719292326"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,38],"first":[4],"parallel":[5],"batch-dynamic":[6],"algorithms":[7,14],"for":[8],"computing":[9],"spanners":[10],"and":[11,21,32],"sparsifiers.":[12],"Our":[13,41],"process":[15],"any":[16],"batch":[17,39],"of":[18],"edge":[19],"insertions":[20],"deletions":[22],"in":[23,28,37],"an":[24],"n-node":[25],"undirected":[26],"graph,":[27],"poly(log":[29],"n)":[30],"depth":[31],"using":[33],"amortized":[34],"work":[35],"near-linear":[36],"size.":[40],"concrete":[42],"results":[43],"are":[44],"as":[45],"follows:":[46]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}