{"id":"https://openalex.org/W2066657708","doi":"https://doi.org/10.1080/0899340900010405","title":"Analysis of a Recursive Algorithm for Computing Binomial Coefficients","display_name":"Analysis of a Recursive Algorithm for Computing Binomial Coefficients","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2066657708","doi":"https://doi.org/10.1080/0899340900010405","mag":"2066657708"},"language":"en","primary_location":{"id":"doi:10.1080/0899340900010405","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0899340900010405","pdf_url":null,"source":{"id":"https://openalex.org/S97147119","display_name":"Computer Science Education","issn_l":"0899-3408","issn":["0899-3408","1744-5175"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science Education","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/A5108482599","display_name":"Patrick Costello","orcid":null},"institutions":[{"id":"https://openalex.org/I110325482","display_name":"Eastern Kentucky University","ror":"https://ror.org/012xks909","country_code":"US","type":"education","lineage":["https://openalex.org/I110325482"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Patrick Costello","raw_affiliation_strings":["Eastern Kentucky University"],"affiliations":[{"raw_affiliation_string":"Eastern Kentucky University","institution_ids":["https://openalex.org/I110325482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108482599"],"corresponding_institution_ids":["https://openalex.org/I110325482"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19684385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"4","first_page":"317","last_page":"329"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.5055999755859375,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T10533","display_name":"Teaching and Learning Programming","score":0.5055999755859375,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T11283","display_name":"Experimental Learning in Engineering","score":0.487199991941452,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8794510364532471},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.822060227394104},{"id":"https://openalex.org/keywords/binomial-coefficient","display_name":"Binomial coefficient","score":0.6388324499130249},{"id":"https://openalex.org/keywords/recursive-partitioning","display_name":"Recursive partitioning","score":0.6112133860588074},{"id":"https://openalex.org/keywords/binomial","display_name":"Binomial (polynomial)","score":0.5695896148681641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5087800621986389},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4217969477176666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3839559555053711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14648038148880005},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1383139193058014},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10749277472496033},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09910613298416138}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8794510364532471},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.822060227394104},{"id":"https://openalex.org/C34718186","wikidata":"https://www.wikidata.org/wiki/Q209875","display_name":"Binomial coefficient","level":2,"score":0.6388324499130249},{"id":"https://openalex.org/C137345334","wikidata":"https://www.wikidata.org/wiki/Q7303350","display_name":"Recursive partitioning","level":2,"score":0.6112133860588074},{"id":"https://openalex.org/C2781315470","wikidata":"https://www.wikidata.org/wiki/Q193623","display_name":"Binomial (polynomial)","level":2,"score":0.5695896148681641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5087800621986389},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4217969477176666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3839559555053711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14648038148880005},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1383139193058014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10749277472496033},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09910613298416138}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0899340900010405","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0899340900010405","pdf_url":null,"source":{"id":"https://openalex.org/S97147119","display_name":"Computer Science Education","issn_l":"0899-3408","issn":["0899-3408","1744-5175"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science Education","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":7,"referenced_works":["https://openalex.org/W1545078296","https://openalex.org/W1584026429","https://openalex.org/W2023647809","https://openalex.org/W2113567385","https://openalex.org/W2317708954","https://openalex.org/W2798686102","https://openalex.org/W4247744300"],"related_works":["https://openalex.org/W2018157348","https://openalex.org/W1572536327","https://openalex.org/W1619654942","https://openalex.org/W2266792609","https://openalex.org/W3214798365","https://openalex.org/W4212980217","https://openalex.org/W4387298493","https://openalex.org/W4225635267","https://openalex.org/W278612959","https://openalex.org/W4298012906"],"abstract_inverted_index":{"While":[0],"recursion":[1],"is":[2],"a":[3,25,32],"useful":[4],"programming":[5],"technique,":[6],"there":[7],"are":[8],"times":[9],"when":[10],"it":[11],"can":[12],"be":[13],"very":[14],"expensive":[15],"in":[16,24],"terms":[17],"of":[18,31],"execution.":[19],"This":[20],"idea":[21],"was":[22],"demonstrated":[23],"classroom":[26],"exercise":[27],"involving":[28],"an":[29],"analysis":[30],"particular":[33],"recursive":[34],"algorithm":[35],"for":[36],"computing":[37],"binomial":[38],"coefficients.":[39]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-01-22T23:29:09.771500","created_date":"2025-10-10T00:00:00"}