{"id":"https://openalex.org/W2115345034","doi":"https://doi.org/10.1145/2445572.2445576","title":"A-DFA","display_name":"A-DFA","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2115345034","doi":"https://doi.org/10.1145/2445572.2445576","mag":"2115345034"},"language":"en","primary_location":{"id":"doi:10.1145/2445572.2445576","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2445572.2445576","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2445572.2445576","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2445572.2445576","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041520129","display_name":"Michela Becchi","orcid":"https://orcid.org/0000-0001-8353-2915"},"institutions":[{"id":"https://openalex.org/I76835614","display_name":"University of Missouri","ror":"https://ror.org/02ymw8z06","country_code":"US","type":"education","lineage":["https://openalex.org/I76835614"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michela Becchi","raw_affiliation_strings":["University of Missouri","University of Missouri ***"],"affiliations":[{"raw_affiliation_string":"University of Missouri","institution_ids":["https://openalex.org/I76835614"]},{"raw_affiliation_string":"University of Missouri ***","institution_ids":["https://openalex.org/I76835614"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081087040","display_name":"Patrick Crowley","orcid":"https://orcid.org/0000-0003-4222-5091"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Patrick Crowley","raw_affiliation_strings":["Washington University in St. Louis","(, Washington University in St. Louis)"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis","institution_ids":["https://openalex.org/I204465549"]},{"raw_affiliation_string":"(, Washington University in St. Louis)","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041520129"],"corresponding_institution_ids":["https://openalex.org/I76835614"],"apc_list":null,"apc_paid":null,"fwci":7.5651,"has_fulltext":true,"cited_by_count":64,"citation_normalized_percentile":{"value":0.97500223,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"10","issue":"1","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"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"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.875007152557373},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.6080970764160156},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5730569362640381},{"id":"https://openalex.org/keywords/memory-bandwidth","display_name":"Memory bandwidth","score":0.5400965213775635},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5326216816902161},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.516484260559082},{"id":"https://openalex.org/keywords/high-memory","display_name":"High memory","score":0.45739659667015076},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.42259982228279114},{"id":"https://openalex.org/keywords/deep-packet-inspection","display_name":"Deep packet inspection","score":0.41931378841400146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3696305751800537},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.3680165708065033},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.26316922903060913},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09897813200950623}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.875007152557373},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.6080970764160156},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5730569362640381},{"id":"https://openalex.org/C188045654","wikidata":"https://www.wikidata.org/wiki/Q17148339","display_name":"Memory bandwidth","level":2,"score":0.5400965213775635},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5326216816902161},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.516484260559082},{"id":"https://openalex.org/C2781357197","wikidata":"https://www.wikidata.org/wiki/Q5757597","display_name":"High memory","level":2,"score":0.45739659667015076},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.42259982228279114},{"id":"https://openalex.org/C204679922","wikidata":"https://www.wikidata.org/wiki/Q734252","display_name":"Deep packet inspection","level":3,"score":0.41931378841400146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3696305751800537},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.3680165708065033},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.26316922903060913},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09897813200950623},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2445572.2445576","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2445572.2445576","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2445572.2445576","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/2445572.2445576","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2445572.2445576","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2445572.2445576","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2115345034.pdf","grobid_xml":"https://content.openalex.org/works/W2115345034.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W570611244","https://openalex.org/W1513400187","https://openalex.org/W1516506771","https://openalex.org/W1655192411","https://openalex.org/W1674877186","https://openalex.org/W1707172707","https://openalex.org/W1965680834","https://openalex.org/W1977610499","https://openalex.org/W2006508099","https://openalex.org/W2015535429","https://openalex.org/W2030102079","https://openalex.org/W2038810743","https://openalex.org/W2041855183","https://openalex.org/W2076238443","https://openalex.org/W2096474000","https://openalex.org/W2099964107","https://openalex.org/W2106062486","https://openalex.org/W2111990320","https://openalex.org/W2113422425","https://openalex.org/W2113425091","https://openalex.org/W2119423764","https://openalex.org/W2122820686","https://openalex.org/W2139418336","https://openalex.org/W2149225459","https://openalex.org/W2149695592","https://openalex.org/W2153244370","https://openalex.org/W2162071647","https://openalex.org/W2167971042","https://openalex.org/W3144157896","https://openalex.org/W4240018668","https://openalex.org/W4242309756","https://openalex.org/W4246185962","https://openalex.org/W4247093768"],"related_works":["https://openalex.org/W2113425091","https://openalex.org/W1999162684","https://openalex.org/W2015535429","https://openalex.org/W1969792688","https://openalex.org/W2900276985","https://openalex.org/W2146605784","https://openalex.org/W2159281873","https://openalex.org/W2115104852","https://openalex.org/W1974804712","https://openalex.org/W2304320477"],"abstract_inverted_index":{"Modern":[0],"network":[1],"intrusion":[2],"detection":[3],"systems":[4],"need":[5],"to":[6,16,34,86,138,187,197],"perform":[7],"regular":[8,88],"expression":[9],"matching":[10],"at":[11,113,209],"line":[12],"rate":[13],"in":[14,23,37,79,112],"order":[15],"detect":[17],"the":[18,61,65,69,82,139,165,211],"occurrence":[19],"of":[20,64,71,127,147,217],"critical":[21],"patterns":[22],"packet":[24],"payloads.":[25],"While":[26],"Deterministic":[27],"Finite":[28],"Automata":[29],"(DFAs)":[30],"allow":[31],"this":[32,91],"operation":[33],"be":[35,172,188],"performed":[36],"linear":[38],"time,":[39],"they":[40],"may":[41],"exhibit":[42],"prohibitive":[43],"memory":[44,62,83,154,212,221],"requirements.":[45],"Kumar":[46],"et":[47],"al.":[48],"[2006a]":[49],"have":[50],"proposed":[51],"Delayed":[52],"Input":[53],"DFAs":[54,100,104],"(D2FAs),":[55],"which":[56,78],"provide":[57],"a":[58,106,125,133,160,183],"trade-off":[59],"between":[60],"requirements":[63],"compressed":[66,184],"DFA":[67,175,185],"and":[68,177,203,214,219],"number":[70],"states":[72],"visited":[73],"for":[74,159,180,225],"each":[75],"character":[76],"processed,":[77],"turn":[80],"affects":[81],"bandwidth":[84,98,155,162,215],"required":[85],"evaluate":[87],"expressions.":[89],"In":[90,136],"article":[92],"we":[93,194],"introduce":[94],"Amortized":[95],"time":[96],"\u2212":[97,103],"overhead":[99],"(":[101,116],"A":[102],"),":[105],"general":[107],"compression":[108,148,158],"technique":[109,143],"that":[110],"results":[111],"most":[114],"N":[115,129],"k":[117,120,131],"+":[118],"1)/":[119],"state":[121],"traversals":[122],"when":[123],"processing":[124],"string":[126],"length":[128],",":[130],"being":[132],"positive":[134],"integer.":[135],"comparison":[137],"D2FA":[140],"approach,":[141],"our":[142],"achieves":[144],"comparable":[145],"levels":[146],"with":[149,200],"lower":[150,169],"provable":[151],"bounds":[152],"on":[153],"(or":[156],"greater":[157],"given":[161],"bound).":[163],"Moreover,":[164],"A-DFA":[166,199],"algorithm":[167],"has":[168],"complexity,":[170],"can":[171],"applied":[173],"during":[174],"creation,":[176],"is":[178],"suitable":[179,224],"scenarios":[181],"where":[182],"needs":[186],"dynamically":[189],"built":[190],"or":[191],"updated.":[192],"Finally,":[193],"show":[195],"how":[196],"combine":[198],"alphabet":[201],"reduction":[202],"multistride":[204],"DFAs,":[205,218],"two":[206],"techniques":[207],"aimed":[208],"reducing":[210],"space":[213],"requirement":[216],"discuss":[220],"encoding":[222],"schemes":[223],"A-DFAs.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}