{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:50:06Z","timestamp":1771699806863,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T00:00:00Z","timestamp":1499731200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Sandia LDRD","award":["13-0144"],"award-info":[{"award-number":["13-0144"]}]},{"name":"UC Lab Fees Research Program Award","award":["12- LR-238449"],"award-info":[{"award-number":["12- LR-238449"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1017399"],"award-info":[{"award-number":["CCF-1017399"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935800","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T11:03:00Z","timestamp":1467975780000},"page":"275-285","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Approaches to the String Matching Problem on the GPU"],"prefix":"10.1145","author":[{"given":"Saman","family":"Ashkiani","sequence":"first","affiliation":[{"name":"University of California Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Amenta","sequence":"additional","affiliation":[{"name":"University of California Davis, Davis`, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Owens","sequence":"additional","affiliation":[{"name":"University of California Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"M. C. Schatz and C. Trapnell \"Fast exact string matching on the GPU \" University of Maryland Tech. Rep. 2007."},{"key":"e_1_3_2_1_2_1","first-page":"1","volume-title":"GLOBECOMM 2011","author":"Lin C.-H.","year":"2011","unstructured":"C.-H. Lin, C.-H. Liu, and S.-C. Chang, \"Accelerating regular expression matching using hierarchical parallel machines on GPU,\" in IEEE Global Telecommunications Conference, ser. GLOBECOMM 2011. IEEE, Dec. 2011, pp. 1--5."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.01.002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431212"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Z. Galil \"Optimal parallel algorithms for string matching \" Information and Control vol. 67 no. 1--3 pp. 144--157 Oct.--Dec. 1985. 10.1016\/S0019-9958(85)80031-0","DOI":"10.1016\/S0019-9958(85)80031-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"U. Vishkin \"Optimal parallel pattern matching in strings \" Information and Control vol. 67 no. 1--3 pp. 91--113 Oct.--Dec. 1985. 10.1016\/S0019-9958(85)80028-0","DOI":"10.1016\/S0019-9958(85)80028-0"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.61"},{"key":"e_1_3_2_1_11_1","first-page":"771","volume-title":"Ed. Addison-Wesley","author":"Seamans E.","year":"2007","unstructured":"E. Seamans and T. Alexander, \"Fast virus signature matching on the GPU,\" in GPU Gems 3, H. Nguyen, Ed. Addison-Wesley, Aug. 2007, ch. 35, pp. 771--783."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCI.2009.47"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365490.1365500"},{"key":"e_1_3_2_1_14_1","unstructured":"G. E. Blelloch \"Prefix sums and their applications \" School of Computer Science Carnegie Mellon University Tech. Rep. Carnegie Mellon University-CS-90--190 Nov. 1990."},{"key":"e_1_3_2_1_15_1","first-page":"359","volume-title":"Thrust: A productivity-oriented library for CUDA,\" in GPU Computing Gems","author":"Bell N.","year":"2011","unstructured":"N. Bell and J. Hoberock, \"Thrust: A productivity-oriented library for CUDA,\" in GPU Computing Gems, W. W. Hwu, Ed. Morgan Kaufmann, Oct. 2011, vol. 2, ch. 26, pp. 359--371."},{"key":"e_1_3_2_1_16_1","unstructured":"NVIDIA Corporation \"NVIDIA CUDA C programming guide \" Sep. 2015 pG-02829-001_v7.5."},{"key":"e_1_3_2_1_17_1","unstructured":"D. Merrill \"CUB \" 2011. {Online}. Available: nvlabs.github.io\/cub\/"},{"key":"e_1_3_2_1_18_1","volume-title":"Smart: a string matching algorithm research tool","author":"Faro S.","year":"2011","unstructured":"S. Faro and T. Lecroq, \"Smart: a string matching algorithm research tool,\" 2011. {Online}. Available: http:\/\/www.dmi.unict.it\/faro\/smart\/"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pacific Grove California USA","acronym":"SPAA '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935800","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:44:14Z","timestamp":1763459054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":18,"alternative-id":["10.1145\/2935764.2935800","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935800","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}