{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:42:17Z","timestamp":1725734537107},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5062245","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T15:10:14Z","timestamp":1244041814000},"page":"2851-2855","source":"Crossref","is-referenced-by-count":3,"title":["Faster DFAs through Simple and Efficient Inverse Homomorphisms"],"prefix":"10.1109","author":[{"given":"D.","family":"Ficara","sequence":"first","affiliation":[{"name":"Dept. of Inf. Eng., Univ. of Pisa, Pisa"}]},{"given":"S.","family":"Giordano","sequence":"additional","affiliation":[{"name":"Dept. of Inf. Eng., Univ. of Pisa, Pisa"}]},{"given":"G.","family":"Procissi","sequence":"additional","affiliation":[{"name":"Dept. of Inf. Eng., Univ. of Pisa, Pisa"}]},{"given":"F.","family":"Vitucci","sequence":"additional","affiliation":[{"name":"Dept. of Inf. Eng., Univ. of Pisa, Pisa"}]},{"given":"G.","family":"Antichi","sequence":"additional","affiliation":[{"name":"Dept. of Inf. Eng., Univ. of Pisa, Pisa"}]},{"given":"A.","family":"Di Pietro","sequence":"additional","affiliation":[{"name":"Dept. of Inf. Eng., Univ. of Pisa, Pisa"}]}],"member":"263","reference":[{"key":"3","article-title":"algorithms to accelerate multiple regular expressions matching for deep packet inspection","author":"kumar","year":"0","journal-title":"SIGCOMM '06"},{"year":"1990","author":"hopcroft","journal-title":"Introduction to Automata Theory Languages and Computation","key":"2"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1145\/1402958.1402983"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1145\/948109.948145"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1145\/1185347.1185359"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1145\/1364654.1364656"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1145\/1452335.1452339"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1145\/1323548.1323573"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1145\/1323548.1323574"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/INFCOM.2007.128"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/ISCA.2006.7"},{"year":"0","journal-title":"Michela Becchi regex tool","key":"12"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","start":{"date-parts":[[2009,4,19]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05062245.pdf?arnumber=5062245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T18:22:28Z","timestamp":1677781348000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5062245\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5062245","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}