{"id":"https://openalex.org/W1975200441","doi":"https://doi.org/10.1137/s0097539700382704","title":"Tree Pattern Matching to Subset Matching in Linear Time","display_name":"Tree Pattern Matching to Subset Matching in Linear Time","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1975200441","doi":"https://doi.org/10.1137/s0097539700382704","mag":"1975200441"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700382704","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700382704","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/A5042866153","display_name":"Richard Cole","orcid":"https://orcid.org/0000-0002-5885-0222"},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Cole","raw_affiliation_strings":["Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012-1185"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012-1185","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103368959","display_name":"Ramesh Hariharan","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ramesh Hariharan","raw_affiliation_strings":["Indian Institute of Science Bangalore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Science Bangalore","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3934,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.84457062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"32","issue":"4","first_page":"1056","last_page":"1066"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/matching","display_name":"Matching (statistics)","score":0.6731069087982178},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6168440580368042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5879243612289429},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5649160146713257},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5117976069450378},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5049858689308167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4772217869758606},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4580608010292053},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4548545181751251},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.449128121137619},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4101332128047943},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3188009262084961},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.22659236192703247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14271682500839233},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10288360714912415}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6731069087982178},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6168440580368042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5879243612289429},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5649160146713257},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5117976069450378},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5049858689308167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4772217869758606},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4580608010292053},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4548545181751251},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.449128121137619},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4101332128047943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3188009262084961},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.22659236192703247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14271682500839233},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10288360714912415},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539700382704","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700382704","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":"pmh:oai:eprints.iisc.ac.in:308","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.1068","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drona.csa.iisc.ernet.in/~ramesh/psfiles/22.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.8434","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.8434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.iisc.ernet.in/archive/00000308/01/ramesh1.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":11,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1971239730","https://openalex.org/W1996113955","https://openalex.org/W2037140152","https://openalex.org/W2040864705","https://openalex.org/W2101528548","https://openalex.org/W2153517105","https://openalex.org/W2154965336","https://openalex.org/W2421250929","https://openalex.org/W2610179052","https://openalex.org/W2611477341"],"related_works":["https://openalex.org/W2798321768","https://openalex.org/W2579720493","https://openalex.org/W2122048245","https://openalex.org/W2789155430","https://openalex.org/W2949880781","https://openalex.org/W2748369577","https://openalex.org/W2584375818","https://openalex.org/W1888410531","https://openalex.org/W2913628247","https://openalex.org/W2990730306"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"show":[4],"an":[5,42,49],"O(n+m)":[6],"time":[7,45,53],"Turing":[8],"reduction":[9],"from":[10],"the":[11,20,34,58],"tree":[12,59],"pattern":[13,60],"matching":[14,22,36,61],"problem":[15,18],"to":[16],"another":[17],"called":[19],"subset":[21,35],"problem.":[23,37,62],"Subsequent":[24],"works":[25,40],"have":[26],"given":[27],"efficient":[28],"deterministic":[29,46],"and":[30,48],"randomized":[31],"algorithms":[32],"for":[33,57],"Together,":[38],"these":[39],"yield":[41],"O(nlog2m":[43],"+m)":[44],"algorithm":[47,56],"O(n":[50],"log":[51],"n+m)":[52],"Monte":[54],"Carlo":[55]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}