{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:58Z","timestamp":1750306918171,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,29]]},"DOI":"10.1145\/2396556.2396572","type":"proceedings-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T15:04:07Z","timestamp":1352819047000},"page":"79-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["M-DFA (multithreaded DFA)"],"prefix":"10.1145","author":[{"given":"Cheng-Hung","family":"Lin","sequence":"first","affiliation":[{"name":"National Taiwan Normal University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyh-Charn","family":"Liu","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"GLOBECOM 2010, 2010 IEEE Global Telecommunications Conference","author":"Lin C.-H.","year":"2010","unstructured":"C.-H. Lin , Accelerating String Matching Using Multi-Threaded Algorithm on GPU,\" in GLOBECOM 2010, 2010 IEEE Global Telecommunications Conference , 2010 , pp. 1 -- 5 . C.-H. Lin, et al., \"Accelerating String Matching Using Multi-Threaded Algorithm on GPU,\" in GLOBECOM 2010, 2010 IEEE Global Telecommunications Conference, 2010, pp. 1--5."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"e_1_3_2_1_4_1","unstructured":"Regexdna benchmark http:\/\/shootout.alioth.debian.org\/u32q\/performance.php?test=regexdna  Regexdna benchmark http:\/\/shootout.alioth.debian.org\/u32q\/performance.php?test=regexdna"},{"key":"e_1_3_2_1_5_1","unstructured":"RE2 http:\/\/code.google.com\/p\/re2\/  RE2 http:\/\/code.google.com\/p\/re2\/"}],"event":{"name":"ANCS '12: Symposium on Architecture for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Austin Texas USA","acronym":"ANCS '12"},"container-title":["Proceedings of the eighth ACM\/IEEE symposium on Architectures for networking and communications systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396556.2396572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396556.2396572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:17Z","timestamp":1750235717000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396556.2396572"}},"subtitle":["an algorithm for reduction of state transitions and acceleration of REGEXP matching"],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":5,"alternative-id":["10.1145\/2396556.2396572","10.1145\/2396556"],"URL":"https:\/\/doi.org\/10.1145\/2396556.2396572","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}