{"id":"https://openalex.org/W4281643687","doi":"https://doi.org/10.1145/3519935.3520058","title":"Subquadratic dynamic path reporting in directed graphs against an adaptive adversary","display_name":"Subquadratic dynamic path reporting in directed graphs against an adaptive adversary","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281643687","doi":"https://doi.org/10.1145/3519935.3520058"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520058","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5088982819","display_name":"Adam Karczmarz","orcid":"https://orcid.org/0000-0002-2693-8713"},"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":"Adam Karczmarz","raw_affiliation_strings":["University of Warsaw, Poland / IDEAS NCBR, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland / IDEAS NCBR, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046919162","display_name":"Anish Mukherjee","orcid":"https://orcid.org/0000-0002-5857-9778"},"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":"Anish Mukherjee","raw_affiliation_strings":["University of Warsaw, Poland / IDEAS NCBR, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland / IDEAS NCBR, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"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 / IDEAS NCBR, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland / IDEAS NCBR, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1643","last_page":"1656"},"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.9994999766349792,"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.9994999766349792,"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.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9435524940490723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6873437166213989},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5899119973182678},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.589358925819397},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5075560808181763},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49634963274002075},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4657253921031952},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45556971430778503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2500862777233124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2015058398246765},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.08551323413848877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08332818746566772},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08175387978553772}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9435524940490723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6873437166213989},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5899119973182678},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.589358925819397},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5075560808181763},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49634963274002075},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4657253921031952},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45556971430778503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2500862777233124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2015058398246765},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.08551323413848877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08332818746566772},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08175387978553772},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520058","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W8290509","https://openalex.org/W1539451265","https://openalex.org/W1558383352","https://openalex.org/W1599026900","https://openalex.org/W1969485351","https://openalex.org/W1976177462","https://openalex.org/W1982440947","https://openalex.org/W1986380853","https://openalex.org/W1989111470","https://openalex.org/W1997898455","https://openalex.org/W2014881855","https://openalex.org/W2019301863","https://openalex.org/W2049500052","https://openalex.org/W2080132708","https://openalex.org/W2096111774","https://openalex.org/W2099450374","https://openalex.org/W2115271283","https://openalex.org/W2118914279","https://openalex.org/W2146507303","https://openalex.org/W2162118804","https://openalex.org/W2342666984","https://openalex.org/W2401697020","https://openalex.org/W2571471359","https://openalex.org/W2792348861","https://openalex.org/W2950039944","https://openalex.org/W2963464974","https://openalex.org/W2964023274","https://openalex.org/W2971415725","https://openalex.org/W2971800005","https://openalex.org/W2978363495","https://openalex.org/W2996650128","https://openalex.org/W3002774327","https://openalex.org/W3035518111","https://openalex.org/W3116290630","https://openalex.org/W3127039040","https://openalex.org/W3127776752","https://openalex.org/W3139713485","https://openalex.org/W3186466528","https://openalex.org/W4213048098"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2143461633","https://openalex.org/W2150194458","https://openalex.org/W4321471459","https://openalex.org/W2889071233","https://openalex.org/W2380814829","https://openalex.org/W2387511021"],"abstract_inverted_index":{"We":[0],"study":[1],"reachability":[2],"and":[3,19],"shortest":[4],"paths":[5,39],"problems":[6],"in":[7,33],"dynamic":[8,13],"directed":[9],"graphs.":[10],"Whereas":[11],"algebraic":[12],"data":[14],"structures":[15],"supporting":[16],"edge":[17],"updates":[18],"reachability/distance":[20],"queries":[21],"have":[22],"been":[23],"known":[24],"for":[25],"quite":[26],"a":[27],"long":[28],"time,":[29],"they":[30],"do":[31],"not,":[32],"general,":[34],"allow":[35],"reporting":[36],"the":[37,41],"underlying":[38],"within":[40],"same":[42],"time":[43],"bounds,":[44],"especially":[45],"against":[46],"an":[47],"adaptive":[48],"adversary.":[49]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}