Add to ORKGAbstract: Recurrence relations with minimization and maxi-mization, called minmax recurrence relations are commonly en-countered in the analysis of algorithms. In this paper we present the solution of one such challenging recurrence relation. We characterize the optimal partition sizes as well as derive the order of complexity of the overall recurrence relation. It is proved that ad hoc equal partitioning is never the optimal choice. We also provide a survey of three other interesting minmax recurrence relations found in the literature. 1
We present a new master theorem for the study of divide-and-conquer recursive definitions, which imp...
Given an associative system in which each word is assigned a cost and in which an equivalence relati...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
[[abstract]]Let M(n) be defined by the recurrence M(n) = max (M(k) + M(n - k) + min(f(k), f(n - k)))...
AbstractWe derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min1⩽j...
We consider the problem of developing automated techniques for solving recurrence relations to aid t...
AbstractGiven a positive integer M, and a set S = {x1, x2, …, xn} of positive integers, the maximum ...
Projet EURECABounds are obtained for the solution to the divide-and-conquer recurrence M (n) = F(max...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
AbstractThis paper explores the performance of a family of algorithms for computing the Walsh–Hadama...
[[abstract]]In this note we find the exact solution for the minimal recurrence S-n = min(k=1)([n/2])...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
AbstractAttaching a cost function to integers appearing in partitions of an integer n gives rise to ...
[[abstract]]In this paper, upper bounds are presented for the solution of the following multidimensi...
In this paper, the methods of recursive function theory are used to study the size (or cost or compl...
We present a new master theorem for the study of divide-and-conquer recursive definitions, which imp...
Given an associative system in which each word is assigned a cost and in which an equivalence relati...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
[[abstract]]Let M(n) be defined by the recurrence M(n) = max (M(k) + M(n - k) + min(f(k), f(n - k)))...
AbstractWe derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min1⩽j...
We consider the problem of developing automated techniques for solving recurrence relations to aid t...
AbstractGiven a positive integer M, and a set S = {x1, x2, …, xn} of positive integers, the maximum ...
Projet EURECABounds are obtained for the solution to the divide-and-conquer recurrence M (n) = F(max...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
AbstractThis paper explores the performance of a family of algorithms for computing the Walsh–Hadama...
[[abstract]]In this note we find the exact solution for the minimal recurrence S-n = min(k=1)([n/2])...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
AbstractAttaching a cost function to integers appearing in partitions of an integer n gives rise to ...
[[abstract]]In this paper, upper bounds are presented for the solution of the following multidimensi...
In this paper, the methods of recursive function theory are used to study the size (or cost or compl...
We present a new master theorem for the study of divide-and-conquer recursive definitions, which imp...
Given an associative system in which each word is assigned a cost and in which an equivalence relati...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...