{"id":"https://openalex.org/W1829276407","doi":"https://doi.org/10.1007/978-3-642-00590-9_13","title":"An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees","display_name":"An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1829276407","doi":"https://doi.org/10.1007/978-3-642-00590-9_13","mag":"1829276407"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-00590-9_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-00590-9_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5100619853","display_name":"Hao Yuan","orcid":"https://orcid.org/0000-0002-9416-2929"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao Yuan","raw_affiliation_strings":["Department of Computer Science, Purdue University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024420075","display_name":"Patrick Eugster","orcid":"https://orcid.org/0000-0003-3864-9078"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrick Eugster","raw_affiliation_strings":["Department of Computer Science, Purdue University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2503,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.57468643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"175","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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/T10142","display_name":"Formal Methods in Verification","score":0.9950000047683716,"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/reachability","display_name":"Reachability","score":0.9297358393669128},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6422826051712036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.623020589351654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48294156789779663},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4527592062950134},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4269612729549408},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4062133729457855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3986912965774536},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39863321185112},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.395877480506897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33622869849205017}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9297358393669128},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6422826051712036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.623020589351654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48294156789779663},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4527592062950134},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4269612729549408},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4062133729457855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3986912965774536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39863321185112},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.395877480506897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33622869849205017},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-00590-9_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-00590-9_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.155.1606","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.1606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/yuan3/dycktree.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.366.1496","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.1496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/peugster/EventJava/Dyck-Trees.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1971782746","https://openalex.org/W1981904441","https://openalex.org/W1990051509","https://openalex.org/W1993449345","https://openalex.org/W2011999472","https://openalex.org/W2024779397","https://openalex.org/W2030166143","https://openalex.org/W2044199853","https://openalex.org/W2047505657","https://openalex.org/W2079752311","https://openalex.org/W2080573945","https://openalex.org/W2093080079","https://openalex.org/W2102750402","https://openalex.org/W2108769896","https://openalex.org/W2110833886","https://openalex.org/W2133497528","https://openalex.org/W2135565307","https://openalex.org/W2137120608","https://openalex.org/W2151033407","https://openalex.org/W2151670874","https://openalex.org/W2171350309","https://openalex.org/W3033694951","https://openalex.org/W3198160809","https://openalex.org/W4243644740"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W4250225510","https://openalex.org/W1979520342","https://openalex.org/W244044452","https://openalex.org/W2141183298","https://openalex.org/W2315923944","https://openalex.org/W2749663619","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}