{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T12:00:08Z","timestamp":1757592008171},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf01933158","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T15:55:40Z","timestamp":1122738940000},"page":"142-152","source":"Crossref","is-referenced-by-count":13,"title":["Diamond a sorting method for vector machines"],"prefix":"10.1007","volume":"21","author":[{"given":"Harvey K.","family":"Brock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara J.","family":"Brooks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01933158_CR1","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher,Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference 32 (1968), 307\u2013314.","journal-title":"Proc. AFIPS Spring Joint Computer Conference"},{"key":"BF01933158_CR2","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1090\/S0025-5718-1979-0528051-4","volume":"33","author":"D. G. Korn","year":"1979","unstructured":"D. G. Korn and J. J. Lambiotte,Computing the fast Fourier transform on a vector computer, Math. Comp. 33 (1979), 977\u2013992.","journal-title":"Math. Comp."},{"key":"BF01933158_CR3","volume-title":"The Art of Computer Programming, Vol. 3 Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3 Sorting and Searching, Addison-Wesley Publishing Company, Reading, Massachusetts (1973)."},{"key":"BF01933158_CR4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1137\/0201021","volume":"1","author":"C. L. Liu","year":"1971","unstructured":"C. L. Liu,Analysis and synthesis of sorting alghorithms, SIAM J. Comput. 1 (1971), 290\u2013304.","journal-title":"SIAM J. Comput."},{"key":"BF01933158_CR5","first-page":"133","volume":"2","author":"H. S. Stone","year":"1978","unstructured":"H. S. Stone,Sorting on STAR, IEEE Trans. on Software 2 (1978), 133\u2013194.","journal-title":"IEEE Trans. on Software"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933158.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01933158\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:59:46Z","timestamp":1557435586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01933158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF01933158"],"URL":"https:\/\/doi.org\/10.1007\/bf01933158","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}