{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:21:31Z","timestamp":1648542091603},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":[[1981]]},"DOI":"10.1007\/bf00289592","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T00:07:05Z","timestamp":1096934825000},"page":"87-91","source":"Crossref","is-referenced-by-count":3,"title":["Another look at the ?longest ascending subsequence? problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Paul","family":"Pritchard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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","volume-title":"A discipline of programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice-Hall 1976"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Math. 11, 29?35 (1975)","journal-title":"Discrete Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1112\/jlms\/s1-34.3.352","volume":"34","author":"A. Seidenburg","year":"1959","unstructured":"Seidenburg, A.: A simple proof of a theorem of Erd\u00f6s and Szekeres. J. London Math. Soc. 34, 352 (1959)","journal-title":"J. London Math. Soc."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289592.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289592\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:57Z","timestamp":1554743697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["BF00289592"],"URL":"https:\/\/doi.org\/10.1007\/bf00289592","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981]]}}}