The Maximum Subarray Problem is a computational problem in algorithm design that, within the class of optimization problems on sequences, specifically entails finding a contiguous subarray of a given one-dimensional array of numbers whose elements yield the maximum sum among all possible contiguous subarrays.
15
Publications
1.6K
Citations
27
Authors
18
Institutions
Publications per year
2017–2026
1
Parents
Publications
15
Learning To Count Objects in Images
Victor Lempitsky, Andrew Zisserman · 2010 · 982 citations
Notes on searching in multidimensional monotone arrays
Alok Aggarwal, J. Park · 1988 · 142 citations
1–5 of 15
Authors
27
- SE
3
h-index
- TT
2
h-index
- ND
2
h-index
- CT
2
h-index
- AB
2
h-index
1–5 of 27
Institutions
18
University of Canterbury
Christchurch, New Zealand
3 h-index
4 publications
195 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
181 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
34 citations
Universidade de São Paulo
São Paulo, Brazil
1 h-index
1 publications
12 citations
University of Central Florida
Orlando, United States
1 h-index
1 publications
34 citations
Meiji University
Tokyo, Japan
1 h-index
1 publications
55 citations
Agency for Science, Technology and Research
Singapore, Singapore
1 h-index
2 publications
28 citations
Universidade Federal do ABC
Santo André, Brazil
1 h-index
2 publications
24 citations
1–8 of 18
Venues
- arXiv (Cornell University)
Repository · 2 publications · 35 citations
2
h-index
- Parallel Processing Letters
1 publications · 34 citations
1
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 1 publications · 78 citations
1
h-index
- Journal of Construction Engineering and Management
1 publications · 74 citations
1
h-index
- ACM Transactions on Algorithms
TALG · 1 publications · 18 citations
1
h-index
1–5