{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:05:05Z","timestamp":1725541505179},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106712"},{"type":"electronic","value":"9783642106729"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10672-9_7","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T04:08:11Z","timestamp":1259726891000},"page":"63-78","source":"Crossref","is-referenced-by-count":1,"title":["A Short Cut to Optimal Sequences"],"prefix":"10.1007","author":[{"given":"Akimasa","family":"Morihata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/165180.165214","volume-title":"FPCA 1993 Conference on Functional Programming Languages and Computer Architecture","author":"A. Gill","year":"1993","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.: A short cut to deforestation. In: FPCA 1993 Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232. ACM, New York (1993)"},{"key":"7_CR3","unstructured":"Gill, A.: Cheap deforestation for non-strict functional languages. PhD thesis, Department of Computing Science, Glasgow University (1996)"},{"key":"7_CR4","unstructured":"Peyton Jones, S., Tolmach, A., Hoare, T.: Playing by the rules: rewriting as a practical optimisation technique in GHC. In: Proceedings of 2001 ACM SIGPLAN Haskell Workshop. Technical Report UU-CS-2001-23, Institute of Information and Computing Sciences, Utrecht University, pp. 203\u2013233 (2001)"},{"key":"7_CR5","unstructured":"Morihata, A.: Solving maximum weighted-sum problems for free. Technical Report METR 2009-20, Department of Mathematical Informatics, University of Tokyo (2009)"},{"volume-title":"Haskell 98 language and libraries: the revised report","year":"2003","key":"7_CR6","unstructured":"Peyton Jones, S. (ed.): Haskell 98 language and libraries: the revised report. Cambridge University Press, Cambridge (2003)"},{"key":"7_CR7","first-page":"306","volume-title":"Conference Record of FPCA 1995 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture","author":"A. Takano","year":"1995","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Conference Record of FPCA 1995 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture, pp. 306\u2013313. ACM, New York (1995)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45127-7_13","volume-title":"Rewriting Techniques and Applications","author":"A. K\u00fchnemann","year":"2001","unstructured":"K\u00fchnemann, A., Gl\u00fcck, R., Kakehi, K.: Relating accumulative and non-accumulative functional programs. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 154\u2013168. Springer, Heidelberg (2001)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/581478.581481","volume-title":"Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002)","author":"J. Voigtl\u00e4nder","year":"2002","unstructured":"Voigtl\u00e4nder, J.: Concatenate, reverse and map vanish for free. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002), pp. 14\u201325. ACM, New York (2002)"},{"key":"7_CR10","first-page":"314","volume-title":"Conference Record of FPCA 1995 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture","author":"J. Launchbury","year":"1995","unstructured":"Launchbury, J., Sheard, T.: Warm fusion: Deriving build-catas from recursive definitions. In: Conference Record of FPCA 1995 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture, pp. 314\u2013323. ACM, New York (1995)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/317636.317907","volume-title":"Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, ICFP 1999","author":"O. Chitil","year":"1999","unstructured":"Chitil, O.: Type inference builds a short cut to deforestation. In: Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, ICFP 1999, pp. 249\u2013260. ACM, New York (1999)"},{"key":"7_CR12","unstructured":"Yokoyama, T., Hu, Z., Takeichi, M.: Calculation rules for warming-up in fusion transformation. In: The 2005 Symposium on Trends in Functional Programming, TFP 2005, pp. 399\u2013412 (2005)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0167-6423(92)90033-8","volume":"18","author":"H. Zantema","year":"1992","unstructured":"Zantema, H.: Longest Segment Problems. Sci. Comput. Program.\u00a018(1), 39\u201366 (1992)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/2166.2167","volume":"5","author":"H.N. Cohen","year":"1983","unstructured":"Cohen, H.N.: Eliminating redundant recursive calls. ACM Trans. Program. Lang. Syst.\u00a05(3), 265\u2013299 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/604131.604133","volume-title":"Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"U.A. Acar","year":"2003","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R.: Selective memoization. In: Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 14\u201325. ACM, New York (2003)"},{"issue":"1-2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1023068020483","volume":"16","author":"Y.A. Liu","year":"2003","unstructured":"Liu, Y.A., Stoller, S.D.: Dynamic programming via static incrementalization. Higher-Order and Symbolic Computation\u00a016(1-2), 37\u201362 (2003)","journal-title":"Higher-Order and Symbolic Computation"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1053468.1053471","volume":"27","author":"Y.A. Liu","year":"2005","unstructured":"Liu, Y.A., Stoller, S.D., Li, N., Rothamel, T.: Optimizing aggregate array computations in loops. ACM Trans. Program. Lang. Syst.\u00a027(1), 91\u2013125 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1-2","key":"7_CR18","first-page":"1","volume":"69","author":"W.-N. Chin","year":"2006","unstructured":"Chin, W.-N., Khoo, S.-C., Jones, N.: Redundant call elimination via tupling. Fundam. Inform.\u00a069(1-2), 1\u201337 (2006)","journal-title":"Fundam. Inform."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.scico.2003.12.005","volume":"51","author":"R. Giegerich","year":"2004","unstructured":"Giegerich, R., Meyer, C., Steffen, P.: A discipline of dynamic programming over sequence data. Sci. Comput. Program.\u00a051(3), 215\u2013263 (2004)","journal-title":"Sci. Comput. Program."},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11783596_15","volume-title":"Mathematics of Program Construction","author":"J. Kabanov","year":"2006","unstructured":"Kabanov, J., Vene, V.: Recursion schemes for dynamic programming. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol.\u00a04014, pp. 235\u2013252. Springer, Heidelberg (2006)"},{"key":"7_CR21","unstructured":"de Moor, O.: Categories, Relations and Dynamic Programming. PhD thesis, Oxford University Computing Laboratory (1992)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0026809","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"O. Moor de","year":"1995","unstructured":"de Moor, O.: A Generic Program for Sequential Decision Processes. In: Swierstra, S.D. (ed.) PLILP 1995. LNCS, vol.\u00a0982, pp. 1\u201323. Springer, Heidelberg (1995)"},{"key":"7_CR23","volume-title":"Algebra of Programming","author":"R.S. Bird","year":"1996","unstructured":"Bird, R.S., de Moor, O.: Algebra of Programming. Prentice-Hall, Englewood Cliffs (1996)"},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S0956796801004038","volume":"11","author":"R.S. Bird","year":"2001","unstructured":"Bird, R.S.: Maximum marking problems. J. Funct. Program.\u00a011(4), 411\u2013424 (2001)","journal-title":"J. Funct. Program."},{"issue":"2","key":"7_CR25","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"5-6","key":"7_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R.B. Borie","year":"1992","unstructured":"Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica\u00a07(5-6), 555\u2013581 (1992)","journal-title":"Algorithmica"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/351240.351254","volume-title":"Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming, ICFP 2000","author":"I. Sasano","year":"2000","unstructured":"Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. In: Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming, ICFP 2000, pp. 137\u2013149. ACM, New York (2000)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/11560647_37","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"I. Sasano","year":"2005","unstructured":"Sasano, I., Ogawa, M., Hu, Z.: Maximum marking problems with accumulative weight functions. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 562\u2013578. Springer, Heidelberg (2005)"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1411204.1411229","volume-title":"Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming, ICFP 2008","author":"A. Morihata","year":"2008","unstructured":"Morihata, A., Matsuzaki, K., Takeichi, M.: Write it recursively: a generic framework for optimal path queries. In: Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, pp. 169\u2013178. ACM, New York (2008)"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1328408.1328414","volume-title":"Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008","author":"S.C. Mu","year":"2008","unstructured":"Mu, S.C.: Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths. In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, pp. 31\u201339. ACM, New York (2008)"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1328408.1328421","volume-title":"Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008","author":"J. Puchinger","year":"2008","unstructured":"Puchinger, J., Stuckey, P.J.: Automating branch-and-bound for dynamic programs. In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, pp. 81\u201389. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10672-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:58:07Z","timestamp":1558270687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10672-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106712","9783642106729"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10672-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}