{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:50:34Z","timestamp":1760043034112,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_14","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"224-240","source":"Crossref","is-referenced-by-count":5,"title":["Optimally Streaming Greedy Regular Expression Parsing"],"prefix":"10.1007","author":[{"given":"Niels Bj\u00f8rn Bugge","family":"Grathwohl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fritz","family":"Henglein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrik Terp","family":"Rasmussen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and computation\u00a0140(2), 229\u2013253 (1998), http:\/\/dx.doi.org\/10.1006\/inco.1997.2688","journal-title":"Information and computation"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-642-39274-0_26","volume-title":"CIAA 2013","author":"D. Debarbieux","year":"2013","unstructured":"Debarbieux, D., Gauwin, O., Niehren, J., Sebastian, T., Zergaoui, M.: Early nested word automata for XPath query answering on XML streams. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 292\u2013305. Springer, Heidelberg (2013)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s002360000037","volume":"37","author":"D. Dub\u00e9","year":"2000","unstructured":"Dub\u00e9, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Informatica\u00a037(2), 121\u2013144 (2000), http:\/\/dx.doi.org\/10.1007\/s002360000037","journal-title":"Acta Informatica"},{"key":"14_CR4","unstructured":"Fowler, G.: An interpretation of the POSIX regex standard (January 2003), http:\/\/www2.research.att.com\/~astopen\/testregex\/re-interpretation.html"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-27836-8_53","volume-title":"Automata, Languages and Programming","author":"A. Frisch","year":"2004","unstructured":"Frisch, A., Cardelli, L.: Greedy regular expression matching. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 618\u2013629. Springer, Heidelberg (2004), http:\/\/dx.doi.org\/10.1007\/978-3-540-27836-8_53"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-642-39274-0_7","volume-title":"CIAA 2013","author":"N.B.B. Grathwohl","year":"2013","unstructured":"Grathwohl, N.B.B., Henglein, F., Nielsen, L., Rasmussen, U.T.: Two-pass greedy regular expression parsing. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 60\u201371. Springer, Heidelberg (2013), http:\/\/dx.doi.org\/10.1007\/978-3-642-39274-0_7"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/872757.872809","volume-title":"Proc. 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003","author":"A.K. Gupta","year":"2003","unstructured":"Gupta, A.K., Suciu, D.: Stream processing of XPath queries with predicates. In: Proc. 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 419\u2013430. ACM, New York (2003), http:\/\/dx.doi.org\/10.1145\/872757.872809"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"IEEE Computer Society: Standard for Information Technology - Portable Operating System Interface (POSIX), Base Specifications, Issue 7. IEEE (2008), http:\/\/dx.doi.org\/10.1109\/IEEESTD.2008.4694976 , IEEE Std 1003.1","DOI":"10.1109\/IEEESTD.2008.4694976"},{"issue":"8","key":"14_CR9","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1002\/spe.4380210803","volume":"21","author":"S. Kearns","year":"1991","unstructured":"Kearns, S.: Extending regular expressions with context operators and parse extraction. Software - Practice and Experience\u00a021(8), 787\u2013804 (1991), http:\/\/dx.doi.org\/10.1002\/spe.4380210803","journal-title":"Software - Practice and Experience"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-21254-3_32","volume-title":"Language and Automata Theory and Applications","author":"L. Nielsen","year":"2011","unstructured":"Nielsen, L., Henglein, F.: Bit-coded regular expression parsing. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 402\u2013413. Springer, Heidelberg (2011), http:\/\/dx.doi.org\/10.1007\/978-3-642-21254-3_32"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-18098-9_25","volume-title":"Implementation and Application of Automata","author":"S. Okui","year":"2011","unstructured":"Okui, S., Suzuki, T.: Disambiguation in regular expression matching via position automata with augmented transitions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 231\u2013240. Springer, Heidelberg (2011), http:\/\/dx.doi.org\/10.1007\/978-3-642-18098-9_25"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proc. Fifth Annual ACM Symposium on Theory of Computing, pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"key":"14_CR13","first-page":"79","volume-title":"Proc. 14th Symposium on Principles and Practice of Declarative Programming, PPDP 2012","author":"M. Sulzmann","year":"2012","unstructured":"Sulzmann, M., Lu, K.Z.M.: Regular expression sub-matching using partial derivatives. In: Proc. 14th Symposium on Principles and Practice of Declarative Programming, PPDP 2012, pp. 79\u201390. ACM, New York (2012), http:\/\/dx.doi.org\/10.1145\/2370776.2370788"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-07151-0_13","volume-title":"Functional and Logic Programming","author":"M. Sulzmann","year":"2014","unstructured":"Sulzmann, M., Lu, K.Z.M.: POSIX regular expression parsing with derivatives. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol.\u00a08475, pp. 203\u2013220. Springer, Heidelberg (2014), http:\/\/dx.doi.org\/10.1007\/978-3-319-07151-0_13"},{"issue":"6","key":"14_CR15","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. Commun. ACM\u00a011(6), 419\u2013422 (1968), http:\/\/dx.doi.org\/10.1145\/363347.363387","journal-title":"Commun. ACM"},{"key":"14_CR16","unstructured":"Wall, L., Christiansen, T., Orwant, J.: Programming Perl. O\u2019Reilly Media, Incorporated (2000)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00778-012-0281-y","volume":"22","author":"X. Wu","year":"2013","unstructured":"Wu, X., Theodoratos, D.: A survey on XML streaming evaluation techniques. The VLDB Journal\u00a022(2), 177\u2013202 (2013), http:\/\/dx.doi.org\/10.1007\/s00778-012-0281-y","journal-title":"The VLDB Journal"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T11:37:43Z","timestamp":1717328263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}