{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T05:33:42Z","timestamp":1734672822333,"version":"3.32.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1007\/bf00134013","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:01:24Z","timestamp":1099746084000},"page":"31-41","source":"Crossref","is-referenced-by-count":6,"title":["Fault-tolerance in balanced sorting networks"],"prefix":"10.1007","volume":"1","author":[{"given":"Jianli","family":"Sun","sequence":"first","affiliation":[]},{"given":"Jan","family":"Gecsei","sequence":"additional","affiliation":[]},{"given":"Eduard","family":"Cerny","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"CR1","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/TC.1985.5009383","volume":"C-34","author":"L. Rudolph","year":"1985","unstructured":"L. Rudolph, ?A robust sorting network,? IEEE Trans. Computers C-34 (4): 326?335, 1985.","journal-title":"IEEE Trans. Computers"},{"key":"CR2","first-page":"307","volume":"32","author":"K.E. Batcher","year":"1968","unstructured":"K.E. Batcher, ?Sorting networks and their applications,? Proc. AFIPS Spring Joint Comput. Conf 32: 307?314, 1968.","journal-title":"Proc. AFIPS Spring Joint Comput. Conf"},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H.S. Stone","year":"1971","unstructured":"H.S. Stone, ?Parallel processing with the perfect shuffle,? IEEE Trans. Computers C-20 (2): 153?161, 1971.","journal-title":"IEEE Trans. Computers"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M. Dowd, Y. Perl, L. Rudolph, and M. Saks, ?The balanced sorting network,? Proc. ACM Princ. Distrib. Comput., pp. 161?172, August 1983.","DOI":"10.1145\/800221.806719"},{"key":"CR5","volume-title":"The Art of Computer Programming, vol. 3","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, MA, 1968."},{"issue":"6","key":"CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/MC.1987.1663586","volume":"20","author":"G.B. Adams III","year":"1987","unstructured":"G.B. Adams III, et al., ?A survey and comparison of fault-tolerant multistage interconnection networks,? Computer 20 (6): 14?27, 1987.","journal-title":"Computer"},{"key":"CR7","volume-title":"Computational Aspects of VLSI","author":"J.D. Ullman","year":"1983","unstructured":"J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1983."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"M. Ajtai, et al., ?An O(nlog n) sorting network,? Proc. 15th Annu. ACM Symp. Theory Comput., pp. 1?9, 1983.","DOI":"10.1145\/800061.808726"},{"key":"CR9","unstructured":"R. Cole and A. Siege, ?Optimal VLSI circuits for sorting,? Technical Report #172, Dept. of Computer Science, New York Univ., September 1985."},{"key":"CR10","volume-title":"Parallel Sorting Algorithms","author":"S.G. Akl","year":"1985","unstructured":"S.G. Akl, Parallel Sorting Algorithms, Academic Press, Orlando, FL, 1985."},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1109\/12.16506","volume":"38","author":"T. Nakatani","year":"1989","unstructured":"T. Nakatani et al., ?K-way bitonic sort,? IEEE Trans. Computers 38 (2): 283?288, 1989.","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"CR12","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/12.4615","volume":"37","author":"Y. Choi","year":"1988","unstructured":"Y. Choi and M. Malek, ?A fault-tolerant systolic sorter,? IEEE Trans. Computers 37 (5): 621?624, 1988.","journal-title":"IEEE Trans. Computers"},{"key":"CR13","unstructured":"C.E. Leiserson, ?Systolic priority queues,? Proc. Caltech Conf. VLSI, pp. 199?224, January 1979."},{"issue":"10","key":"CR14","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1109\/TC.1981.1675693","volume":"C-30","author":"T.-Y. Feng","year":"1981","unstructured":"T.-Y. Feng and C.-L. Wu, ?Fault-diagnosis for a class of multistage interconnection networks,? IEEE Trans. Computers C-30 (10): 743?758, 1981.","journal-title":"IEEE Trans. Computers"},{"key":"CR15","unstructured":"K.E. Batcher, ?The flip network in STARAN,? Proc. Intern. Conf. Parallel Processing, pp. 65?71, 1976."}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00134013.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00134013\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00134013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T19:07:58Z","timestamp":1734635278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00134013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["BF00134013"],"URL":"https:\/\/doi.org\/10.1007\/bf00134013","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}