Home › Entities › master_s_thesis › Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem

Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem

2011 master's thesis by Sang Myung Lee at University of Canterbury
Place master_s_thesis Q112886897
Press Enter · cited answer in seconds

Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem

Summary

Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem is a master's thesis[1].

Key Facts

  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's instance of is recorded as master's thesis[2].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem was published by UC Research Repository[3].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's language of work or name is recorded as English[4].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's country of origin is recorded as New Zealand[5].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem was released on 2011[6].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's main subject is maximum subarray problem[7].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's work available at URL is recorded as https://ir.canterbury.ac.nz/handle/10092/6494[8].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's title is recorded as Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem[9].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's author name string is recorded as Sang Myung Lee[10].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's thesis submitted to is recorded as University of Canterbury[11].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's on focus list of Wikimedia project is recorded as NZThesisProject[12].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's copyright status is recorded as copyrighted[13].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's online access status is recorded as open access[14].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's thesis committee member is recorded as Tadao Takaoka[15].
  • Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's thesis submitted for degree is recorded as Master of Science[16].

Body

Designation and Status

Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem's instance of is recorded as master's thesis[2].

References

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

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . wikidata.org.
  15. [16] ↑ . 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). Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem. Retrieved May 3, 2026, from https://4ort.xyz/entity/sub-cubic-time-algorithm-for-the-k-disjoint-maximum-subarray-problem
MLA “Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/sub-cubic-time-algorithm-for-the-k-disjoint-maximum-subarray-problem.
BibTeX @misc{4ortxyz_sub-cubic-time-algorithm-for-the-k-disjoint-maximum-subarray-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem}}, year = {2026}, url = {https://4ort.xyz/entity/sub-cubic-time-algorithm-for-the-k-disjoint-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): Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem — https://4ort.xyz/entity/sub-cubic-time-algorithm-for-the-k-disjoint-maximum-subarray-problem (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/sub-cubic-time-algorithm-for-the-k-disjoint-maximum-subarray-problem · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 4d ago · DrThneed · 2026-09-06 view diff on Wikidata ↗
    Thesis submitted for degree → Master of Science
    Author name string → Sang Myung Lee
    Thesis submitted to → University of Canterbury
    Handle id → 10092/6494
    + 15 other properties edited (see Wikidata diff for full list)
    "/* wbeditentity-update:0| */ QuickStatements 3.0 [[:toollabs:qs-dev/batch/52330|batch #52330]]: Canterbury"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.