A maximal local maximum-sum segment data structure

Research output: Contribution to journalArticlepeer-review

Abstract

A linear-time constructible data structure for a real number sequence supporting O(1)-time queries of the maximal local maximumsum segment of any contiguous subsequence containing any specific position is proposed, where a local maximum-sum segment is a segment whose maximum-sum segment is itself.

Original languageEnglish
Pages (from-to)1541-1542
Number of pages2
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE101A
Issue number9
DOIs
Publication statusPublished - 2018 Sep

Keywords

  • Algorithms
  • Maximum-sum segment
  • Sequence of real numbers

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A maximal local maximum-sum segment data structure'. Together they form a unique fingerprint.

Cite this