{"id":"https://openalex.org/W2014989559","doi":"https://doi.org/10.1137/s0097539795295948","title":"Tight Lower Bounds for st -Connectivity on the NNJAG Model","display_name":"Tight Lower Bounds for st -Connectivity on the NNJAG Model","alternate_titles":[],"publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2014989559","doi":"https://doi.org/10.1137/s0097539795295948","mag":"2014989559"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795295948","doi":"https://doi.org/10.1137/s0097539795295948","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795295948","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"parent_works":[],"lineage":["https://openalex.org/W2014989559"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5110260911","display_name":"Jeff A. Edmonds","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jeff Edmonds","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036513568","display_name":"Chung Keung Poon","orcid":"https://orcid.org/0000-0002-8508-5060","observed_orcids":["https://orcid.org/0000-0002-8508-5060"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Chung Keung Poon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021300666","display_name":"Dimitris Achlioptas","orcid":"https://orcid.org/0000-0003-2349-822X","observed_orcids":["https://orcid.org/0000-0003-2349-822X"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Dimitris Achlioptas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4284,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.523052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":"28","issue":"6","first_page":"2257","last_page":"2284"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0017999999690800905,"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.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.6309999823570251},{"id":"https://openalex.org/keywords/probabilistic-computing","display_name":"probabilistic computing","score":0.7570000290870667},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.35600000619888306},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.5899999737739563},{"id":"https://openalex.org/keywords/tight-lower-bounds","display_name":"tight lower bounds","score":0.5440000295639038},{"id":"https://openalex.org/keywords/boolean-circuits","display_name":"Boolean circuits","score":0.3059999942779541}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7728209495544434},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7022198438644409},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6490939259529114},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6319035887718201},{"id":"https://openalex.org/C2993101906","wikidata":"https://www.wikidata.org/wiki/Q23768","display_name":"Las vegas","level":3,"score":0.5656127333641052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5360506176948547},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4461527466773987},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3572501540184021},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.17579743266105652},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C158739034","wikidata":"https://www.wikidata.org/wiki/Q1907114","display_name":"Metropolitan area","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":5,"locations":[{"id":"doi:10.1137/s0097539795295948","doi":"https://doi.org/10.1137/s0097539795295948","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795295948","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.7147","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.7147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsc.edu/~optas/papers/nnjag.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.5221","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.5221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/~optas/papers/nnjag.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.1529","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.1529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.yorku.ca/~jeff/research/jag/ck_journal.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.8778","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://131.107.65.21/users/optas/papers/stcon.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W120978142","https://openalex.org/W647468898","https://openalex.org/W1506378440","https://openalex.org/W1566033350","https://openalex.org/W1590283810","https://openalex.org/W1956773383","https://openalex.org/W1968906205","https://openalex.org/W1976463987","https://openalex.org/W1982129592","https://openalex.org/W1983670009","https://openalex.org/W2021909922","https://openalex.org/W2023146810","https://openalex.org/W2027188157","https://openalex.org/W2039302045","https://openalex.org/W2043088202","https://openalex.org/W2043360684","https://openalex.org/W2052404100","https://openalex.org/W2056431243","https://openalex.org/W2059442002","https://openalex.org/W2064136209","https://openalex.org/W2076641765","https://openalex.org/W2089892120","https://openalex.org/W2091276604","https://openalex.org/W2133844229","https://openalex.org/W2135567977","https://openalex.org/W2137571436","https://openalex.org/W2139719973","https://openalex.org/W2156184725","https://openalex.org/W2293097972","https://openalex.org/W2596156107","https://openalex.org/W2949147209","https://openalex.org/W4244638572","https://openalex.org/W6910833331"],"related_works":["https://openalex.org/W2076641765","https://openalex.org/W2010962367","https://openalex.org/W2139719973","https://openalex.org/W2137571436","https://openalex.org/W7098243505","https://openalex.org/W1989796026","https://openalex.org/W120978142","https://openalex.org/W1766725538","https://openalex.org/W1995738188","https://openalex.org/W74802906"],"abstract_inverted_index":{"Directed":[0,226],"st-connectivity":[1],"is":[2,243],"the":[3,35,60,65,73,79,174,184,214,255,287,299,312],"problem":[4],"of":[5,39,48,62,127,141,152,178,198,209,234,258,280,293],"deciding":[6],"whether":[7],"or":[8],"not":[9],"there":[10],"exists":[11],"a":[12,15,20,25,30,124,149,278],"path":[13],"from":[14],"distinguished":[16,21],"node":[17,22],"s":[18],"to":[19],"t":[23],"in":[24,64,269],"directed":[26],"graph.":[27],"We":[28,82],"prove":[29],"time--space":[31],"lower":[32,150,176,241,283,291,305],"bound":[33,151,177,242,257,292,306],"on":[34,46,139,183,196,213,228,267,298],"probabilistic":[36],"NNJAG":[37,92,215,300],"model":[38,186,216],"Poon":[40,133],"[":[41,191,219,261],"Proc.":[42,192,262],"34th":[43,193],"Annual":[44,136,194,264],"Symposium":[45,138,195],"Foundations":[47,197],"Computer":[49,199],"Science,":[50,200],"Palo":[51,201],"Alto,":[52,202],"CA,":[53,203],"1993,":[54,204],"pp.":[55,147,205,275],"218--227].":[56],"Let":[57],"n":[58,111,116,158,163,296],"be":[59,72],"number":[61],"nodes":[63],"input":[66],"graph":[67],"and":[68,70,75,132,189,207,225],"S":[69],"T":[71],"space":[74,94,290,304],"time":[76],"used":[77],"by":[78,130,187,217],"NNJAG,":[80],"respectively.":[81],"show":[83],"that,":[84],"for":[85,223,245,249,311],"any":[86,250],"$\\delta":[87,251],">":[88,252],"0$,":[89,253],"if":[90],"an":[91],"uses":[93],"$S":[95,246],"\\in":[96,100,107,154,180,211,247],"O(n^{1-\\delta})$,":[97,248],"then":[98],"$T":[99,106,153],"2^{":[101,108,155],"\\Omega(\\log^2":[102],"(n/S))":[103],"}$;":[104],"otherwise":[105],"\\Omega(":[109,156],"\\log^2({n\\log":[110,157],"\\over":[112,159],"S})":[113,160],"/":[114,120,161],"\\log\\log":[115,162],")}":[117,164],"\\times":[118,165],"(nS":[119],"\\log":[121],"n)^{1/2}$.":[122],"(In":[123],"preliminary":[125],"version":[126],"this":[128,281],"paper":[129],"Edmonds":[131,190,218],"[Proc.":[134],"27th":[135],"ACM":[137],"Theory":[140],"Computing,":[142],"Las":[143],"Vegas,":[144],"NV,":[145],"1995,":[146],"147--156.],":[148],"(nS/\\log":[166],"n)^{1/2}$":[167],"was":[168,307],"proved.)":[169],"Our":[170,240],"result":[171],"greatly":[172],"improves":[173],"previous":[175],"$ST":[179],"\\Omega(n^2/\\log":[181],"n)$":[182],"JAG":[185,229,315],"Barnes":[188,259],"228--237]":[206],"that":[208],"$S^{1/3}T":[210],"\\Omega(n^{4/3})$":[212],"Time-Space":[220],"Lower":[221],"Bounds":[222],"Undirected":[224],"ST-Connectivity":[227],"Models,":[230],"Ph.D.":[231],"thesis,":[232],"University":[233],"Toronto,":[235,236],"ON,":[237],"Canada,":[238],"1993].":[239],"tight":[244,289,303],"matching":[254],"upper":[256],"\\etal":[260],"7th":[263],"IEEE":[265],"Conference":[266],"Structure":[268],"Complexity":[270],"Theory,":[271],"Boston,":[272],"MA,":[273],"1992,":[274],"27--33].":[276],"As":[277],"corollary":[279],"improved":[282],"bound,":[284],"we":[285],"obtain":[286],"first":[288],"$\\Omega(":[294],"\\log^2":[295],")$":[297],"model.":[301,316],"No":[302],"previously":[308],"known":[309],"even":[310],"more":[313],"restricted":[314]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2014989559","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
