{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:27:26Z","timestamp":1770283646736,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540437819","type":"print"},{"value":"9783540480358","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48035-8_74","type":"book-chapter","created":{"date-parts":[[2007,11,18]],"date-time":"2007-11-18T02:05:25Z","timestamp":1195351525000},"page":"768-779","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Adaptive Pattern Matching"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"74_CR1","doi-asserted-by":"crossref","unstructured":"A. Augustsson, A Compiler for Lazy ML, Proceedings ACM Conference on Lisp and Functional Programming, ACM, pp. 218\u2013227, 1984.","DOI":"10.1145\/800055.802038"},{"key":"74_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF00881866","volume":"10","author":"J. Christian","year":"1993","unstructured":"J. Christian, Flatterms, Discrimination Nets and Fast Term Rewriting, Journal of Automated Reasoning, vol. 10, pp. 95\u2013113, 1993.","journal-title":"Journal of Automated Reasoning"},{"key":"74_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J. P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, vol. 2, chap. 6, Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"74_CR4","unstructured":"A. J. Field and P. G. Harrison, Functional Programming, International Computer Science Series, 1988."},{"key":"74_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-53904-2_107","volume-title":"Proceedings Conference on Rewriting Techniques and Applications","author":"A. Gr\u00e4f","year":"1991","unstructured":"A. Gr\u00e4f, Left-to-Right Tree Pattern matching, Proceedings Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 488, pp. 323\u2013334, 1991."},{"issue":"l","key":"74_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. M. Hoffman","year":"1982","unstructured":"C. M. Hoffman and M. J. O\u2019Donnell, Pattern matching in Trees, Journal of ACM, 29(l):68\u201395, 1982.","journal-title":"Journal of ACM"},{"key":"74_CR7","doi-asserted-by":"crossref","unstructured":"P. Hudak and al., Report on the Programming Language Haskell: a Non-Strict, Purely Functional Language, Sigplan Notices, Section S, May 1992.","DOI":"10.1145\/130697.130699"},{"key":"74_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0747-7171(08)80109-5","volume":"11","author":"A. Laville","year":"1991","unstructured":"A. Laville, Comparison of Priority Rules in Pattern Matching and Term Rewriting, Journal of Symbolic Computation, 11:321\u2013347, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"74_CR9","unstructured":"N. Nedjah, Pattern matching Automata for Efficient Evaluation in Equational Programming, Ph.D. Thesis, University of Manchester-Institute of Science and Technology, Manchester, UK, (Abstract and Contents in the Bulletin of the European Association of Computer Science, vol. 60, November 1997.)"},{"key":"74_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0027016","volume-title":"Proceedings of the Sixth International Conference on Algebraic and Logic Programming","author":"N. Nedjah","year":"1997","unstructured":"N. Nedjah, C. D. Walter and S. E. Eldridge, Optimal Left-to-Right Pattern matching Automata, Proceedings of the Sixth International Conference on Algebraic and Logic Programming, Southampton, UK, Lecture Notes in Computer Science, M. Hanus, J. Heering and K. Meinke Editors, Springer-Verlag, vol. 1298, pp. 273\u2013285, 1997."},{"issue":"9","key":"74_CR11","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1002\/(SICI)1097-024X(19990725)29:9<793::AID-SPE254>3.0.CO;2-M","volume":"29","author":"N. Nedjah","year":"1999","unstructured":"N. Nedjah, C. D. Walter and S. E. Eldridge, Efficient Automata-Driven Pattern matching for Equational programs, Software-Practice and Experience, 29(9):793\u2013813, John Wiley, 1999.","journal-title":"Software-Practice and Experience"},{"key":"74_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1007\/3-540-45517-5_97","volume-title":"Proc. International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems","author":"N. Nedjah","year":"2001","unstructured":"N. Nedjah and L. M. Mourelle, Improving Time, Space and Termination in Term Rewriting-Based Programming, Proc. International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Budapest, Hungary, Lecture Notes in Computer Science, Springer-Verlag, vol. 2070, pp. 880\u2013890, June 2001."},{"key":"74_CR13","doi-asserted-by":"crossref","unstructured":"M. J. O\u2019Donnell, Equational Logic as Programming Language, MIT Press, 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"issue":"6","key":"74_CR14","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/S0097539793246252","volume":"24","author":"R. C. Sekar","year":"1995","unstructured":"R. C. Sekar, R. Ramesh and I. V. Ramakrishnan, Adaptive Pattern matching, SIAM Journal, 24(6): 1207\u20131234, 1995.","journal-title":"SIAM Journal"}],"container-title":["Lecture Notes in Computer Science","Developments in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48035-8_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T13:47:51Z","timestamp":1556977671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48035-8_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437819","9783540480358"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48035-8_74","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}