#### Filter Results:

#### Publication Year

2001

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We introduce a new stable minimum storage algorithm for merging that needs O(m log(n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. According to the lower bound for merging, our algorithm is asymptotically optimal regarding the number of comparisons. The presented algorithm rearranges the elements to be merged by… (More)

We introduce a new stable in place merging algorithm that needs O(m log(n m +1)) comparisons and O(m+n) assignments. According to the lower bounds for merging our algorithm is asymptotically optimal regarding the number of comparisons as well as assignments. The stable algorithm is developed in a modular style out of an unstable kernel for which we give a… (More)

We define a language RS, a subclass of the scheduling language RSV (resource constrained project scheduling with variant processes). RS involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In RS ground activities and two structural… (More)

We investigate the problem of stable in-place merging from a ratio k = n m based point of view where m, n are the sizes of the input sequences with m ≤ n. We introduce a novel algorithm for this problem that is asymptotically optimal regarding the number of assignments as well as comparisons. Our algorithm uses knowledge about the ratio of the input sizes… (More)

We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply struc-tured compared to its competitors. The presented algorithm performs O(m log(n m + 1)) comparisons and O((m + n) log m) assignments, where m and n are the sizes of the input sequences with m ≤ n. Hence, according to the lower bounds… (More)

- Pok-Son Kim
- 2005

- ‹
- 1
- ›