{"id":"https://openalex.org/W3006552912","doi":"https://doi.org/10.1109/uemcon47517.2019.8992938","title":"Novel Hash-Based Radix Sorting Algorithm","display_name":"Novel Hash-Based Radix Sorting Algorithm","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W3006552912","doi":"https://doi.org/10.1109/uemcon47517.2019.8992938","mag":"3006552912"},"language":"en","primary_location":{"id":"doi:10.1109/uemcon47517.2019.8992938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uemcon47517.2019.8992938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 10th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032223221","display_name":"Paul K. Mandal","orcid":"https://orcid.org/0000-0002-4966-0494"},"institutions":[{"id":"https://openalex.org/I142934699","display_name":"California State University, Fullerton","ror":"https://ror.org/02avqqw26","country_code":"US","type":"education","lineage":["https://openalex.org/I142934699"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul K. Mandal","raw_affiliation_strings":["Department of Computer Engineering, California State University Fullerton, Fullerton, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, California State University Fullerton, Fullerton, USA","institution_ids":["https://openalex.org/I142934699"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086227422","display_name":"Abhishek Verma","orcid":"https://orcid.org/0000-0001-6687-4809"},"institutions":[{"id":"https://openalex.org/I89554219","display_name":"New Jersey City University","ror":"https://ror.org/0546wew42","country_code":"US","type":"education","lineage":["https://openalex.org/I89554219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abhishek Verma","raw_affiliation_strings":["Department of Computer Science, New Jersey City University, Jersey City, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New Jersey City University, Jersey City, NJ","institution_ids":["https://openalex.org/I89554219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1446,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61589647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"0149","last_page":"0153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.852299690246582},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7015722990036011},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6845083236694336},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6553306579589844},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6061995625495911},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5364440679550171},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5182744860649109},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4387114644050598},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3268444240093231},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.05362170934677124}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.852299690246582},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7015722990036011},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6845083236694336},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6553306579589844},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6061995625495911},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5364440679550171},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5182744860649109},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4387114644050598},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3268444240093231},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.05362170934677124},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/uemcon47517.2019.8992938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uemcon47517.2019.8992938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 10th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2071381739","https://openalex.org/W2101888944","https://openalex.org/W2147524355","https://openalex.org/W2157718155","https://openalex.org/W2752908210","https://openalex.org/W6683282558"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W2482527088","https://openalex.org/W3033694952","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2994182992","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682"],"abstract_inverted_index":{"Sorting":[0],"remains":[1],"a":[2,19,55,77,84,154],"quintessential":[3],"problem":[4],"in":[5,44,87],"computer":[6],"science;":[7],"henceforth,":[8],"considerable":[9],"research":[10],"has":[11],"focused":[12],"on":[13],"optimizing":[14],"runtime":[15,135,149],"efficiency":[16],"when":[17],"sorting":[18,26,38,117,126,148,167],"collection":[20],"of":[21,83,131,144],"elements.":[22],"Most":[23],"algorithms":[24,39],"for":[25,57,94,101],"objects":[27,43,118],"are":[28,35],"comparison-based.":[29],"Bucket":[30],"Sort":[31,34,62,89],"and":[32,97,160],"Radix":[33,61,72,88,108,156],"non-comparison":[36],"based":[37],"that":[40],"can":[41],"sort":[42,157],"linear":[45],"time.":[46],"In":[47,68],"both":[48],"cases,":[49],"the":[50,58,92,95,129,134,142,147],"corresponding":[51],"array":[52,75,96],"indices":[53],"represent":[54],"hash":[56,78,85],"object.":[59],"Nevertheless,":[60],"still":[63,150],"requires":[64],"an":[65,106],"auxiliary":[66,74],"array.":[67],"this":[69,110,124],"paper,":[70],"replacing":[71],"Sort's":[73],"with":[76,105,165],"table":[79,86],"is":[80,158],"proposed.":[81],"Use":[82],"should":[90,113],"avoid":[91],"calculations":[93],"be":[98],"better":[99],"suited":[100],"handling":[102],"objects.":[103],"As":[104],"array-based":[107],"sort,":[109],"hash-based":[111,155],"approach":[112],"maintain":[114],"linearity,":[115],"thereby":[116],"more":[119],"efficiently.":[120],"Following":[121],"successfully":[122],"programming":[123],"novel":[125],"algorithm,":[127],"as":[128,141],"number":[130,143],"elements":[132],"increases,":[133,146],"progresses":[136],"linearly,":[137],"not":[138],"exponentially.":[139],"Moreover,":[140],"digits":[145],"lengthens":[151],"linearly.":[152],"Thus,":[153],"feasible":[159],"overcomes":[161],"many":[162],"issues":[163],"associated":[164],"current":[166],"algorithms.":[168]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}