{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:17:36Z","timestamp":1734153456896,"version":"3.30.2"},"reference-count":2,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,6,30]],"date-time":"2005-06-30T00:00:00Z","timestamp":1120089600000},"content-version":"vor","delay-in-days":6146,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1016\/0196-6774(88)90024-7","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"321-342","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm"],"prefix":"10.1016","volume":"9","author":[{"given":"Alejandro A","family":"Sch\u00e4ffer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1984","series-title":"Computational Aspects of VLSI","author":"Ullman","key":"10.1016\/0196-6774(88)90024-7_BIB1"},{"key":"10.1016\/0196-6774(88)90024-7_BIB2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0196-6774(86)90008-8","article-title":"Conway's parallel sorting algorithm","volume":"7","author":"Warshauer","year":"1986","journal-title":"J. Algorithms"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677488900247?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677488900247?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:37:30Z","timestamp":1734082650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677488900247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":2,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0196677488900247"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(88)90024-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1988,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(88)90024-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}