{"id":"https://openalex.org/W4376639500","doi":"https://doi.org/10.1145/3564246.3585213","title":"Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch","display_name":"Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639500","doi":"https://doi.org/10.1145/3564246.3585213"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585213","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3564246.3585213","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585213","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585213","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085628077","display_name":"Sebastian F\u00f6rster","orcid":null},"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":"Sebastian Forster","raw_affiliation_strings":["University of Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"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":"Yasamin Nazari","raw_affiliation_strings":["University of Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015325792","display_name":"Maximilian Probst Gutenberg","orcid":"https://orcid.org/0000-0003-3522-156X"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Maximilian Probst Gutenberg","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9439,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66374324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1173","last_page":"1186"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9995999932289124,"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.9991000294685364,"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/combinatorics","display_name":"Combinatorics","score":0.6793015003204346},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5784095525741577},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5477334260940552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5179554224014282},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.49354088306427},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4838206171989441},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4565936326980591},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4434337913990021},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4115750193595886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3965110182762146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3440869450569153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3102836310863495},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07830214500427246}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6793015003204346},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5784095525741577},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5477334260940552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5179554224014282},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.49354088306427},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4838206171989441},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4565936326980591},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4434337913990021},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4115750193595886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3965110182762146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3440869450569153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3102836310863495},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07830214500427246},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3564246.3585213","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3564246.3585213","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585213","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:cwi.nl:33877","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/33877","pdf_url":"https://ir.cwi.nl/pub/33877/33877.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"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":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/b11b24c9-c73f-45df-9a73-c866045fc1d4","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/b11b24c9-c73f-45df-9a73-c866045fc1d4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Forster, S, Nazari, Y & Maximilian, P G 2023, Deterministic incremental APSP with polylogarithmic update time and stretch. in STOC 2023 : Proceedings of the 55th Annual ACM Symposium on Theory of Computing. ACM, pp. 1173 - 1186. https://doi.org/10.1145/3564246.3585213","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research.vu.nl:publications/b11b24c9-c73f-45df-9a73-c866045fc1d4","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/b11b24c9-c73f-45df-9a73-c866045fc1d4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Forster, S, Nazari, Y & Maximilian, P G 2023, Deterministic incremental APSP with polylogarithmic update time and stretch. in STOC 2023 : Proceedings of the 55th Annual ACM Symposium on Theory of Computing. ACM, pp. 1173 - 1186. https://doi.org/10.1145/3564246.3585213","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585213","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3564246.3585213","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585213","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1580716774","display_name":null,"funder_award_id":"947702","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"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/W4376639500.pdf","grobid_xml":"https://content.openalex.org/works/W4376639500.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W1539451265","https://openalex.org/W1554407673","https://openalex.org/W1982440947","https://openalex.org/W1990488650","https://openalex.org/W2015725509","https://openalex.org/W2038084411","https://openalex.org/W2039303552","https://openalex.org/W2045446569","https://openalex.org/W2056760235","https://openalex.org/W2058084873","https://openalex.org/W2063860324","https://openalex.org/W2085849292","https://openalex.org/W2097458838","https://openalex.org/W2098207812","https://openalex.org/W2115271283","https://openalex.org/W2120994821","https://openalex.org/W2126166149","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2248152086","https://openalex.org/W2342666984","https://openalex.org/W2418286382","https://openalex.org/W2888518448","https://openalex.org/W2900627138","https://openalex.org/W2912435829","https://openalex.org/W2949477394","https://openalex.org/W2950039944","https://openalex.org/W2952708184","https://openalex.org/W2971415725","https://openalex.org/W2971800005","https://openalex.org/W2978363495","https://openalex.org/W2997310712","https://openalex.org/W3034903651","https://openalex.org/W3115813873","https://openalex.org/W3116290630","https://openalex.org/W3118037713","https://openalex.org/W3125058277","https://openalex.org/W3129012052","https://openalex.org/W3170339516","https://openalex.org/W3181166125","https://openalex.org/W3186466528","https://openalex.org/W4220694210","https://openalex.org/W4250700905","https://openalex.org/W4256186298","https://openalex.org/W4281643687","https://openalex.org/W4281752231","https://openalex.org/W4308161771","https://openalex.org/W4313203312","https://openalex.org/W4315779722","https://openalex.org/W6817014290"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W1862126075","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W1447961680","https://openalex.org/W2018076478"],"abstract_inverted_index":{"We":[0],"provide":[1],"the":[2,28,36],"first":[3],"deterministic":[4],"data":[5],"structure":[6],"that":[7],"given":[8],"a":[9,40],"weighted":[10],"undirected":[11],"graph":[12,38],"undergoing":[13],"edge":[14],"insertions,":[15],"processes":[16],"each":[17],"update":[18,22],"with":[19,39],"polylogarithmic":[20,41],"amortized":[21],"time":[23],"and":[24],"answers":[25],"queries":[26],"for":[27],"distance":[29],"between":[30],"any":[31],"pair":[32],"of":[33],"vertices":[34],"in":[35,43],"current":[37],"approximation":[42],"O(loglogn)":[44],"time.":[45]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}