Ovidiu Daescu, Hemant Malik. k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. In Ilias Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas, editors, Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers. Volume 11544 of Lecture Notes in Computer Science, pages 454-472, Springer, 2019. [doi]
@inproceedings{DaescuM19,
title = {k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler},
author = {Ovidiu Daescu and Hemant Malik},
year = {2019},
doi = {10.1007/978-3-030-34029-2_29},
url = {https://doi.org/10.1007/978-3-030-34029-2_29},
researchr = {https://researchr.org/publication/DaescuM19},
cites = {0},
citedby = {0},
pages = {454-472},
booktitle = {Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
editor = {Ilias Kotsireas and Panos M. Pardalos and Konstantinos E. Parsopoulos and Dimitris Souravlias and Arsenis Tsokas},
volume = {11544},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-34029-2},
}