{"id":"https://openalex.org/W1602103078","doi":"https://doi.org/10.1109/sfcs.2002.1181890","title":"Integer sorting in O(n\u221a(log log n)) expected time and linear space","display_name":"Integer sorting in O(n\u221a(log log n)) expected time and linear space","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W1602103078","doi":"https://doi.org/10.1109/sfcs.2002.1181890","mag":"1602103078"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181890","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/A5091329448","display_name":"Yijie Han","orcid":"https://orcid.org/0000-0003-1305-6815"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yijie Han","raw_affiliation_strings":["School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MO, USA","institution_ids":["https://openalex.org/I75421653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Thorup","raw_affiliation_strings":["Shannon Laboratory, AT and T Research Laboratories, Florham Park, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shannon Laboratory, AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9702,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.97254553,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7879329919815063},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.675163984298706},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6425384879112244},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6079611778259277},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5867300629615784},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5604972243309021},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5588339567184448},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5268862247467041},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.52657151222229},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4937981069087982},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4778596758842468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16792398691177368},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12333282828330994}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7879329919815063},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.675163984298706},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6425384879112244},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6079611778259277},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5867300629615784},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5604972243309021},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5588339567184448},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5268862247467041},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.52657151222229},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4937981069087982},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4778596758842468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16792398691177368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12333282828330994},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sfcs.2002.1181890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181890","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.671.5583","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.671.5583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/benmv/Public/thorup.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W758438229","https://openalex.org/W1493544477","https://openalex.org/W1542553486","https://openalex.org/W1563264900","https://openalex.org/W1569625216","https://openalex.org/W1587590810","https://openalex.org/W1595696424","https://openalex.org/W1599325086","https://openalex.org/W1977026060","https://openalex.org/W1978715699","https://openalex.org/W1978757752","https://openalex.org/W1984816083","https://openalex.org/W1985361644","https://openalex.org/W1992470151","https://openalex.org/W1996028864","https://openalex.org/W2009283111","https://openalex.org/W2018338704","https://openalex.org/W2024305877","https://openalex.org/W2055706406","https://openalex.org/W2059598403","https://openalex.org/W2059868876","https://openalex.org/W2074286662","https://openalex.org/W2089026470","https://openalex.org/W2095206322","https://openalex.org/W2115873073","https://openalex.org/W2125027776","https://openalex.org/W2125712182","https://openalex.org/W2126532003","https://openalex.org/W2164485560","https://openalex.org/W2320005888","https://openalex.org/W2326587081","https://openalex.org/W2336485197","https://openalex.org/W2611598995","https://openalex.org/W2979730858","https://openalex.org/W2991021177","https://openalex.org/W3174107850","https://openalex.org/W3198160809","https://openalex.org/W6622100053","https://openalex.org/W6628944751","https://openalex.org/W6632477169","https://openalex.org/W6635718208","https://openalex.org/W6644740055","https://openalex.org/W6662950489","https://openalex.org/W6737467347","https://openalex.org/W6781002287","https://openalex.org/W6800848122"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W1529311266","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W1968512104","https://openalex.org/W2113270940","https://openalex.org/W78560857"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,81],"randomized":[3],"algorithm":[4],"sorting":[5,115,118],"n":[6,92],"integers":[7,38,93],"in":[8,47,102],"O(n/spl":[9,48],"radic/(log":[10,49],"log":[11,23,24,50,63,64],"n))":[12],"expected":[13,52],"time":[14,104],"and":[15,105,116],"linear":[16,103],"space.":[17,106],"This":[18,54,107],"improves":[19],"the":[20,37,56,60,75],"previous":[21],"O(n":[22],"n)":[25],"bound":[26,66],"by":[27,41],"Anderson":[28],"et":[29],"al.":[30],"(1995).":[31],"As":[32],"an":[33],"immediate":[34],"consequence,":[35],"if":[36],"are":[39],"bounded":[40],"U,":[42],"we":[43,90],"can":[44],"sort":[45],"them":[46],"U))":[51],"time.":[53],"is":[55,80],"first":[57],"improvement":[58],"over":[59],"O":[61],"(n":[62],"U)":[65],"obtained":[67],"with":[68],"van":[69],"Emde":[70],"Boas'":[71],"data":[72],"structure.":[73],"At":[74],"heart":[76],"of":[77,85,96],"our":[78],"construction,":[79],"technical":[82],"deterministic":[83,113],"lemma":[84],"independent":[86],"interest;":[87],"namely,":[88],"that":[89],"split":[91],"into":[94],"subsets":[95],"size":[97],"at":[98],"most":[99],"/spl":[100],"radic/n":[101],"also":[108],"implies":[109],"improved":[110],"bounds":[111],"for":[112],"string":[114],"integer":[117],"without":[119],"multiplication.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}