{"id":"https://openalex.org/W2152360514","doi":"https://doi.org/10.1017/s0956796800000368","title":"Functional Pearls <i>Two greedy algorithms</i>","display_name":"Functional Pearls <i>Two greedy algorithms</i>","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W2152360514","doi":"https://doi.org/10.1017/s0956796800000368","mag":"2152360514"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800000368","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000368","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E55EFDCCB071BBE9FFE0F6543C1BCBA1/S0956796800000368a.pdf/div-class-title-functional-pearls-span-class-italic-two-greedy-algorithms-span-div.pdf","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":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E55EFDCCB071BBE9FFE0F6543C1BCBA1/S0956796800000368a.pdf/div-class-title-functional-pearls-span-class-italic-two-greedy-algorithms-span-div.pdf","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/I2802123492","display_name":"Oxford Research Group","ror":"https://ror.org/00z4w4f29","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I2802123492"]},{"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":true,"raw_author_name":"R.S. Bird","raw_affiliation_strings":["Programming Research Group, Oxford University, 11 Keble Rd, Oxford OX1 3QD, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Programming Research Group, Oxford University, 11 Keble Rd, Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068829812"],"corresponding_institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.4802,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67289272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"2","first_page":"237","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9948999881744385,"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/T11567","display_name":"semigroups and automata theory","score":0.9948999881744385,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9932000041007996,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9789999723434448,"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.7777012586593628},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6103360056877136},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.569998025894165},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5678682923316956},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5543458461761475},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5512663722038269},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5464332699775696},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4372696280479431},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3367379903793335},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16173163056373596}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7777012586593628},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6103360056877136},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.569998025894165},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5678682923316956},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5543458461761475},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5512663722038269},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5464332699775696},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4372696280479431},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3367379903793335},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16173163056373596},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796800000368","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000368","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E55EFDCCB071BBE9FFE0F6543C1BCBA1/S0956796800000368a.pdf/div-class-title-functional-pearls-span-class-italic-two-greedy-algorithms-span-div.pdf","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":{"id":"doi:10.1017/s0956796800000368","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000368","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E55EFDCCB071BBE9FFE0F6543C1BCBA1/S0956796800000368a.pdf/div-class-title-functional-pearls-span-class-italic-two-greedy-algorithms-span-div.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2152360514.pdf","grobid_xml":"https://content.openalex.org/works/W2152360514.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W1507693023","https://openalex.org/W2318815169","https://openalex.org/W2479770571"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2366107444"],"abstract_inverted_index":{"At":[0],"the":[1,15,31,51,77,109,132,140,143,150],"recent":[2],"TC2":[3],"working":[4],"conference":[5,52],"on":[6],"constructing":[7],"programs":[8],"from":[9],"specifications":[10],"(Moeller,":[11],"1991),":[12],"I":[13,104],"presented":[14],"derivation":[16],"of":[17,45,83,116,126,142],"a":[18,23,36,41,56,63,86,117],"functional":[19],"program":[20],"for":[21],"solving":[22],"problem":[24,32,65,78],"posed":[25],"by":[26,88,148],"Knuth":[27],"(1990).":[28],"Slightly":[29],"simplified,":[30],"was":[33,79],"to":[34,80,99,130,135,138],"construct":[35],"shortest":[37],"decimal":[38],"fraction":[39],"representing":[40],"given":[42],"integer":[43],"multiple":[44],"1/2":[46],"16":[47],".":[48],"Later":[49],"in":[50,55,85,102],"\u2013":[53,59],"and":[54,95,113,137],"different":[57],"context":[58],"Robert":[60],"Dewar":[61],"described":[62],"second":[64],"that":[66,106],"he":[67],"had":[68,108],"recently":[69],"set":[70],"as":[71],"an":[72],"examination":[73],"question.":[74],"In":[75],"brief,":[76],"replace":[81],"sequences":[82],"blanks":[84],"file":[87],"tab":[89],"characters":[90],"wherever":[91],"possible.":[92],"Although":[93],"Knuth's":[94],"Dewar's":[96],"problems":[97,151],"appear":[98],"have":[100],"little":[101],"common,":[103],"suspected":[105],"both":[107],"same":[110],"\u2018deep":[111],"structure\u2019":[112],"were":[114],"instances":[115],"single":[118],"general":[119],"result":[120,134],"about":[121],"greedy":[122],"algorithms.":[123],"The":[124],"purpose":[125],"this":[127],"note":[128],"is":[129],"bring":[131],"genral":[133],"light":[136],"unify":[139],"treatment":[141],"two":[144],"problems.":[145],"We":[146],"begin":[147],"describing":[149],"more":[152],"precisely.":[153]},"counts_by_year":[],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2025-10-10T00:00:00"}