{"id":"https://openalex.org/W4388684232","doi":"https://doi.org/10.3390/a16110519","title":"Two Kadane Algorithms for the Maximum Sum Subarray Problem","display_name":"Two Kadane Algorithms for the Maximum Sum Subarray Problem","publication_year":2023,"publication_date":"2023-11-14","ids":{"openalex":"https://openalex.org/W4388684232","doi":"https://doi.org/10.3390/a16110519"},"language":"en","primary_location":{"id":"doi:10.3390/a16110519","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16110519","pdf_url":"https://www.mdpi.com/1999-4893/16/11/519/pdf?version=1699934951","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/11/519/pdf?version=1699934951","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017971040","display_name":"Joseph B. Kadane","orcid":"https://orcid.org/0000-0003-1548-5912"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph B. Kadane","raw_affiliation_strings":["Department of Statistics and Data Science, Dietrich College of Humanities and Social Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA","Department of Statistics and Data Science, Dietrich College of Humanities and Social Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Data Science, Dietrich College of Humanities and Social Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Statistics and Data Science, Dietrich College of Humanities and Social Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA;","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017971040"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2003,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52354178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"11","first_page":"519","last_page":"519"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.978600025177002,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.978600025177002,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9524000287055969,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.949400007724762,"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/algorithm","display_name":"Algorithm","score":0.7726633548736572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5877721309661865}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7726633548736572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5877721309661865}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a16110519","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16110519","pdf_url":"https://www.mdpi.com/1999-4893/16/11/519/pdf?version=1699934951","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a9774ea4c64745a4bf78f6c82a7fc372","is_oa":true,"landing_page_url":"https://doaj.org/article/a9774ea4c64745a4bf78f6c82a7fc372","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 11, p 519 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a16110519","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16110519","pdf_url":"https://www.mdpi.com/1999-4893/16/11/519/pdf?version=1699934951","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388684232.pdf"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2023132255","https://openalex.org/W2047468027","https://openalex.org/W2060164640","https://openalex.org/W2127470768","https://openalex.org/W2529308621","https://openalex.org/W2533860909","https://openalex.org/W2738444317","https://openalex.org/W2950122868"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"The":[0,15,58,92],"maximum":[1],"sum":[2],"subarray":[3,10],"problem":[4,22],"is":[5,23,28,36,62,121],"to":[6,19,67,71,128],"find":[7],"a":[8,81,88],"contiguous":[9],"with":[11],"the":[12,38,43,68,104,117,125],"largest":[13],"sum.":[14],"history":[16],"of":[17,53,84,106,110],"algorithms":[18,100],"address":[20],"this":[21],"recounted,":[24],"culminating":[25],"in":[26,77,103],"what":[27],"known":[29,45],"as":[30,46],"Kadane\u2019s":[31,47],"algorithm.":[32],"However,":[33],"that":[34,97,115],"algorithm":[35,39,44,59,69,118,126],"not":[37],"Kadane":[40,60,119],"intended.":[41],"Nonetheless,":[42],"has":[48],"found":[49],"many":[50],"uses,":[51],"some":[52],"which":[54],"are":[55,74],"recounted":[56],"here.":[57],"intended":[61,120],"reported":[63],"here,":[64],"and":[65,86],"compared":[66],"attributed":[70,127],"Kadane.":[72],"They":[73],"both":[75],"linear":[76],"time,":[78],"employ":[79],"just":[80],"few":[82],"words":[83],"memory,":[85],"use":[87],"dynamic":[89],"programming":[90],"structure.":[91],"results":[93],"proved":[94],"here":[95],"show":[96],"these":[98],"two":[99],"differ":[101],"only":[102,111],"case":[105],"an":[107],"input":[108],"consisting":[109],"negative":[112],"numbers.":[113],"In":[114],"case,":[116],"more":[122],"informative":[123],"than":[124],"him.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-02-28T09:26:25.869077","created_date":"2025-10-10T00:00:00"}