{"id":"https://openalex.org/W1005199229","doi":"https://doi.org/10.1017/cbo9780511814068.017","title":"Sorting Algorithms","display_name":"Sorting Algorithms","publication_year":2001,"publication_date":"2001-08-30","ids":{"openalex":"https://openalex.org/W1005199229","doi":"https://doi.org/10.1017/cbo9780511814068.017","mag":"1005199229"},"language":"en","primary_location":{"id":"doi:10.1017/cbo9780511814068.017","doi":"https://doi.org/10.1017/cbo9780511814068.017","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511814068.017","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Graphs","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W390146837","display_name":"Random Graphs"},"type":"book-chapter","is_traditional":true,"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/A5109915650","display_name":"B\u00e9la Bollob\u00e1s","orcid":"https://orcid.org/0000-0002-9819-7213","observed_orcids":["https://orcid.org/0000-0002-9819-7213"]},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B\u00e9la Bollob\u00e1s","raw_affiliation_strings":["Trinity College, Cambridge and University of Memphis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trinity College, Cambridge and University of Memphis","institution_ids":["https://openalex.org/I94658018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109915650"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"425","last_page":"446"},"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.725600004196167,"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.725600004196167,"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.10239999741315842,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.07119999825954437,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.9850000143051147},{"id":"https://openalex.org/keywords/comparison-based-sorting","display_name":"comparison-based sorting","score":0.7889999747276306},{"id":"https://openalex.org/keywords/decision-tree","display_name":"decision tree","score":0.5059999823570251},{"id":"https://openalex.org/keywords/information-theoretic-lower-bounds","display_name":"information-theoretic lower bounds","score":0.7590000033378601},{"id":"https://openalex.org/keywords/adaptive-algorithms","display_name":"adaptive algorithms","score":0.6240000128746033},{"id":"https://openalex.org/keywords/binary-comparisons","display_name":"binary comparisons","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6815516948699951},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6312394142150879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.609804630279541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4832902252674103}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/cbo9780511814068.017","doi":"https://doi.org/10.1017/cbo9780511814068.017","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511814068.017","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Graphs","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2076458424","https://openalex.org/W4417408857","https://openalex.org/W3096178536","https://openalex.org/W2131677064","https://openalex.org/W3141876900","https://openalex.org/W2098663118","https://openalex.org/W4386155749","https://openalex.org/W205591407","https://openalex.org/W7074562665","https://openalex.org/W2155371437"],"abstract_inverted_index":{"Random":[0],"graph":[1,42],"techniques":[2],"are":[3,46,99],"very":[4],"useful":[5],"in":[6,50,108,201,206,219,238],"several":[7],"areas":[8],"of":[9,24,34,88,113,234,249],"computer":[10],"science.":[11],"In":[12,192],"this":[13,62],"book":[14],"we":[15,28,45,156,164,236],"do":[16],"not":[17],"intend":[18],"to":[19,55,60,133,166,183,188,198,211,215],"present":[20],"a":[21,31,51,84,92,141,224],"great":[22],"variety":[23],"such":[25],"applications,":[26],"but":[27],"shall":[29],"study":[30],"small":[32],"group":[33],"problems":[35],"that":[36,145],"can":[37,157],"be":[38,131,199,212],"tackled":[39],"by":[40,65,72,252],"random":[41],"methods.":[43],"Suppose":[44],"given":[47,90],"n":[48,100,118,125,128,151,154,173,176],"objects":[49],"linear":[52,63],"order":[53,64,136],"unknown":[54],"us.":[56],"Our":[57],"task":[58],"is":[59,83,95,139],"determine":[61,134,159],"as":[66,69,74,77,230,245],"few":[67,75],"probes":[68,235],"possible,":[70],"i.e.":[71],"asking":[73],"questions":[76,106,129,155,181,196],"possible.":[78],"Each":[79],"probe":[80],"or":[81],"question":[82],"binary":[85],"comparison:":[86],"which":[87],"two":[89],"elements":[91],"and":[93,104,205,242],"b":[94],"greater?":[96],"Since":[97],"there":[98],"!":[101],"possible":[102],"orders":[103],"k":[105,110],"result":[107],"2":[109,116,127,153,175],"different":[111],"sequences":[112],"answers,":[114],"log":[115,126,152,174],"(":[117],"!)":[119],"=":[120],"{1":[121,147,169],"+":[122,148,170],"o":[123,149,171],"(1)}":[124,150,172],"may":[130],"needed":[132,251],"the":[135,160,186,189,216,220,228,231,243,246,253],"completely.":[137],"It":[138],"only":[140,168],"little":[142],"less":[143],"obvious":[144],"with":[146],"indeed":[158],"order.":[161],"However,":[162],"if":[163],"wish":[165],"use":[167],"questions,":[177],"then":[178],"our":[179,195],"later":[180],"have":[182,197,210],"depend":[184],"on":[185],"answers":[187,217],"earlier":[190],"questions.":[191],"other":[193],"words,":[194],"asked":[200],"many":[202],"rounds":[203,250],",":[204],"each":[207],"round":[208,241],"they":[209],"chosen":[213],"according":[214],"obtained":[218],"previous":[221],"rounds.":[222],"For":[223],"sorting":[225],"algorithm,":[226],"define":[227],"width":[229],"maximum":[232],"number":[233,248],"perform":[237],"any":[239],"one":[240],"depth":[244],"maximal":[247],"algorithm.":[254]},"counts_by_year":[],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2016-06-24T00:00:00"}