{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:53Z","timestamp":1759638713804},"reference-count":5,"publisher":"Informa UK Limited","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1080\/00207169708804607","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:22:00Z","timestamp":1182802920000},"page":"161-164","source":"Crossref","is-referenced-by-count":9,"title":["Tight \u03a9(<i>n<\/i>lg<i>n<\/i>) lower bound for finding a longest increasing subsequence"],"prefix":"10.1080","volume":"65","author":[{"given":"Prakash","family":"Ramanan","sequence":"first","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Ben-Or, M. 1983.Proc. 15th ACM Symp. on Theory of Computing. Lower Bounds for Algebraic Computation Trees. 1983. pp.80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90103-X"},{"key":"CIT0004","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"Gries D.","year":"1981"},{"key":"CIT0005","volume-title":"Tight \u03a9(n lg n) Lower Bound for Finding a Longest Increasing Subsequence","author":"Lewis C.","year":"1994"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169708804607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T15:51:55Z","timestamp":1556553115000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169708804607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":5,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1080\/00207169708804607"],"URL":"https:\/\/doi.org\/10.1080\/00207169708804607","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}