{"id":"https://openalex.org/W3214606129","doi":"https://doi.org/10.1017/s0956796821000198","title":"A greedy algorithm for dropping digits","display_name":"A greedy algorithm for dropping digits","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3214606129","doi":"https://doi.org/10.1017/s0956796821000198","mag":"3214606129"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796821000198","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796821000198","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","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/A5068829812","display_name":"Richard Bird","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"RICHARD BIRD","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford OX1\u00a03QD, UK (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-3901-742X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford OX1\u00a03QD, UK (e-mail:","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002724938","display_name":"Shin-Cheng Mu","orcid":"https://orcid.org/0000-0002-4755-601X"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"SHIN-CHENG MU","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taipei, Taiwan (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-4755-601X","affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taipei, Taiwan (e-mail:","institution_ids":["https://openalex.org/I4210098366"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1522,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55086346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9973000288009644,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9973000288009644,"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.9966999888420105,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9836999773979187,"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/computer-science","display_name":"Computer science","score":0.7579537630081177},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7305631041526794},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6589627265930176},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6384444236755371},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5776984691619873},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5552119612693787},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.44480428099632263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24931105971336365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24463605880737305},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17015892267227173}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7579537630081177},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7305631041526794},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6589627265930176},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6384444236755371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5776984691619873},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5552119612693787},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.44480428099632263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24931105971336365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24463605880737305},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17015892267227173},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796821000198","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796821000198","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1571615440","https://openalex.org/W1982209843","https://openalex.org/W2028692319","https://openalex.org/W2090596673","https://openalex.org/W2125690626","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W4250204379"],"related_works":["https://openalex.org/W2954167023","https://openalex.org/W2064351239","https://openalex.org/W2949665548","https://openalex.org/W2114983089","https://openalex.org/W2277088917","https://openalex.org/W4280543056","https://openalex.org/W2950188642","https://openalex.org/W2154172459","https://openalex.org/W2809828719","https://openalex.org/W2541760731"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"the":[2,13,31,35,49,60,66],"following":[3],"puzzle:":[4,32],"given":[5],"a":[6,27,38,45,53],"number,":[7],"remove":[8],"k":[9],"digits":[10],"such":[11],"that":[12],"resulting":[14],"number":[15],"is":[16],"as":[17,19,63,65],"large":[18],"possible.":[20],"Various":[21],"techniques":[22],"are":[23],"employed":[24],"to":[25,30],"derive":[26],"linear-time":[28,68],"solution":[29],"we":[33],"justify":[34],"structure":[36],"of":[37,48],"greedy":[39,50,61],"algorithm":[40],"by":[41,70],"predicate":[42],"logic,":[43],"give":[44],"constructive":[46],"proof":[47,56],"condition":[51],"using":[52],"dependently":[54],"typed":[55],"assistant":[57],"and":[58],"calculate":[59],"step":[62],"well":[64],"final,":[67],"optimisation":[69],"equational":[71],"reasoning.":[72]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-11-22T00:00:00"}