{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:10:09Z","timestamp":1760368209370,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181890","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"135-144","source":"Crossref","is-referenced-by-count":6,"title":["Integer sorting in O(n\u221a(log log n)) expected time and linear space"],"prefix":"10.1109","author":[{"family":"Yijie Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Thorup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"550","article-title":"Faster deterministic sorting and priority queues in linear space","author":"thorup","year":"1998","journal-title":"Proc 9th SODA"},{"article-title":"The C++ Programming Language, Special Edition","year":"2000","author":"stroustrup","key":"ref32"},{"key":"ref31","first-page":"121","article-title":"Priority queues: small, monotone and transdichotomous","author":"raman","year":"1996","journal-title":"Proc 4th ESA LNCS 1136"},{"key":"ref30","first-page":"331","article-title":"Decision trees and random access machines","author":"paul","year":"1980","journal-title":"Proc Symp über Logik and Algoritmik"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.26"},{"key":"ref36","first-page":"205","volume":"42","author":"thorup","year":"2002","journal-title":"Randomized sorting in O(n log log n) time and linear space using addition shift and bit-wise boolean operations J Algor Announced at SODA'97"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181889"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288246"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65958"},{"article-title":"Programming Pearls","year":"1986","author":"bentley","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63307-3_80"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796313490"},{"key":"ref14","first-page":"25","article-title":"The hollerith and powers tabulating machines","author":"comrie","year":"1929","journal-title":"Trans Office Machinary Users’ Assoc Ltd"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80029-7"},{"key":"ref16","first-page":"6","article-title":"Indexing for rapid random access memory systems","volume":"5","author":"dumey","year":"1956","journal-title":"Computers and Automation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80064-9"},{"key":"ref19","first-page":"366","article-title":"Sorting and searching on the word RA M","author":"hagerup","year":"1998","journal-title":"Proc 15th STACS LNCS 1373"},{"article-title":"The Art of Computer Programming, Volume 3 Sorting and Searching","year":"1998","author":"knuth","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548472"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90023-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492667"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00172-8"},{"article-title":"Radix Sorting & Searching","year":"1996","author":"nilsson","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1580"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335344"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365721"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2632"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301323"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579338"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46541-3_20"},{"key":"ref22","article-title":"Deterministic sorting in O(n log log n) time and linear space","author":"han","year":"2002","journal-title":"Proc 34th STOC"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3053"},{"key":"ref24","first-page":"419","article-title":"Parallel integer sorting is more efficient than parallel comparison sorting onm exclusive write PRAMs","author":"han","year":"1999","journal-title":"Proc 10th SODA"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030847"},{"article-title":"The C Programming Language","year":"1988","author":"kernighan","key":"ref26"},{"volume":"22","first-page":"9","year":"1985","key":"ref25"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181890.pdf?arnumber=1181890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T20:31:53Z","timestamp":1489437113000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181890\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181890","relation":{},"subject":[]}}