{"id":"https://openalex.org/W3085985421","doi":"https://doi.org/10.1109/hpcs48598.2019.9188181","title":"Parallel Matching of Regular Expressions with BSP Automata","display_name":"Parallel Matching of Regular Expressions with BSP Automata","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W3085985421","doi":"https://doi.org/10.1109/hpcs48598.2019.9188181","mag":"3085985421"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs48598.2019.9188181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","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/A5080257325","display_name":"Thibaut Tachon","orcid":"https://orcid.org/0000-0003-3264-5535"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thibaut Tachon","raw_affiliation_strings":["CSI, Paris Research Lab, Huawei Technologies Boulogne Billancourt, France"],"affiliations":[{"raw_affiliation_string":"CSI, Paris Research Lab, Huawei Technologies Boulogne Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080257325"],"corresponding_institution_ids":["https://openalex.org/I4210123571"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25789199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1995","issue":null,"first_page":"953","last_page":"960"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9919000267982483,"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.9911999702453613,"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/regular-expression","display_name":"Regular expression","score":0.9390596151351929},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7353264093399048},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.7081047296524048},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6241020560264587},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6191724538803101},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5958232879638672},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.555545449256897},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.5090000629425049},{"id":"https://openalex.org/keywords/deep-packet-inspection","display_name":"Deep packet inspection","score":0.4655704200267792},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.45611143112182617},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44472774863243103},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4164021611213684},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36028987169265747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33403295278549194},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.32384562492370605},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.29626280069351196},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18875163793563843},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17511871457099915},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.136252760887146}],"concepts":[{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.9390596151351929},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7353264093399048},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.7081047296524048},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6241020560264587},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6191724538803101},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5958232879638672},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.555545449256897},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.5090000629425049},{"id":"https://openalex.org/C204679922","wikidata":"https://www.wikidata.org/wiki/Q734252","display_name":"Deep packet inspection","level":3,"score":0.4655704200267792},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.45611143112182617},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44472774863243103},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4164021611213684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36028987169265747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33403295278549194},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.32384562492370605},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.29626280069351196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18875163793563843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17511871457099915},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.136252760887146},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs48598.2019.9188181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W4311719","https://openalex.org/W1525776788","https://openalex.org/W1585134931","https://openalex.org/W1989668858","https://openalex.org/W2016690971","https://openalex.org/W2030102079","https://openalex.org/W2059552481","https://openalex.org/W2065666475","https://openalex.org/W2096474000","https://openalex.org/W2110199304","https://openalex.org/W2149375166","https://openalex.org/W2149695592","https://openalex.org/W2546882212","https://openalex.org/W2593054594","https://openalex.org/W2754724260","https://openalex.org/W3098888952","https://openalex.org/W4242309756","https://openalex.org/W6600201770","https://openalex.org/W6728915972"],"related_works":["https://openalex.org/W2137664506","https://openalex.org/W2325454122","https://openalex.org/W2807616588","https://openalex.org/W2377966853","https://openalex.org/W1606491045","https://openalex.org/W2113425091","https://openalex.org/W2052853109","https://openalex.org/W2172018661","https://openalex.org/W2292875219","https://openalex.org/W1966360562"],"abstract_inverted_index":{"Regular":[0],"expression":[1,24,36,55,64],"matching":[2,25,37,81],"is":[3,110],"a":[4,40,51,58,133],"core":[5],"component":[6],"of":[7,17,31,43,82,99,114,118,132],"many":[8],"applications":[9],"including":[10],"patterns":[11],"search":[12],"in":[13],"text,":[14],"deep":[15],"inspection":[16],"packet":[18],"or":[19],"lexical":[20],"analysis.":[21],"Sequential":[22],"regular":[23,35,54,63,83],"lacks":[26],"efficiency":[27],"for":[28,96],"large":[29,41],"amount":[30],"data":[32],"whereas":[33],"parallel":[34,59,75,80],"overhead":[38],"requires":[39],"number":[42,98],"processors":[44],"to":[45,69,74,89,106],"become":[46],"negligible.":[47],"This":[48,66],"paper":[49],"presents":[50],"transformation":[52,67,71,103],"from":[53,72,104],"(RE)":[56],"into":[57],"form":[60],"named":[61],"BSP":[62,119],"(BSPRE).":[65],"added":[68],"the":[70,79,111],"BSPRE":[73,109],"automata":[76],"(BSPA)":[77],"enable":[78],"expression.":[84],"We":[85],"compare":[86],"this":[87],"approach":[88],"enumeration":[90],"method":[91],"and":[92,126],"observe":[93],"substantial":[94],"improvement":[95],"small":[97],"processors.":[100],"The":[101],"automatic":[102],"RE":[105],"BSPA":[107],"through":[108],"first":[112],"example":[113],"an":[115],"infinite":[116],"family":[117],"programs":[120],"that":[121,127],"can":[122],"be":[123],"generated":[124],"automatically":[125],"are":[128],"not":[129],"simple":[130],"specializations":[131],"finite":[134],"library.":[135]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}