Add to ORKGGiven a sequence A of 2n real numbers, the \ers\ problem asks for the sum of the n values that are at the even positions in the sorted order of the elements in A. We prove that, in the algebraic computation-tree model, this problem has time complexity \Theta(n \log n). This solves an open problem posed by Michael Shamos at the Canadian Conference on Computational Geometry in 2008
The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elemen...
AbstractLet k and n be positive integers, n>k. Define r(n,k) to be the minimum positive value of |a1...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
Given a sequence A of 2n real numbers, the \ers\ problem asks for the sum of the n values that are a...
Given a sequence A of 2n real numbers, the EvenRankSum problem asks for the sum of the n values that...
AbstractGiven a sequence of n real numbers and an integer parameter k, the problem studied in this p...
We prove upper and lower bounds on the time complexity of solving the 2-SUM problem: given a set of ...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if ...
This article deals with deciding whether a permutation is sortable with two stacks in series. Whethe...
The k-SUM problem is given n input real numbers to determine whether any k of them sum to zero. The ...
In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if ...
In this paper, we design a fast algorithm for ranking the k maximum sum subsequences. Given a sequen...
The SUBSET SUM problem asks whether a given set of n positive integers contains a subset of elements...
AbstractWe present a solution to a problem posed by Nicolas Lichiardopol, regarding the on-line sort...
The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elemen...
AbstractLet k and n be positive integers, n>k. Define r(n,k) to be the minimum positive value of |a1...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
Given a sequence A of 2n real numbers, the \ers\ problem asks for the sum of the n values that are a...
Given a sequence A of 2n real numbers, the EvenRankSum problem asks for the sum of the n values that...
AbstractGiven a sequence of n real numbers and an integer parameter k, the problem studied in this p...
We prove upper and lower bounds on the time complexity of solving the 2-SUM problem: given a set of ...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if ...
This article deals with deciding whether a permutation is sortable with two stacks in series. Whethe...
The k-SUM problem is given n input real numbers to determine whether any k of them sum to zero. The ...
In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if ...
In this paper, we design a fast algorithm for ranking the k maximum sum subsequences. Given a sequen...
The SUBSET SUM problem asks whether a given set of n positive integers contains a subset of elements...
AbstractWe present a solution to a problem posed by Nicolas Lichiardopol, regarding the on-line sort...
The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elemen...
AbstractLet k and n be positive integers, n>k. Define r(n,k) to be the minimum positive value of |a1...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...