{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:47:26Z","timestamp":1758127646081},"reference-count":6,"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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0167-6423(90)90081-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"119-133","source":"Crossref","is-referenced-by-count":8,"title":["Distributed sorting"],"prefix":"10.1016","volume":"15","author":[{"given":"H.Peter","family":"Hofstee","sequence":"first","affiliation":[]},{"given":"Alain J.","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Jan L.A.","family":"Van De Snepscheut","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(90)90081-N_BIB1","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(90)90081-N_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6423(82)90016-8","article-title":"Smoothsort, an alternative for sorting in situ","volume":"1","author":"Dijkstra","year":"1982","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(90)90081-N_BIB3","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(90)90081-N_BIB4","series-title":"Prentice-Hall International Series in Computer Science","article-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0167-6423(90)90081-N_BIB5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00261260","article-title":"An axiomatic definition of synchronization primitives","volume":"16","author":"Martin","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(90)90081-N_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Inform."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239090081N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239090081N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:53:52Z","timestamp":1555091632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239090081N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016764239090081N"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(90)90081-n","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}