@InProceedings{sakai:LIPIcs.CPM.2024.26,
author = {Sakai, Yoshifumi},
title = {{A Data Structure for the Maximum-Sum Segment Problem with Offsets}},
booktitle = {35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-326-3},
ISSN = {1868-8969},
year = {2024},
volume = {296},
editor = {Inenaga, Shunsuke and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.26},
URN = {urn:nbn:de:0030-drops-201361},
doi = {10.4230/LIPIcs.CPM.2024.26},
annote = {Keywords: algorithms, sequence of real numbers, maximum-sum segment}
}