{"id":"https://openalex.org/W2014294283","doi":"https://doi.org/10.1137/s0097539793246252","title":"Adaptive Pattern Matching","display_name":"Adaptive Pattern Matching","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2014294283","doi":"https://doi.org/10.1137/s0097539793246252","mag":"2014294283"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793246252","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793246252","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/A5102886132","display_name":"R. Sekar","orcid":"https://orcid.org/0009-0008-9135-3296"},"institutions":[{"id":"https://openalex.org/I176714629","display_name":"Bell (Canada)","ror":"https://ror.org/00xdg8m59","country_code":"CA","type":"company","lineage":["https://openalex.org/I176714629"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"R. C. Sekar","raw_affiliation_strings":["Bellcore, Rm 2A-274, Morristown,"],"affiliations":[{"raw_affiliation_string":"Bellcore, Rm 2A-274, Morristown,","institution_ids":["https://openalex.org/I176714629"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110326807","display_name":"R. Ramesh","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ramesh","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson,","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005648942","display_name":"I. V. Ramakrishnan","orcid":"https://orcid.org/0000-0002-1768-7043"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. V. Ramakrishnan","raw_affiliation_strings":["Dept of Computer Science, SUNY at Stony Brook, Stony Brook,"],"affiliations":[{"raw_affiliation_string":"Dept of Computer Science, SUNY at Stony Brook, Stony Brook,","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102886132"],"corresponding_institution_ids":["https://openalex.org/I176714629"],"apc_list":null,"apc_paid":null,"fwci":1.5631,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.81295831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":"6","first_page":"1207","last_page":"1234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"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.9987000226974487,"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/tree-traversal","display_name":"Tree traversal","score":0.8864567279815674},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6393497586250305},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6364331841468811},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.595710039138794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5338405966758728},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5037357211112976},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4670385718345642},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4612203538417816},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.46006906032562256},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.4576598107814789},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4450492262840271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44126078486442566},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.43930310010910034},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4261277914047241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3219796419143677},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16203656792640686},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09820470213890076}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8864567279815674},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6393497586250305},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6364331841468811},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.595710039138794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5338405966758728},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5037357211112976},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4670385718345642},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4612203538417816},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.46006906032562256},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.4576598107814789},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4450492262840271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44126078486442566},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.43930310010910034},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4261277914047241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3219796419143677},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16203656792640686},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09820470213890076},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793246252","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793246252","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1480729609","https://openalex.org/W1486494889","https://openalex.org/W1501891810","https://openalex.org/W1527809250","https://openalex.org/W1538230433","https://openalex.org/W1543641760","https://openalex.org/W1572135705","https://openalex.org/W1591539831","https://openalex.org/W1868982956","https://openalex.org/W1973765637","https://openalex.org/W2043687297","https://openalex.org/W2056737359","https://openalex.org/W2421250929","https://openalex.org/W2894866307","https://openalex.org/W3022794709"],"related_works":["https://openalex.org/W1978615272","https://openalex.org/W2952110185","https://openalex.org/W1563348382","https://openalex.org/W2128090891","https://openalex.org/W1976426006","https://openalex.org/W2766273876","https://openalex.org/W2155870982","https://openalex.org/W2513316208","https://openalex.org/W1484161352","https://openalex.org/W2092343804"],"abstract_inverted_index":{"Pattern":[0],"matching":[1,34,80,122,203],"is":[2,50,72,92,154],"an":[3,104,147,164],"important":[4,198],"operation":[5],"used":[6],"in":[7,36,136,189,204,209,221],"many":[8],"applications":[9],"such":[10,89],"as":[11],"functional":[12],"programming,":[13],"rewriting,":[14],"and":[15,79,121],"rule-based":[16],"expert":[17],"systems.":[18],"By":[19,59],"preprocessing":[20],"the":[21,33,41,45,57,61,66,77,84,93,101,126,130,137,140,157,185,210,222],"patterns":[22],"into":[23],"a":[24,37],"deterministic":[25],"finite":[26],"state":[27],"automaton,":[28],"we":[29,194],"can":[30,133,217],"rapidly":[31],"select":[32],"pattern(s)":[35],"single":[38],"scan":[39],"of":[40,44,56,68,83,88,95,103,139,156,174,187,212],"relevant":[42],"portions":[43],"input":[46,69],"term.":[47],"This":[48],"automaton":[49],"typically":[51],"based":[52,170],"on":[53,151,171],"left-to-right":[54],"traversal":[55,62,115,158],"patterns.":[58,141],"adapting":[60],"order":[63,159],"to":[64,74,167],"suit":[65],"set":[67],"patterns,":[70],"it":[71],"possible":[73],"considerably":[75],"reduce":[76],"space":[78,120,131,152,168],"time":[81,123],"requirements":[82,132],"automaton.":[85],"The":[86],"design":[87],"adaptive":[90,105,114],"automata":[91],"focus":[94],"this":[96,144],"paper.":[97],"We":[98,107,142,161],"first":[99],"formalize":[100],"notion":[102],"traversal.":[106],"then":[108,162],"present":[109],"several":[110,197],"strategies":[111],"for":[112],"synthesizing":[113],"orders":[116],"aimed":[117],"at":[118],"reducing":[119],"complexity.":[124],"In":[125,192],"worst":[127],"case,":[128],"however,":[129],"be":[134,218],"exponential":[135,148],"size":[138],"show":[143,195],"by":[145],"establishing":[146],"lower":[149],"bound":[150],"that":[153,196],"independent":[155],"used.":[160],"discuss":[163],"orthogonal":[165],"approach":[166],"minimization":[169],"direct":[172],"construction":[173],"optimal":[175],"directed":[176],"acyclic":[177],"graph":[178],"(dag)":[179],"automata.":[180],"Finally,":[181],"our":[182],"work":[183],"stresses":[184],"impact":[186],"typing":[188],"pattern":[190,202],"matching.":[191],"particular,":[193],"problems":[199],"(e.g.,":[200],"lazy":[201],"ML)":[205],"are":[206],"computationally":[207],"difficult":[208],"presence":[211],"type":[213],"disciplines,":[214],"whereas":[215],"they":[216],"solved":[219],"efficiently":[220],"untyped":[223],"setting.":[224]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}