Home › Entities › doctoral_thesis › Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem

Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem

2007 doctoral thesis by Sung Eun Bae at University of Canterbury
Place doctoral_thesis Q112869744
Press Enter · cited answer in seconds

Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem

Summary

Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem is a doctoral thesis[1].

Key Facts

  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem authored Sung Eun Bae[2].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's instance of is recorded as doctoral thesis[3].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's publisher is recorded as UC Research Repository[4].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's DOI is recorded as 10.26021/1644[5].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's language of work or name is recorded as English[6].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's country of origin is recorded as New Zealand[7].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's publication date is recorded as +2007-00-00T00:00:00Z[8].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's main subject is recorded as computer vision[9].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's main subject is recorded as algorithm[10].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's main subject is recorded as data structure[11].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's work available at URL is recorded as https://ir.canterbury.ac.nz/handle/10092/1202[12].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's Handle ID is recorded as 10092/1202[13].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's title is recorded as Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem[14].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's copyright holder is recorded as Sung Eun Bae[15].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's thesis submitted to is recorded as University of Canterbury[16].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's on focus list of Wikimedia project is recorded as NZThesisProject[17].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's copyright status is recorded as copyrighted[18].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's online access status is recorded as open access[19].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's thesis committee member is recorded as Tadao Takaoka[20].
  • Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's thesis committee member is recorded as R Mukundan[21].

Body

Designation and Status

Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem's instance of is recorded as doctoral thesis[3].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . wikidata.org.
  2. [2] ↑ . hdl.handle.net. hdl.handle.net. Provenance: wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . hdl.handle.net. hdl.handle.net. Provenance: wikidata.org.
  9. [10] ↑ . hdl.handle.net. hdl.handle.net. Provenance: wikidata.org.
  10. [11] ↑ . hdl.handle.net. hdl.handle.net. Provenance: wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . wikidata.org.
  15. [16] ↑ . wikidata.org.
  16. [17] ↑ . wikidata.org.
  17. [18] ↑ . wikidata.org.
  18. [19] ↑ . wikidata.org.
  19. [20] ↑ . wikidata.org.
  20. [21] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem. Retrieved May 3, 2026, from https://4ort.xyz/entity/sequential-and-parallel-algorithms-for-the-generalized-maximum-subarray-problem
MLA “Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/sequential-and-parallel-algorithms-for-the-generalized-maximum-subarray-problem.
BibTeX @misc{4ortxyz_sequential-and-parallel-algorithms-for-the-generalized-maximum-subarray-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem}}, year = {2026}, url = {https://4ort.xyz/entity/sequential-and-parallel-algorithms-for-the-generalized-maximum-subarray-problem}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem — https://4ort.xyz/entity/sequential-and-parallel-algorithms-for-the-generalized-maximum-subarray-problem (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/sequential-and-parallel-algorithms-for-the-generalized-maximum-subarray-problem · Last refreshed: