"k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler."

Hemant Malik, Ovidiu Daescu (2018)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics