{"id":"https://openalex.org/W2116808107","doi":null,"title":"Selecting the Right Algorithm","display_name":"Selecting the Right Algorithm","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2116808107","mag":"2116808107"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.8363","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~mgl/papers/aaaifs01.ps.gz","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5084693234","display_name":"Michail G. Lagoudakis","orcid":"https://orcid.org/0000-0003-2803-3755","observed_orcids":["https://orcid.org/0000-0003-2803-3755"]},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michail G. Lagoudakis","raw_affiliation_strings":["Duke University"],"raw_orcid":"https://orcid.org/0000-0003-2803-3755","affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009722403","display_name":"Michael L. Littman","orcid":"https://orcid.org/0000-0002-5596-1840","observed_orcids":["https://orcid.org/0000-0002-5596-1840"]},"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":"Michael L. Littman","raw_affiliation_strings":["At&T#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5596-1840","affiliations":[{"raw_affiliation_string":"At&T#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109839104","display_name":"Ronald Parr","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronald Parr","raw_affiliation_strings":["Duke University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8836,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.7187017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.48899999260902405,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.48899999260902405,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.32910001277923584,"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/T12288","display_name":"Optimization and Search Problems","score":0.05559999868273735,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm-selection","display_name":"algorithm selection","score":0.9990000128746033},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.5770000219345093},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.8690000176429749},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.48500001430511475},{"id":"https://openalex.org/keywords/computational-problem-solving","display_name":"computational problem solving","score":0.4950000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7664570808410645},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6330866813659668},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.6238053441047668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5590291023254395},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.47610339522361755},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.38089433312416077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32357776165008545},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14501503109931946}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.8363","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~mgl/papers/aaaifs01.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.540.3293","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.540.3293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://staff.unak.is/not/andy/algorithms0910/assignment/selectingtherightalgorithmpaper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.561.5273","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.561.5273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/Symposia/Fall/2001/FS-01-04/FS01-04-011.pdf","raw_type":"text"},{"id":"mag:2116808107","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/Symposia/Fall/2001/FS-01-04/FS01-04-011.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1492936035","https://openalex.org/W1495775210","https://openalex.org/W2029229881","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W3038265370","https://openalex.org/W1570754865","https://openalex.org/W2273828870","https://openalex.org/W2501093437","https://openalex.org/W7098385596","https://openalex.org/W2140519248","https://openalex.org/W4235585935","https://openalex.org/W1496062094","https://openalex.org/W75193410","https://openalex.org/W3043367021"],"abstract_inverted_index":{"Computer":[0],"scientists":[1],"always":[2],"strive":[3],"to":[4,31,85,109],"find":[5],"better":[6],"and":[7,46,103],"faster":[8],"algorithms":[9,28,41],"for":[10,100],"any":[11],"computational":[12],"problem.":[13],"It":[14],"is":[15,50,58,82],"usually":[16],"true":[17,99],"that":[18,52,69],"programmers":[19],"and/or":[20],"users":[21],"come":[22],"across":[23],"a":[24,33,53],"plethora":[25],"of":[26,39,56,95,115],"dif-ferent":[27],"when":[29],"looking":[30],"solve":[32],"particular":[34],"problem":[35],"efficiently.":[36],"Each":[37],"one":[38,55],"these":[40],"might":[42],"offer":[43],"differ-ent":[44],"guarantees":[45],"properties,":[47],"but":[48],"it":[49],"unlikely":[51],"sin-gle":[54],"them":[57],"the":[59,67,70,86,89,92,96,104,122,130],"best":[60],"(fastest)":[61],"in":[62,88,111],"all":[63],"possible":[64],"cases.":[65],"So,":[66],"question":[68,81],"programmer/user":[71],"typically":[72],"faces":[73],"is:":[74],"\"Which":[75],"algorithm":[76,97],"should":[77],"I":[78],"select?\"":[79],"This":[80],"largely":[83],"due":[84],"uncertainty":[87],"input":[90],"space,":[91],"inner":[93],"workings":[94],"(especially":[98],"randomized":[101],"algorithms),":[102],"hardware":[105,132],"characteris-tics.":[106],"It\u2019s":[107],"hard":[108],"know":[110],"advance":[112],"what":[113],"kind":[114],"inputs":[116],"will":[117,124,133],"be":[118],"provided,":[119],"how":[120,128],"exactly":[121],"computation":[123],"proceed,":[125],"or":[126],"even":[127],"efficiently":[129],"underlying":[131],"support":[134]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}