{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:42:25Z","timestamp":1762177345359},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/icccnt49239.2020.9225518","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T20:00:38Z","timestamp":1602792038000},"page":"1-4","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Sorting Algorithm for binary data"],"prefix":"10.1109","author":[{"given":"Bhavani","family":"Yerram","sequence":"first","affiliation":[]},{"given":"Jaya Krishna","family":"Bhonagiri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT.2015.98"},{"journal-title":"a practical approach to data structures and algorithms","year":"2007","author":"sanjay","key":"ref3"},{"key":"ref10","article-title":"A comprehensive note on complexity issues in sorting algorithms","author":"parag","year":"2009","journal-title":"Advances in Computing Research 2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2217-0_49"},{"key":"ref11","first-page":"3027578:1","article-title":"SA sorting: a novel sorting technique for large-scale data","author":"habaz","year":"2019","journal-title":"J Comput Netw Commun"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MACE.2011.5987184"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1186\/s42787-019-0004-2"},{"journal-title":"BIT Sorting New Technique for Sorting","year":"2015","author":"hemkumar","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/I2CT.2018.8529769"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/UPCON.2015.7456756"},{"journal-title":"An Introduction to Data Structures","year":"2005","author":"levtin","key":"ref1"}],"event":{"name":"2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","start":{"date-parts":[[2020,7,1]]},"location":"Kharagpur, India","end":{"date-parts":[[2020,7,3]]}},"container-title":["2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9211590\/9225262\/09225518.pdf?arnumber=9225518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:23:09Z","timestamp":1656375789000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9225518\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icccnt49239.2020.9225518","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}