{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:00:51Z","timestamp":1760403651354,"version":"build-2065373602"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council","doi-asserted-by":"publisher","award":["NSC-84-25 1 l-S-003-089"],"award-info":[{"award-number":["NSC-84-25 1 l-S-003-089"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0925-2312(96)00040-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:59:42Z","timestamp":1027587582000},"page":"289-299","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["A low-cost neural sorting network with O(1) time complexity"],"prefix":"10.1016","volume":"14","author":[{"given":"Shun-Shii","family":"Lin","sequence":"first","affiliation":[]},{"given":"Shen-Hsuan","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1989","author":"Akl","key":"10.1016\/S0925-2312(96)00040-9_BIB1"},{"issue":"10","key":"10.1016\/S0925-2312(96)00040-9_BIB2","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1109\/12.257714","article-title":"A Boolean neural network approach for the traveling salesman problem","volume":"42","author":"Bhide","year":"1993","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S0925-2312(96)00040-9_BIB3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(93)90042-8","article-title":"A neural sorting network with O(1) time complexity","volume":"45","author":"Chen","year":"1993","journal-title":"Information Processing Letters"},{"year":"1993","author":"Chester","key":"10.1016\/S0925-2312(96)00040-9_BIB4"},{"issue":"4","key":"10.1016\/S0925-2312(96)00040-9_BIB5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","volume":"C-34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0925-2312(96)00040-9_BIB6","first-page":"1","article-title":"On a constant-time, low-complexity winner-take-all neural network","volume":"44","author":"Tseng","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0925-2312(96)00040-9_BIB7","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/72.392258","article-title":"Analysis and design of an analog sorting network","volume":"6","author":"Wang","year":"1995","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0925-2312(96)00040-9_BIB8","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1006\/jpdc.1994.1034","article-title":"The minimal number of layers of a perceptron that sorts","volume":"20","author":"Zwietering","year":"1994","journal-title":"J. Parallel Distributed Comput"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231296000409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231296000409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T18:07:42Z","timestamp":1760378862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231296000409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0925231296000409"],"URL":"https:\/\/doi.org\/10.1016\/s0925-2312(96)00040-9","relation":{},"ISSN":["0925-2312"],"issn-type":[{"type":"print","value":"0925-2312"}],"subject":[],"published":{"date-parts":[[1997,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A low-cost neural sorting network with O(1) time complexity","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0925-2312(96)00040-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}