{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T03:11:22Z","timestamp":1692673882995},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0167-8191(90)90074-j","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"369-373","source":"Crossref","is-referenced-by-count":4,"title":["A fully vectorized quicksort"],"prefix":"10.1016","volume":"16","author":[{"given":"Stewart A","family":"Levin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90074-J_BIB1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","article-title":"Optimal sorting algorithms for parallel computers","volume":"C-27","author":"Baudet","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90074-J_BIB2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Computer J."},{"key":"10.1016\/0167-8191(90)90074-J_BIB3","series-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0167-8191(90)90074-J_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-8191(87)90062-7","article-title":"Timing results of some internal sorting algorithms on vector computers","volume":"4","author":"R\u00f6nsch","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90074-J_BIB5","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","article-title":"Implementing quicksort programs","volume":"21","author":"Sedgewick","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(90)90074-J_BIB6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TSE.1978.231484","article-title":"Sorting on STAR","volume":"SE-4","author":"Stone","year":"1978","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-8191(90)90074-J_BIB7","series-title":"Algorithms + Data Structures = Programs","author":"Wirth","year":"1976"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090074J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090074J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:26:21Z","timestamp":1551068781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090074J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016781919090074J"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90074-j","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}