{"id":"https://openalex.org/W2119423764","doi":"https://doi.org/10.1145/1323548.1323573","title":"An improved algorithm to accelerate regular expression evaluation","display_name":"An improved algorithm to accelerate regular expression evaluation","publication_year":2007,"publication_date":"2007-12-03","ids":{"openalex":"https://openalex.org/W2119423764","doi":"https://doi.org/10.1145/1323548.1323573","mag":"2119423764"},"language":"en","primary_location":{"id":"doi:10.1145/1323548.1323573","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1323548.1323573","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems","raw_type":"proceedings-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/A5041520129","display_name":"Michela Becchi","orcid":"https://orcid.org/0000-0001-8353-2915"},"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":true,"raw_author_name":"Michela Becchi","raw_affiliation_strings":["Washington University, St. Louis, MO","Washington University, St. Louis, Mo"],"affiliations":[{"raw_affiliation_string":"Washington University, St. Louis, MO","institution_ids":["https://openalex.org/I204465549"]},{"raw_affiliation_string":"Washington University, St. Louis, Mo","institution_ids":["https://openalex.org/I204465549"]}]},{"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, St. Louis, MO","Washington University, St. Louis, Mo"],"affiliations":[{"raw_affiliation_string":"Washington University, St. Louis, MO","institution_ids":["https://openalex.org/I204465549"]},{"raw_affiliation_string":"Washington University, St. Louis, Mo","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/I204465549"],"apc_list":null,"apc_paid":null,"fwci":17.1861,"has_fulltext":false,"cited_by_count":212,"citation_normalized_percentile":{"value":0.99445029,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"154"},"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.9983000159263611,"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.9980000257492065,"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.8345993161201477},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7952796220779419},{"id":"https://openalex.org/keywords/deep-packet-inspection","display_name":"Deep packet inspection","score":0.6634347438812256},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6563634276390076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6247280240058899},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5943496227264404},{"id":"https://openalex.org/keywords/intrusion-detection-system","display_name":"Intrusion detection system","score":0.5932153463363647},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5757830142974854},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5688679814338684},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5373749732971191},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4854510426521301},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.418901652097702},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3566094636917114},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1610468626022339},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09582462906837463},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08989444375038147}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8345993161201477},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7952796220779419},{"id":"https://openalex.org/C204679922","wikidata":"https://www.wikidata.org/wiki/Q734252","display_name":"Deep packet inspection","level":3,"score":0.6634347438812256},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6563634276390076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6247280240058899},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5943496227264404},{"id":"https://openalex.org/C35525427","wikidata":"https://www.wikidata.org/wiki/Q745881","display_name":"Intrusion detection system","level":2,"score":0.5932153463363647},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5757830142974854},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5688679814338684},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5373749732971191},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4854510426521301},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.418901652097702},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3566094636917114},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1610468626022339},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09582462906837463},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08989444375038147},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1323548.1323573","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1323548.1323573","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.131.1967","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.1967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.arl.wustl.edu/~pcrowley/p145-becchi.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.7762","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.wustl.edu/ANCS/papers/p145.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W570611244","https://openalex.org/W1513400187","https://openalex.org/W1655192411","https://openalex.org/W1674877186","https://openalex.org/W1707172707","https://openalex.org/W1965680834","https://openalex.org/W2002089154","https://openalex.org/W2006508099","https://openalex.org/W2017927472","https://openalex.org/W2030102079","https://openalex.org/W2041855183","https://openalex.org/W2096474000","https://openalex.org/W2099964107","https://openalex.org/W2134684274","https://openalex.org/W2139418336","https://openalex.org/W2149375166","https://openalex.org/W4242309756","https://openalex.org/W4246185962"],"related_works":["https://openalex.org/W1999162684","https://openalex.org/W2146605784","https://openalex.org/W2159281873","https://openalex.org/W2113425091","https://openalex.org/W2015535429","https://openalex.org/W2022407883","https://openalex.org/W1969792688","https://openalex.org/W4242309756","https://openalex.org/W2051822997","https://openalex.org/W2137664506"],"abstract_inverted_index":{"Modern":[0],"network":[1],"intrusion":[2],"detection":[3],"systems":[4],"need":[5],"to":[6,16,34,81,86],"perform":[7],"regular":[8,88],"expression":[9],"matching":[10],"at":[11],"line":[12],"rate":[13],"in":[14,23,37],"order":[15],"detect":[17],"the":[18,61,65,69,82],"occurrence":[19],"of":[20,64,71],"critical":[21],"patterns":[22],"packet":[24],"payloads.":[25],"While":[26],"deterministic":[27],"finite":[28],"automata":[29],"(DFAs)":[30],"allow":[31],"this":[32],"operation":[33],"be":[35],"performed":[36],"linear":[38],"time,":[39],"they":[40],"may":[41],"exhibit":[42],"prohibitive":[43],"memory":[44,62,83],"requirements.":[45],"In":[46],"[9],":[47],"Kumar":[48],"et":[49],"al.":[50],"propose":[51],"Delayed":[52],"Input":[53],"DFAs":[54],"(D2FAs),":[55],"which":[56,78],"provide":[57],"a":[58],"trade-off":[59],"between":[60],"requirements":[63],"compressed":[66],"DFA":[67],"and":[68],"number":[70],"states":[72],"visited":[73],"for":[74],"each":[75],"character":[76],"processed,":[77],"corresponds":[79],"directly":[80],"bandwidth":[84],"required":[85],"evaluate":[87],"expressions.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":23}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}