{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:18:25Z","timestamp":1730301505365,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[[2019,10]]},"DOI":"10.1109\/uemcon47517.2019.8992938","type":"proceedings-article","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T03:36:46Z","timestamp":1581651406000},"page":"0149-0153","source":"Crossref","is-referenced-by-count":0,"title":["Novel Hash-Based Radix Sorting Algorithm"],"prefix":"10.1109","author":[{"given":"Paul K.","family":"Mandal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"191","article-title":"Sorting in linear time","author":"cormen","year":"2014","journal-title":"Introduction to Algorithms"},{"key":"ref3","article-title":"Review on sorting algorithms a comparative study","volume":"7","author":"al-kharabsheh","year":"2013","journal-title":"International Journal of Computer Science and Security (IJCSS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.2003.1183573"},{"key":"ref5","first-page":"168","volume":"3","author":"knuth","year":"1973","journal-title":"The art of computer programming"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/35.6.636"},{"key":"ref7","article-title":"Engineering radix sort","volume":"6","author":"mcilroy","year":"0","journal-title":"Computing Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/10\/12\/123027"},{"key":"ref9","first-page":"253","article-title":"Hash tables","author":"cormen","year":"2014","journal-title":"Introduction to Algorithms"},{"key":"ref1","article-title":"A comparative study on two sorting algorithms","author":"adhikari","year":"2007","journal-title":"Mississippi State University"}],"event":{"name":"2019 IEEE 10th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","start":{"date-parts":[[2019,10,10]]},"location":"New York City, NY, USA","end":{"date-parts":[[2019,10,12]]}},"container-title":["2019 IEEE 10th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8966519\/8992916\/08992938.pdf?arnumber=8992938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:23:10Z","timestamp":1658247790000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8992938\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/uemcon47517.2019.8992938","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}