{"id":"https://openalex.org/W2146103868","doi":"https://doi.org/10.1109/ispan.2004.1300488","title":"Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem","display_name":"Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2146103868","doi":"https://doi.org/10.1109/ispan.2004.1300488","mag":"2146103868"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2004.1300488","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2004.1300488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","raw_type":"proceedings-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/A5005927883","display_name":"Sung Eun Bae","orcid":"https://orcid.org/0000-0001-7670-8214"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Sung Eun Bae","raw_affiliation_strings":["Department of Computer Science, University of Canterbury, Christchurch, New Zealand","Dept. of Comput. Sci. Canterbury Univ., Christchurch, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"Dept. of Comput. Sci. Canterbury Univ., Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109861849","display_name":"Tadao Takaoka","orcid":null},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Tadao Takaoka","raw_affiliation_strings":["Department of Computer Science, University of Canterbury, Christchurch, New Zealand","Dept. of Comput. Sci. Canterbury Univ., Christchurch, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"Dept. of Comput. Sci. Canterbury Univ., Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005927883"],"corresponding_institution_ids":["https://openalex.org/I185492890"],"apc_list":null,"apc_paid":null,"fwci":9.1766,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.97917509,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"247","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.8407652378082275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7009391784667969},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.46825727820396423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4422786831855774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42779073119163513},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4167579412460327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3619226813316345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.342939555644989}],"concepts":[{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.8407652378082275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7009391784667969},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.46825727820396423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4422786831855774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42779073119163513},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4167579412460327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3619226813316345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.342939555644989},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispan.2004.1300488","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2004.1300488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1967688945","https://openalex.org/W1970998199","https://openalex.org/W2008252807","https://openalex.org/W2060164640","https://openalex.org/W2078948975","https://openalex.org/W2080598751","https://openalex.org/W2092348372","https://openalex.org/W2101506819","https://openalex.org/W2119257015","https://openalex.org/W2120926795","https://openalex.org/W2141389982","https://openalex.org/W6652121276","https://openalex.org/W6680874277"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4283025278","https://openalex.org/W61292821","https://openalex.org/W2082432309","https://openalex.org/W817174743","https://openalex.org/W2050492524","https://openalex.org/W4236317272","https://openalex.org/W4252515496","https://openalex.org/W2121535159","https://openalex.org/W2101467546"],"abstract_inverted_index":{"Given":[0],"an":[1,17,36],"array":[2],"of":[3,12,82,90],"positive":[4],"and":[5,78],"negative":[6],"values,":[7],"we":[8,65],"consider":[9],"the":[10,27,42,53,91],"problem":[11,57],"K":[13,43,54,69],"maximum":[14,28,44,55,70],"sums.":[15],"When":[16],"overlapping":[18],"property":[19],"needs":[20],"to":[21,51],"be":[22],"observed,":[23],"previous":[24],"algorithms":[25],"for":[26,41],"sum":[29],"are":[30],"not":[31],"directly":[32],"applicable.":[33],"We":[34],"designed":[35],"O(K":[37,59,74],"*":[38,60,75],"n)":[39,76],"algorithm":[40,72],"subsequences":[45],"problem.":[46],"This":[47],"was":[48],"then":[49],"modified":[50],"solve":[52],"subarrays":[56,71],"in":[58,88],"n/sup":[61],"3/)":[62],"time.":[63],"Finally,":[64],"present":[66],"a":[67,79],"VLSI":[68],"with":[73],"steps":[77],"circuit":[80],"size":[81],"O(n/sup":[83],"2/),":[84],"which":[85],"is":[86],"cost-optimal":[87],"parallelisation":[89],"sequential":[92],"algorithm.":[93]},"counts_by_year":[{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}