{"id":"https://openalex.org/W2075862701","doi":"https://doi.org/10.1137/0220006","title":"High-Probability Parallel Transitive-Closure Algorithms","display_name":"High-Probability Parallel Transitive-Closure Algorithms","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W2075862701","doi":"https://doi.org/10.1137/0220006","mag":"2075862701"},"language":"en","primary_location":{"id":"doi:10.1137/0220006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220006","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5089065417","display_name":"Jeffrey D. Ullman","orcid":"https://orcid.org/0000-0002-1847-3426"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeffrey D. Ullman","raw_affiliation_strings":["Stanford University Stanford CA"],"affiliations":[{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["AT&T Bell Labs.,Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Labs.,Murray Hill, NJ","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089065417"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":3.0789,"has_fulltext":false,"cited_by_count":157,"citation_normalized_percentile":{"value":0.92309638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"20","issue":"1","first_page":"100","last_page":"125"},"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.9993000030517578,"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.9993000030517578,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9986000061035156,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.8499176502227783},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6329623460769653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5823569893836975},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5429911017417908},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5239922404289246},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5236123204231262},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5079973340034485},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4936119318008423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4877820611000061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4472455084323883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4309339225292206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2306189239025116},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08009651303291321}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8499176502227783},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6329623460769653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5823569893836975},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5429911017417908},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5239922404289246},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5236123204231262},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5079973340034485},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4936119318008423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4877820611000061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4472455084323883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4309339225292206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2306189239025116},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08009651303291321},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220006","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":6,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1994373792","https://openalex.org/W2004350101","https://openalex.org/W2088570605","https://openalex.org/W2122362506","https://openalex.org/W2130566259"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W2123627450","https://openalex.org/W203725150","https://openalex.org/W4230967508","https://openalex.org/W1499233953"],"abstract_inverted_index":{"There":[0],"is":[1,47,70,79,245,251,263,282],"a":[2,49,112,217,220,229,252],"straightforward":[3],"algorithm":[4,46,69,99,136,274],"for":[5,58,64,100,107,126,254,296],"computing":[6],"the":[7,60,77,87,108,127,131,144,206,255,259,273,276,289],"transitive-closure":[8,62,89,101],"of":[9,52,195],"an":[10,19,97,135],"n-node":[11],"graph":[12,78,113],"in":[13,39,54,275],"$O(\\log":[14],"^2":[15],"n)$":[16],"time":[17,41,155,177,256],"on":[18,111,130],"EREW-PRAM,":[20],"using":[21],"$n^3":[22],"/":[23,31],"\\log":[24,32],"n$":[25,33,120],"processors,":[26,163,185],"or":[27,81,122],"indeed":[28],"with":[29,114,143,156,233,288],"$M(n)":[30],"processors":[34,106,125],"if":[35,214],"serial":[36],"matrix":[37],"multiplication":[38],"$M(n)$":[40],"can":[42,147,268,293],"be":[43,93,140,148,269,294],"done.":[44],"This":[45],"within":[48],"log":[50],"factor":[51],"optimal":[53,73],"work":[55],"(processor-time":[56],"product),":[57],"solving":[59],"all-pairs":[61,128],"problem":[63,110,129],"dense":[65],"graphs.":[66],"However,":[67,261],"this":[68],"far":[71],"from":[72],"when":[74],"either":[75],"(a)":[76],"sparse,":[80],"(b)":[82],"we":[83],"want":[84],"to":[85,95,227,285],"solve":[86],"single-source":[88,109,297],"problem.":[90],"It":[91],"would":[92],"ideal":[94],"have":[96],"$\\mathcal{NC}$":[98],"that":[102,137,199,212,231,265],"took":[103],"about":[104,123],"e":[105],"n":[115],"nodes":[116],"and":[117,172,178,249],"$e":[118,165,187],"\\geqq":[119,188],"arcs,":[121],"$en$":[124],"same":[132,290],"graph.":[133],"While":[134],"good":[138],"cannot":[139],"offered,":[141],"algorithms":[142,207],"following":[145],"performance":[146,291],"offered.":[149],"(1)":[150],"For":[151],"single-source,":[152],"$\\tilde{O}(n^\\varepsilon":[153,175],")$":[154,162,176,184],"$\\tilde":[157,179],"O(en^{1":[158,180],"-":[159,168,181,190,238],"2\\varepsilon":[160,191],"}":[161,170,183,192],"provided":[164,186],">":[166],"n^{2":[167,189],"3\\varepsilon":[169],"$,":[171,241],"(2)":[173],"forall-pairs,":[174],"\\varepsilon":[182,202],"$.":[193],"Each":[194],"these":[196],"claims":[197],"assumes":[198],"$0":[200],"<":[201],"\\leqq":[203],"\\frac{1}{2}$.":[204],"Importantly,":[205],"are":[208],"(only)":[209],"high-probability":[210],"algorithms;":[211],"is,":[213],"they":[215,224],"find":[216,228],"path,":[218],"then":[219],"path":[221,230],"exists,":[222],"but":[223],"may":[225],"fail":[226],"exists":[232],"probability":[234],"at":[235],"most":[236],"$2^{":[237],"\\alpha":[239],"c}":[240],"where":[242],"$\\alpha":[243],"$":[244],"some":[246],"positive":[247],"constant,":[248],"c":[250],"multiplier":[253],"taken":[257],"by":[258],"algorithm.":[260],"it":[262,281],"shown":[264,283],"incorrect":[266],"results":[267],"detected,":[270],"thus":[271],"putting":[272],"\"Las":[277],"Vegas\"":[278],"class.":[279],"Finally,":[280],"how":[284],"do":[286],"\"breadth-first-search\"":[287],"as":[292],"achieved":[295],"transitive":[298],"closure.":[299]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}