{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:31Z","timestamp":1725577411006},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_30","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"282-289","source":"Crossref","is-referenced-by-count":3,"title":["Compressing Regular Expressions\u2019 DFA Table by Matrix Decomposition"],"prefix":"10.1007","author":[{"given":"Yanbing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianlong","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Programming Techniques: Regular expression search algorithm. Communications of the ACM\u00a011(6), 419\u2013422 (1968)","journal-title":"Communications of the ACM"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1145\/128749.128755","volume":"39","author":"E.W. Myers","year":"1992","unstructured":"Myers, E.W.: A four Russians algorithm for regular expression pattern matching. Journal of the ACM\u00a039(2), 430\u2013448 (1992)","journal-title":"Journal of the ACM"},{"issue":"6","key":"30_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1145\/235809.235810","volume":"43","author":"R.A. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: Fast text searching for regular expressions or automaton searching on tries. Journal of the ACM\u00a043(6), 915\u2013936 (1996)","journal-title":"Journal of the ACM"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44688-5_1","volume-title":"Algorithm Engineering","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Raffinot, M.: Compact DFA representation for fast regular expression search. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 1\u201312. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. In: Proceedings of the 5th Annual International Conference on Computational Molecular Biology, pp. 231\u2013240 (2001)","key":"30_CR5","DOI":"10.1145\/369133.369220"},{"doi-asserted-by":"crossref","unstructured":"Champarnaud, J.-M., Coulon, F., Paranthoen, T.: Compact and Fast Algorithms for Regular Expression Search. Intern. J. of Computer. Math.\u00a081(4) (2004)","key":"30_CR6","DOI":"10.1080\/00207160310001650025"},{"doi-asserted-by":"crossref","unstructured":"Yu, F., Chen, Z., Diao, Y.: Fast and memory-efficient regular expression matching for deep packet inspection. In: Proceedings of the 2006 ACM\/IEEE symposium on Architecture for Networking and Communications Systems, pp. 93\u2013102 (2006)","key":"30_CR7","DOI":"10.1145\/1185347.1185360"},{"issue":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/1151659.1159952","volume":"36","author":"S. Kumar","year":"2006","unstructured":"Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., Turner, J.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. ACM SIGCOMM Computer Communication Review\u00a036(4), 339\u2013350 (2006)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"doi-asserted-by":"crossref","unstructured":"Becchi, M., Crowley, P.: An improved algorithm to accelerate regular expression evaluation. In: Proceedings of the 3rd ACM\/IEEE Symposium on Architecture for Networking and Communications Systems, pp. 145\u2013154 (2007)","key":"30_CR9","DOI":"10.1145\/1323548.1323573"},{"issue":"5","key":"30_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1452335.1452339","volume":"38","author":"D. Ficara","year":"2008","unstructured":"Ficara, D., Giordano, S., Procissi, G., Vitucci, F., Antichi, G., Pietro, A.D.: An improved DFA for fast regular expression matching. ACM SIGCOMM Computer Communication Review\u00a038(5), 29\u201340 (2008)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"doi-asserted-by":"crossref","unstructured":"Smith, R., Estan, C., Jha, S.: XFA: Faster signature matching with extended automata. In: IEEE Symposium on Security and Privacy, Oakland, pp. 187\u2013201 (May 2008)","key":"30_CR11","DOI":"10.1109\/SP.2008.14"},{"doi-asserted-by":"crossref","unstructured":"Kumar, S., Chandrasekaran, B., Turner, J., Varghese, G.: Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In: Proceedings of the 3rd ACM\/IEEE Symposium on Architecture for Networking and Communications Systems, pp. 155\u2013164 (2007)","key":"30_CR12","DOI":"10.1145\/1323548.1323574"},{"doi-asserted-by":"crossref","unstructured":"Becchi, M., Cadambi, S.: Memory-efficient regular expression search using state merging. In: 26th IEEE International Conference on Computer Communications, pp. 1064\u20131072 (2007)","key":"30_CR13","DOI":"10.1109\/INFCOM.2007.128"},{"doi-asserted-by":"crossref","unstructured":"Majumder, A., Rastogi, R., Vanama, S.: Scalable regular expression matching on data streams. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, Canada, pp. 161\u2013172 (2008)","key":"30_CR14","DOI":"10.1145\/1376616.1376635"},{"issue":"7","key":"30_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Spacetime Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"unstructured":"http:\/\/l7-filter.sourceforge.net\/","key":"30_CR16"},{"unstructured":"http:\/\/www.snort.org\/","key":"30_CR17"},{"unstructured":"http:\/\/www.bro-ids.org\/","key":"30_CR18"},{"unstructured":"http:\/\/regex.wustl.edu\/","key":"30_CR19"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:33:45Z","timestamp":1558424025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}