{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:19:45Z","timestamp":1648905585444},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0020-0190(01)00320-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"129-134","source":"Crossref","is-referenced-by-count":1,"title":["A note on constructing binary heaps with periodic networks"],"prefix":"10.1016","volume":"83","author":[{"given":"Marek","family":"Piotr\u00f3w","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00320-9_BIB001","series-title":"Proc. 15th Annual ACM Symp. on Theory of Computing","first-page":"1","article-title":"An O(nlogn) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB002","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"Batcher","year":"1968"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB003","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0304-3975(99)00137-1","article-title":"Comparator networks for binary heap construction","volume":"250","author":"Brodal","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00320-9_BIB004","series-title":"Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT)","first-page":"140","article-title":"Heap construction in the parallel comparison tree model","volume":"621","author":"Dietz","year":"1992"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB005","series-title":"Proc. 6th Symposium on Parallel and Distributed Processing","first-page":"514","article-title":"Very fast optimal parallel algorithms for heap construction","author":"Dietz","year":"1994"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB006","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1145\/76359.76362","article-title":"The periodic balanced sorting network","volume":"36","author":"Dowd","year":"1989","journal-title":"J. ACM"},{"issue":"12","key":"10.1016\/S0020-0190(01)00320-9_BIB007","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245: Treesort3","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB008","series-title":"The Art of Computer Programming, Vol. 3","author":"Knuth","year":"1975"},{"issue":"5","key":"10.1016\/S0020-0190(01)00320-9_BIB009","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s002240000103","article-title":"Periodic merging networks","volume":"31","author":"Kuty\u0142owski","year":"1998","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB010","series-title":"Proc. 35th Annual IEEE Symp. on Foundations of Computer Science","first-page":"369","article-title":"Fast and feasible periodic sorting networks of constant depth","author":"Kuty\u0142owski","year":"1994"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB011","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB012","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1109\/71.97899","article-title":"Optimal parallel initialization algorithms for a class of priority queues","volume":"2","author":"Olariu","year":"1991","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0020-0190(01)00320-9_BIB013","series-title":"Proc. 13th ACM Symposium on Parallel Algorithms and Architectures","article-title":"Periodic, random-fault-tolerant correction networks","author":"Piotr\u00f3w","year":"2001"},{"issue":"6","key":"10.1016\/S0020-0190(01)00320-9_BIB014","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232: Heapsort","volume":"7","author":"William","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003209?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003209?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T06:39:43Z","timestamp":1620110383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0020019001003209"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00320-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}