{"id":"https://openalex.org/W2139719973","doi":"https://doi.org/10.1109/sfcs.1993.366865","title":"Space bounds for graph connectivity problems on node-named JAGs and node-ordered JAGs","display_name":"Space bounds for graph connectivity problems on node-named JAGs and node-ordered JAGs","alternate_titles":[],"publication_year":2002,"publication_date":"2002-12-30","ids":{"openalex":"https://openalex.org/W2139719973","doi":"https://doi.org/10.1109/sfcs.1993.366865","mag":"2139719973"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1993.366865","doi":"https://doi.org/10.1109/sfcs.1993.366865","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1993.366865","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2139719973"],"child_works_count":0,"type":"conference-paper","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/A5036513568","display_name":"Chung Keung Poon","orcid":"https://orcid.org/0000-0002-8508-5060","observed_orcids":["https://orcid.org/0000-0002-8508-5060"]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"C.K. Poon","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, ONT, Canada","Dept. of Comput. Sci., Toronto Univ., Ont., Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Toronto Univ., Ont., Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036513568"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.9144,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.69529965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"218","last_page":"227"},"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.8471999764442444,"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.8471999764442444,"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.03620000183582306,"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/T11567","display_name":"semigroups and automata theory","score":0.03620000183582306,"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/space-lower-bounds","display_name":"space lower bounds","score":0.6859999895095825},{"id":"https://openalex.org/keywords/graph-connectivity","display_name":"graph connectivity","score":0.6959999799728394},{"id":"https://openalex.org/keywords/nondeterministic-computation","display_name":"nondeterministic computation","score":0.7749999761581421},{"id":"https://openalex.org/keywords/probabilistic-computing","display_name":"probabilistic computing","score":0.9580000042915344},{"id":"https://openalex.org/keywords/nondeterministic-turing-machines","display_name":"nondeterministic Turing machines","score":0.7080000042915344},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.4569999873638153}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7615057229995728},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6792362332344055},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5531743764877319},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.551239013671875},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5397480726242065},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4976945221424103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47308069467544556},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.47146278619766235},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43290746212005615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39287036657333374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38564395904541016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2797095477581024},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14039966464042664},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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.1109/sfcs.1993.366865","doi":"https://doi.org/10.1109/sfcs.1993.366865","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1993.366865","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1590283810","https://openalex.org/W1956773383","https://openalex.org/W1982129592","https://openalex.org/W1983670009","https://openalex.org/W2021909922","https://openalex.org/W2027188157","https://openalex.org/W2043360684","https://openalex.org/W2059657394","https://openalex.org/W2137571436","https://openalex.org/W2141158615"],"related_works":["https://openalex.org/W2010962367","https://openalex.org/W2014989559","https://openalex.org/W120978142","https://openalex.org/W2137571436","https://openalex.org/W7098243505","https://openalex.org/W1766725538","https://openalex.org/W2076641765","https://openalex.org/W1995738188","https://openalex.org/W1989796026","https://openalex.org/W74802906"],"abstract_inverted_index":{"Two":[0],"new":[1],"models,":[2],"NO-JAG":[3,71],"and":[4,44],"NN-JAG":[5,43],"in":[6],"order":[7],"of":[8,25,37,49,57],"increasing":[9],"computation":[10],"power,":[11],"are":[12],"introduced":[13],"as":[14,74,76],"extensions":[15],"to":[16],"the":[17,35,55],"conventional":[18],"JAG":[19],"model.":[20],"A":[21],"space":[22,46],"lower":[23],"bound":[24,48],"/spl":[26],"Omega/(log/sup":[27],"2/":[28],"n/log":[29],"log":[30],"n)":[31,51],"is":[32,52,65,72],"proved":[33,53],"for":[34,54],"problem":[36,56],"directed":[38,58],"st-connectivity":[39],"on":[40,60],"a":[41,45,61,69,77],"probabilistic":[42],"upper":[47],"O(log":[50],"st-nonconnectivity":[59],"nondeterministic":[62,70,78],"NO-JAG.":[63],"It":[64],"also":[66],"shown":[67],"that":[68],"nearly":[73],"powerful":[75],"Turing":[79],"machine.>":[80]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2139719973","counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
