AbstractWe consider the problem of computing the median of a bag of 2n numbers by using communicating processes, each having some of the numbers in its local memory. The memories are assumed to be disjoint. For two processes an algorithm is given. Its time and space complexity is linear while the communication complexity is 2 log2 n. A lower bound of log2 n on the communication complexity is derived. Thus the algorithm is optimal up to a constant
Given n points f'xi,yi)} in the plane we study the problem of fitting the minimum median squared res...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for s...
AbstractWe consider the problem of computing the median of a bag of 2n numbers by using communicatin...
[[abstract]]©1992 Elsevier-The paper considers 2-dimensional mesh-connected computers with multiple ...
We study the p-median problem which is one of the classical problems in location theory. For p = 2 a...
We consider a scenario where nodes in a sensor network hold numeric items, and the task is to evalua...
Abstract. We present a reformulation of the 2n + o(n) lower bound of Bent and John for the number of...
A common statistical problem is that of finding the median element in a set of data. This paper pre...
Abstract- A graph model based on single character operations is developed for constructing the media...
Abstract — In this paper, we consider the weighted rectilinear min-sum facility problem to minimize ...
The one median location problem with stochastic demands can be solved as a deterministic problem by ...
AbstractThe one median location problem with stochastic demands can be solved as a deterministic pro...
Facility Location Problems have a great significance for allocating resources efficiently in a netwo...
A new characterization of tree medians is presented: we show that a vertex m is a median of a tree ...
Given n points f'xi,yi)} in the plane we study the problem of fitting the minimum median squared res...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for s...
AbstractWe consider the problem of computing the median of a bag of 2n numbers by using communicatin...
[[abstract]]©1992 Elsevier-The paper considers 2-dimensional mesh-connected computers with multiple ...
We study the p-median problem which is one of the classical problems in location theory. For p = 2 a...
We consider a scenario where nodes in a sensor network hold numeric items, and the task is to evalua...
Abstract. We present a reformulation of the 2n + o(n) lower bound of Bent and John for the number of...
A common statistical problem is that of finding the median element in a set of data. This paper pre...
Abstract- A graph model based on single character operations is developed for constructing the media...
Abstract — In this paper, we consider the weighted rectilinear min-sum facility problem to minimize ...
The one median location problem with stochastic demands can be solved as a deterministic problem by ...
AbstractThe one median location problem with stochastic demands can be solved as a deterministic pro...
Facility Location Problems have a great significance for allocating resources efficiently in a netwo...
A new characterization of tree medians is presented: we show that a vertex m is a median of a tree ...
Given n points f'xi,yi)} in the plane we study the problem of fitting the minimum median squared res...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for s...
DOI
Add to ORKG