{"id":"https://openalex.org/W2152430258","doi":"https://doi.org/10.1145/103418.103452","title":"Constant-time parallel integer sorting","display_name":"Constant-time parallel integer sorting","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W2152430258","doi":"https://doi.org/10.1145/103418.103452","mag":"2152430258"},"language":"en","primary_location":{"id":"doi:10.1145/103418.103452","doi":"https://doi.org/10.1145/103418.103452","is_oa":true,"landing_page_url":"https://doi.org/10.1145/103418.103452","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/103418.103452","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/103418.103452","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059236728","display_name":"Torben Hagerup","orcid":"https://orcid.org/0000-0001-6974-2473","observed_orcids":["https://orcid.org/0000-0001-6974-2473"]},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Torben Hagerup","raw_affiliation_strings":["Max-Planck-Institut fu\u00a8r Informatik, Saarbrucken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut fu\u00a8r Informatik, Saarbrucken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059236728"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":3.9335,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.94432548,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5214999914169312,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5214999914169312,"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/T11269","display_name":"Algorithms and Data Compression","score":0.2467000037431717,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.09790000319480896,"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/constant-time-algorithms","display_name":"constant-time algorithms","score":0.75},{"id":"https://openalex.org/keywords/list-ranking","display_name":"list ranking","score":0.9300000071525574},{"id":"https://openalex.org/keywords/chernoff-bound","display_name":"Chernoff bound","score":0.9259999990463257}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.7067908048629761},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7046757936477661},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6659823060035706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6281282901763916},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5998489260673523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35212716460227966},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.2769245505332947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22203031182289124},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.20263001322746277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17509227991104126},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1613781452178955}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/103418.103452","doi":"https://doi.org/10.1145/103418.103452","is_oa":true,"landing_page_url":"https://doi.org/10.1145/103418.103452","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/103418.103452","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91","raw_type":"proceedings-article"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:46365","doi":null,"is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/46365","pdf_url":null,"source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"bookpart"},{"id":"mag:167927825","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/stoc/stoc91.html#Hagerup91","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on the Theory of Computing","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/103418.103452","doi":"https://doi.org/10.1145/103418.103452","is_oa":true,"landing_page_url":"https://doi.org/10.1145/103418.103452","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/103418.103452","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2152430258.pdf","grobid_xml":"https://content.openalex.org/works/W2152430258.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1534829670","https://openalex.org/W1551639328","https://openalex.org/W1564095107","https://openalex.org/W1981573606","https://openalex.org/W1992470151","https://openalex.org/W2019964994","https://openalex.org/W2023518480","https://openalex.org/W2047234016","https://openalex.org/W2057399436","https://openalex.org/W2060690113","https://openalex.org/W2064832140","https://openalex.org/W2068158683","https://openalex.org/W2099765347"],"related_works":["https://openalex.org/W167927825","https://openalex.org/W7097985896","https://openalex.org/W7098449661","https://openalex.org/W1564095107","https://openalex.org/W7095691789","https://openalex.org/W1569625216","https://openalex.org/W130883040","https://openalex.org/W7101193033","https://openalex.org/W2049494072","https://openalex.org/W628154714"],"abstract_inverted_index":{"We":[0],"investigate":[1],"a":[2,24,53,87,92,160],"nonstandard":[3],"output":[4],"convention":[5],"for":[6,175],"sorting.Specifically,":[7],"the":[8,45,72,95,99,112,115,123,165],"input":[9],"elements":[10,46],"are":[11],"to":[12,62,103],"be":[13,37,69,104,148,159,222],"returned":[14],"not":[15],"in":[16,20,23,28,49,71],"an":[17,84],"array":[18],"sorted":[19,27],"nondecrea.singorder,":[21],"but":[22],"linked":[25],"list":[26,43],"nondecreasing":[29],"order.This":[30],"problem,":[31],"which":[32],"we":[33,79],"call":[34],"chuin-sorting,":[35],"may":[36],"viewed":[38],"as":[39,111],"standard":[40],"sorting":[41],"\"minus\"":[42],"ranking,":[44],"of":[47,74,81,114,122,172],"Bi":[48],"this":[50],"bucket":[51],"through":[52],"random":[54,189],"\"dart":[55],"throwing\"":[56],"process.The":[57],"third":[58],"part":[59],"is":[60,102],"similar":[61],"ordered":[63],"chaining.The":[64],"same":[65],"three":[66],"parts":[67],"can":[68],"distinguished":[70],"algorithms":[73],"(Rajasekaran":[75],"and":[76,121,146,156,216,224],"Reif,":[77],"1989).Whenever":[78],"speak":[80],"randomly":[82,163],"choosing":[83],"element":[85],"from":[86,119,164],"set":[88,101,117,161],"without":[89],"explicitly":[90],"mentioning":[91],"probability":[93],"distribution,":[94],"uniform":[96,166],"distribution":[97,167],"over":[98,168],"relevant":[100],"understood.Form61Nand":[105],"V~{l":[106],",...,":[107],"m},":[108],"define":[109],"MAXGAPm(V)":[110],"size":[113],"largest":[116],"disjoint":[118],"V":[120,158],"form":[124],"{a,":[125],".":[126,130,219],"...b}":[127],"or":[128],"{b,":[129],"...m.":[131],"l,a},":[132],",a},":[133],"where":[134],"a,":[135],"bE":[136],"{l,...":[137,141],",m},":[138],"ora8zeroif":[139],"V=":[140],",rn}.Fact":[142],"1:":[143],"Let":[144,211],"m":[145,155],"k":[147,153],"integers":[149],"with":[150],"1":[151],"<":[152,154,198],"let":[157,217],"chosen":[162],"all":[169],"k-element":[170],"subsets":[171],"{1,...,":[173],"m}.Then":[174],"every":[176,186,204],"r":[177,205],"~O,":[178],"Pr(MAXGAPm(V)":[179],"~?')":[180],"~me-rkJm.Fact":[181],"2":[182],"(Chernoff":[183],"bounds):":[184],"For":[185,203],"binomially":[187],"distributed":[188],"variable":[190],"S,":[191],"(a)":[192],"Pr(S":[193,197,207],"~2E(S))":[194],"~e-~is)i';":[195],"(b)":[196],"17(":[199],"S)/2)":[200],"~e-E(s)i8;":[201],"(c)":[202],"~6.E(S),":[206],"~r)":[208],"~2-\".Fact":[209],"3:":[210],"m,":[212],"S,V":[213],"E":[214],"IN":[215],"21,1,":[218],"..,":[220],"Zm,V":[221],"independent":[223],"uniformly":[225]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}