"k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler."

Ovidiu Daescu, Hemant Malik (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-34029-2_29

access: closed

type: Conference or Workshop Paper

metadata version: 2019-11-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sea2/DaescuM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sea2/DaescuM19
Ovidiu Daescu, Hemant Malik:
k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. SEA² 2019: 454-472

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.