{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:20:20Z","timestamp":1648866020970},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":[[1990,3]]},"DOI":"10.1016\/0020-0190(90)90144-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"103-109","source":"Crossref","is-referenced-by-count":9,"title":["The complexity of searching in X + Y and other multisets"],"prefix":"10.1016","volume":"34","author":[{"given":"Michel","family":"Cosnard","sequence":"first","affiliation":[]},{"given":"Jean","family":"Duprat","sequence":"additional","affiliation":[]},{"given":"Afonso G.","family":"Ferreira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90144-M_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"1","key":"10.1016\/0020-0190(90)90144-M_BIB2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(89)90027-3","article-title":"Complexity of selection in X + Y","volume":"67","author":"Cosnard","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(90)90144-M_BIB3","unstructured":"M. Cosnard, J. Duprat and A.G. Ferreira, Known and new results on selection, sorting and searching in X + Y and sorted matrices, Tech. Rept. LIP-IMAG, no. 89-10."},{"key":"10.1016\/0020-0190(90)90144-M_BIB4","series-title":"Parallel and Distributed Algorithms","first-page":"145","article-title":"The knapsack problem on parallel architectures","author":"Ferreira","year":"1989"},{"key":"10.1016\/0020-0190(90)90144-M_BIB5","unstructured":"A.G. Ferreira, A parallel time\/hardware tradeoff T.H = O(2n2) for the knapsack problem, IEEE Trans. Comput. to appear."},{"issue":"1","key":"10.1016\/0020-0190(90)90144-M_BIB6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/0213002","article-title":"Generalized selection and ranking: sorted matrices","volume":"13","author":"Frederickson","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/0020-0190(90)90144-M_BIB7","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"},{"issue":"2","key":"10.1016\/0020-0190(90)90144-M_BIB8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/0020-0190(90)90144-M_BIB9","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1145\/322092.322097","article-title":"Lower bounds for selection in X + Y and other multisets","volume":"25","author":"Johnson","year":"1978","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0020-0190(90)90144-M_BIB10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","article-title":"Selecting the kth element in X + Y and X1 + X2 + \u22ef + Xm","volume":"7","author":"Johnson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(90)90144-M_BIB11","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(90)90144-M_BIB12","article-title":"The Art of Computing Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(90)90144-M_BIB13","first-page":"101","article-title":"Channel routing in VLSI","author":"Mirzaian","year":"1984","journal-title":"Proc. 16th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90144-M_BIB14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0020-0190(85)90123-1","article-title":"Selection in X + Y and matrices with sorted rows and columns","volume":"20","author":"Mirzaian","year":"1985","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0020-0190(90)90144-M_BIB15","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1137\/0210033","article-title":"A T = O(2n2), S = O(2n2) algorithm for certain NP-complete problems","volume":"10","author":"Schroeppel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(90)90144-M_BIB16","author":"Vyscoc","year":"1988","journal-title":"Personal communication"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090144M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090144M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:58:40Z","timestamp":1555088320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090144M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["002001909090144M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90144-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}