{"id":"https://openalex.org/W1983840635","doi":"https://doi.org/10.1145/2444016.2493373","title":"Optimal selection and sorting via dynamic programming","display_name":"Optimal selection and sorting via dynamic programming","publication_year":2013,"publication_date":"2013-08-15","ids":{"openalex":"https://openalex.org/W1983840635","doi":"https://doi.org/10.1145/2444016.2493373","mag":"1983840635"},"language":"en","primary_location":{"id":"doi:10.1145/2444016.2493373","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2444016.2493373","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-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/A5045598051","display_name":"Micha Hofri","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Micha Hofri","raw_affiliation_strings":["Worcester Polytechnic Institute, Worcester, MA","Worcester Polytechnic Institute, Worcester MA"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute, Worcester, MA","institution_ids":["https://openalex.org/I107077323"]},{"raw_affiliation_string":"Worcester Polytechnic Institute, Worcester MA","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045598051"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.2722,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5705022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9945999979972839,"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/T11106","display_name":"Data Management and Algorithms","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/sorting","display_name":"Sorting","score":0.7262377738952637},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6847257614135742},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6422606706619263},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5889570116996765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5590718984603882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5442498326301575},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.504379391670227},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4858638644218445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3880979120731354},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.37853673100471497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3779129981994629},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09643599390983582},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09468379616737366}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7262377738952637},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6847257614135742},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6422606706619263},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5889570116996765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5590718984603882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5442498326301575},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.504379391670227},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4858638644218445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3880979120731354},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.37853673100471497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3779129981994629},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09643599390983582},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09468379616737366},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2444016.2493373","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2444016.2493373","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7699999809265137,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W578719842","https://openalex.org/W1508188236","https://openalex.org/W1567057207","https://openalex.org/W1963562197","https://openalex.org/W1964316154","https://openalex.org/W1977004736","https://openalex.org/W1988175734","https://openalex.org/W2034369917","https://openalex.org/W2060426509","https://openalex.org/W2109294083","https://openalex.org/W2341171179","https://openalex.org/W4212799367"],"related_works":["https://openalex.org/W2156021013","https://openalex.org/W2161367706","https://openalex.org/W1994682696","https://openalex.org/W2096989594","https://openalex.org/W2002454365","https://openalex.org/W2133764300","https://openalex.org/W283149859","https://openalex.org/W1973492905","https://openalex.org/W3198596521","https://openalex.org/W3013781205"],"abstract_inverted_index":{"We":[0],"show":[1],"how":[2],"to":[3],"find":[4],"optimal":[5,61,74],"algorithms":[6,80],"for":[7,42,78],"the":[8,33,45,52,56,60,79,89,92],"selection":[9],"of":[10,20,36],"one":[11],"or":[12,50],"more":[13],"order":[14],"statistics":[15],"over":[16],"a":[17,84],"small":[18],"set":[19],"numbers,":[21],"and":[22,88],"as":[23,95],"an":[24],"extreme":[25],"case,":[26],"complete":[27],"sorting.":[28],"The":[29,76],"criterion":[30],"is":[31,81],"using":[32],"smallest":[34],"number":[35],"comparisons;":[37],"separate":[38],"derivations":[39],"are":[40],"performed":[41],"minimization":[43],"on":[44],"average":[46],"(over":[47],"all":[48],"permutations)":[49],"in":[51],"worst":[53],"case.":[54],"When":[55],"computational":[57],"process":[58],"establishes":[59],"values,":[62],"it":[63],"also":[64],"generates":[65],"C-language":[66],"functions":[67],"that":[68],"implement":[69],"policies":[70],"which":[71],"achieve":[72],"those":[73],"values.":[75],"search":[77],"driven":[82],"by":[83],"Markov":[85],"decision":[86],"process,":[87],"program":[90],"provides":[91],"optimality":[93],"proof":[94],"well.":[96]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}