{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:14:08Z","timestamp":1693869248287},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bf00625277","type":"journal-article","created":{"date-parts":[[2004,11,26]],"date-time":"2004-11-26T04:08:10Z","timestamp":1101442090000},"page":"1-15","source":"Crossref","is-referenced-by-count":17,"title":["Some modified algorithms for Dijkstra's longest upsequence problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Robert B. K.","family":"Dewar","sequence":"first","affiliation":[]},{"given":"Susan M.","family":"Merritt","sequence":"additional","affiliation":[]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288531","volume":"13","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra, E.W.: Some beautiful arguments using mathematical induction. Acta Informat.13, 1?8 (1980)","journal-title":"Acta Informat."},{"key":"CR2","unstructured":"Dewar, R.B.K., Merritt, S.M.: A derivation of sorting algorithms (to be published)"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Dewar, R.B.K., Schonberg, E.: The elements ofSETL style. Proc. ACM Conf., Detroit 1979","DOI":"10.1145\/800177.810021"},{"key":"CR4","unstructured":"Dewar, R.B.K., Schonberg, E., Schwartz, J.T.: Higher level programming. CIMS, New York University 1981"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0004-3702(78)80016-2","volume":"10","author":"C. Green","year":"1978","unstructured":"Green, C., Barstow, D.R.: On program synthesis knowledge. Artifical Intelligence10, 241?279 (1978","journal-title":"Artifical Intelligence"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F.K. Hwang","year":"1972","unstructured":"Hwang, F.K., Lin, S.: A simple algorithm for merging two disjoint linearly ordered sets. SIAM J. Computing1, 31?39 1972","journal-title":"SIAM J. Computing"},{"key":"CR7","volume-title":"The art of computer programming, Vol. III: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, Vol. III: Sorting and searching. Addison-Wesley, Reading, MA, USA, 1973"},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/322139.322144","volume":"26","author":"G.K. Manacher","year":"1979","unstructured":"Manacher, G.K.: Significant improvements to the Hwang-Lin merging algorithm. JACM26, 3, 434?440 (1979)","journal-title":"JACM"},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/322139.322145","volume":"26","author":"G.K. Manacher","year":"1979","unstructured":"Manacher, G.K.: The Ford Johnson Sorting Algorithm is not optimal. JACM26, 3, 441?456 (1979)","journal-title":"JACM"},{"key":"CR10","unstructured":"Merritt, S.M.: The role of the high level specification in programming by transformation: Specification and transformation by parts. Ph.D. Thesis, Computer Science Dept. New York University, 1982"},{"key":"CR11","unstructured":"Schwartz, J.T.: On programming: An interim report on theSETL project. CIMS, New York University, 1974"},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/357162.357166","volume":"4","author":"M. Sharir","year":"1982","unstructured":"Sharir, M.: Some observations concerning formal differentiation of set-theoretic expressions. ACM TOPLAS4, 2, 196?225 (1982)","journal-title":"ACM TOPLAS"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00625277.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00625277\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00625277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T09:11:18Z","timestamp":1585991478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00625277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982]]}},"alternative-id":["BF00625277"],"URL":"https:\/\/doi.org\/10.1007\/bf00625277","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982]]}}}