{"id":"https://openalex.org/W4225242249","doi":"https://doi.org/10.1145/3418356","title":"I/O-Efficient Algorithms for Topological Sort and Related Problems","display_name":"I/O-Efficient Algorithms for Topological Sort and Related Problems","publication_year":2022,"publication_date":"2022-01-23","ids":{"openalex":"https://openalex.org/W4225242249","doi":"https://doi.org/10.1145/3418356"},"language":"en","primary_location":{"id":"doi:10.1145/3418356","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3418356","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Georgetown University, NW, Washington, DC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University, NW, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, NW, Washington, DC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University, NW, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022670058","display_name":"Katina Russell","orcid":"https://orcid.org/0009-0005-6230-8427"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katina Russell","raw_affiliation_strings":["Georgetown University, NW, Washington, DC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University, NW, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062016266","display_name":"Eugene Yang","orcid":"https://orcid.org/0000-0002-0051-1535"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eugene Yang","raw_affiliation_strings":["Georgetown University, NW, Washington, DC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University, NW, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5030710270"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":0.4156,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66970124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"18","issue":"1","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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.9969000220298767,"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7045352458953857},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.6381350755691528},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5891024470329285},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5878125429153442},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5621461868286133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5363624691963196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5333815813064575},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5269652009010315},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5121321678161621},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49676328897476196},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42491576075553894},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4196305274963379},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39416998624801636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3751818537712097}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7045352458953857},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.6381350755691528},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5891024470329285},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5878125429153442},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5621461868286133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5363624691963196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5333815813064575},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5269652009010315},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5121321678161621},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49676328897476196},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42491576075553894},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4196305274963379},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39416998624801636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3751818537712097},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3418356","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3418356","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1491965887","https://openalex.org/W1598859508","https://openalex.org/W1972414329","https://openalex.org/W1982231222","https://openalex.org/W1999399436","https://openalex.org/W2009695707","https://openalex.org/W2024633610","https://openalex.org/W2038142281","https://openalex.org/W2057839002","https://openalex.org/W2068700117","https://openalex.org/W2090103608","https://openalex.org/W2097884397","https://openalex.org/W2109280074","https://openalex.org/W2118382442","https://openalex.org/W2136354771","https://openalex.org/W2157927714","https://openalex.org/W2964070308","https://openalex.org/W4292081093","https://openalex.org/W4293572929","https://openalex.org/W6638418167"],"related_works":["https://openalex.org/W2084763084","https://openalex.org/W1519800400","https://openalex.org/W1998712144","https://openalex.org/W4292730466","https://openalex.org/W2951616510","https://openalex.org/W2728444714","https://openalex.org/W2912065432","https://openalex.org/W3210702622","https://openalex.org/W4302345037","https://openalex.org/W4298154565"],"abstract_inverted_index":{"This":[0],"article":[1],"presents":[2],"I/O-efficient":[3,120,136],"algorithms":[4,37,99,121,133,137],"for":[5,13,100,122,138],"topologically":[6,20],"sorting":[7,21,77],"a":[8,27,84],"directed":[9,28,142,158],"acyclic":[10,143],"graph":[11,29],"and":[12,19,40,90,113],"the":[14,22,73,97,118,127,152],"more":[15],"general":[16],"problem":[17,155],"identifying":[18],"strongly":[23],"connected":[24],"components":[25],"of":[26,76,129],"G":[30],"=":[31,60],"(":[32,44,46,57,69],"V,":[33],"E":[34,47,58,62,80],").":[35],"Both":[36],"are":[38,96,117],"randomized":[39],"have":[41],"I/O-costs":[42],"O":[43],"sort":[45,56],")":[48,59],"\u00b7":[49],"poly(log":[50],"V)),":[51],"with":[52,86],"high":[53],"probability,":[54],"where":[55],"O(":[61],"/":[63,67],"B":[64,68,88],"log":[65],"M":[66,92],"E/B":[70],"))":[71],"is":[72],"I/O":[74,110],"cost":[75],"an":[78],"|":[79],"|-element":[81],"array":[82],"on":[83,141,156],"machine":[85],"size-":[87,91],"blocks":[89],"cache/internal":[93],"memory.":[94],"These":[95],"first":[98,119],"these":[101,116,132],"problems":[102,140],"that":[103],"do":[104],"not":[105],"incur":[106],"at":[107],"least":[108],"one":[109],"per":[111],"vertex,":[112],"as":[114,146,149,151],"such":[115,145],"sparse":[123],"graphs.":[124,159],"By":[125],"applying":[126],"technique":[128],"time-forward":[130],"processing,":[131],"also":[134],"imply":[135],"most":[139],"graphs,":[144],"shortest":[147],"paths,":[148],"well":[150],"single-source":[153],"reachability":[154],"arbitrary":[157]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}