Space-e cient planar convex hull algorithms Page 1 Theoretical Computer Science 321 (2004)
25–40 www.elsevier.com/locate/tcs Space-e cient planar convex hull algorithms HervÃe Br …

Two linear-time algorithms for in-place/merging are presented. Both algorithms perform at
most m (t+ 1)+ n/2 t+ o (m) comparisons, where m and n are the sizes of the input …

Accepted: 10/Dec/2019, Online: 31/Dec/2019 Abstract—Systems analysts, designers, and
programmers normally choose among candidate algorithms to develop applications. This …

We introduce new stable natural merge sort algorithms, called 2-merge sort and α-merge
sort. We prove upper and lower bounds for several merge sort algorithms, including Timsort …

We consider the problem of drawing a set of simple paths along the edges of an embedded
underlying graph G=(V, E), so that the total number of crossings among pairs of paths is …

We investigate the problem of stable in-place merging from a ratio k=nm based point of view
where m, n are the sizes of the input sequences with m≤ n. We introduce a novel algorithm …

In 2000, Geffert et al.(Theoret. Comput. Sci. 237 (2000) 159) presented an asymptotically
efficient algorithm for stable merging in constant extra space. The algorithm requires at most …

We introduce a new stable minimum storage algorithm for merging that needs
O(m\log(nm+1)) element comparisons, where m and n are the sizes of the input sequences …

We present a very simple algorithm for the Level Ancestor Problem. A Level Ancestor Query
LA (v, d) requests the depth d ancestor of node v. The Level Ancestor Problem is thus …

We introduce a novel approach to the classical problem of the in situ, stable merging of lists,
where 'in situ'means the use of no more than O(\log^2n) bits of extra memory for lists of size …