{"id":"https://openalex.org/W99327150","doi":"https://doi.org/10.1137/050642381","title":"An $O(\\logn \\log\\logn)$ Space Algorithm for Undirected st-Connectivity","display_name":"An $O(\\logn \\log\\logn)$ Space Algorithm for Undirected st-Connectivity","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W99327150","doi":"https://doi.org/10.1137/050642381","mag":"99327150"},"language":"en","primary_location":{"id":"doi:10.1137/050642381","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050642381","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/A5101464595","display_name":"Vladimir Trifonov","orcid":"https://orcid.org/0000-0001-8374-6024"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vladimir Trifonov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101464595"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.6935,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79571089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"2","first_page":"449","last_page":"483"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9944999814033508,"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/binary-logarithm","display_name":"Binary logarithm","score":0.6221636533737183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.568312406539917},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5517138242721558},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5042902231216431},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4851435124874115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41860640048980713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41016873717308044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4085525870323181},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3240829110145569},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12423104047775269}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6221636533737183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.568312406539917},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5517138242721558},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5042902231216431},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4851435124874115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41860640048980713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41016873717308044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4085525870323181},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3240829110145569},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12423104047775269},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/050642381","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050642381","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"},{"id":"doi:10.1145/1060590.1060684","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"mag:99327150","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc11.html#TR04-114","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.5,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W198890980","https://openalex.org/W1512546754","https://openalex.org/W1974170280","https://openalex.org/W1982129592","https://openalex.org/W1982991092","https://openalex.org/W1995040285","https://openalex.org/W2003037918","https://openalex.org/W2004350101","https://openalex.org/W2007470648","https://openalex.org/W2020810308","https://openalex.org/W2026795019","https://openalex.org/W2039302045","https://openalex.org/W2049800808","https://openalex.org/W2069446854","https://openalex.org/W2086825382","https://openalex.org/W2094900885","https://openalex.org/W2118382442","https://openalex.org/W2123350362","https://openalex.org/W2148369462","https://openalex.org/W2155086352","https://openalex.org/W2156184725","https://openalex.org/W2156372444","https://openalex.org/W2166162093","https://openalex.org/W2611754984","https://openalex.org/W4249333804","https://openalex.org/W6602684015"],"related_works":["https://openalex.org/W2623150993","https://openalex.org/W2522910400","https://openalex.org/W2049800808","https://openalex.org/W2950408827","https://openalex.org/W34840505","https://openalex.org/W2397445739","https://openalex.org/W1045003576","https://openalex.org/W2278993071","https://openalex.org/W3011341561","https://openalex.org/W148106033","https://openalex.org/W2070751425","https://openalex.org/W2950177751","https://openalex.org/W2059598403","https://openalex.org/W2799259092","https://openalex.org/W2501976796","https://openalex.org/W2951171773","https://openalex.org/W2006811735","https://openalex.org/W2950893244","https://openalex.org/W2395231588","https://openalex.org/W3006590675"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,18,96,110],"deterministic":[3,23],"$O(\\log":[4,102],"n":[5],"\\log":[6,7],"n)$":[8,73],"space":[9],"algorithm":[10,25],"for":[11,49],"undirected":[12],"st-connectivity.":[13],"It":[14],"is":[15,95],"based":[16],"on":[17,62,87,130],"space-efficient":[19],"simulation":[20],"of":[21,26,56,75,81,89,105,113,124,132],"the":[22,45,57,71,82,100,115,125],"EREW":[24],"Chong":[27],"and":[28,43,94,108],"Lam":[29],"[J.":[30],"Algorithms,":[31],"18":[32],"(1995),":[33],"pp.":[34,66,92,135],"378\u2013402],":[35],"an":[36],"approach":[37],"suggested":[38],"by":[39,52,120],"Prof.":[40],"Vijaya":[41],"Ramachandran,":[42],"uses":[44],"universal":[46],"exploration":[47],"sequences":[48],"trees":[50],"constructed":[51],"Kouck\u00fd":[53],"in":[54,79,122],"[Proceedings":[55,80,123],"16th":[58],"Annual":[59,84,127],"IEEE":[60],"Conference":[61],"Computational":[63],"Complexity,":[64],"2001,":[65],"21\u201327].":[67],"Our":[68],"result":[69,107],"improves":[70],"$O(\\log^{4/3}":[72],"bound":[74,117],"Armoni":[76],"et":[77],"al.":[78],"20th":[83],"ACM":[85,128],"Symposium":[86,129],"Theory":[88,131],"Computing,":[90,133],"1997,":[91],"230\u2013239]":[93],"big":[97],"step":[98],"towards":[99],"optimal":[101,116],"n)$.":[103],"Independently":[104],"our":[106],"using":[109],"different":[111],"set":[112],"techniques,":[114],"was":[118],"achieved":[119],"Reingold":[121],"37th":[126],"2005,":[134],"376\u2013385].":[136]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}