{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:45Z","timestamp":1759638405997},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0020-0190(01)00199-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"71-73","source":"Crossref","is-referenced-by-count":7,"title":["A faster off-line algorithm for the TCP acknowledgement problem"],"prefix":"10.1016","volume":"81","author":[{"given":"John","family":"Noga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00199-5_BIB001","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00199-5_BIB002","series-title":"Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC'98)","first-page":"389","article-title":"TCP dynamic acknowledgement: Theory and practice","author":"Dooly","year":"1998"},{"key":"10.1016\/S0020-0190(01)00199-5_BIB003","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0196-6774(90)90031-9","article-title":"Sequence comparison with mixed convex and concave costs","volume":"11","author":"Eppstein","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00199-5_BIB004","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/0196-6774(88)90032-6","article-title":"The concave least-weight subsequence problem","volume":"9","author":"Wilber","year":"1988","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001995?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001995?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:51:33Z","timestamp":1556898693000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0020019001001995"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00199-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}