{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T09:50:14Z","timestamp":1690451414407},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7655,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0304-3975(92)90089-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"137-141","source":"Crossref","is-referenced-by-count":5,"title":["Sorting the sums (xi + yj) in O(n2) comparisons"],"prefix":"10.1016","volume":"103","author":[{"given":"Jean-Luc","family":"Lambert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90089-X_BIB1","unstructured":"A. Arnold, private communication."},{"key":"10.1016\/0304-3975(92)90089-X_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(89)90132-1","article-title":"Lower bounds for sorting sums","volume":"66","author":"Dietzfelbinger","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90089-X_BIB3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","article-title":"How good is the information theory about sorting?","volume":"1","author":"Fredman","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/0304-3975(92)90089-X_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/360825.360869","article-title":"Sorting X + Y","volume":"18","author":"Harper","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90089-X_BIB5","series-title":"Proc. STACS 90","first-page":"195","article-title":"Sorting the sums (xi + yj) in O(n2) comparisons","volume":"Vol. 415","author":"Lambert","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290089X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290089X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:57:36Z","timestamp":1555077456000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290089X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["030439759290089X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90089-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}