This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected O(log log logn) rounds and using this, we obtain a constant-approximation to metric facility location, also in expected O(log log logn) rounds. In addition, assuming an input metric space of constant doubling d...

An (n,N)–connector of depth d is an acyclic digraph with n inputs and N outputs in which for any injective mapping of input vertices into output vertices there exist n vertex disjoint paths of length at most d joining each input to its corresponding output. In this paper we consider the problem of construction of sparse depth two connectors with n ≪ N . We use posets of star products and their ...

The capacity of a narrow-band subliminal channel can be proportional to log 2 n, and then its upper bound is log 2 n where n is the number of input values a subliminal transmitter tried. These results are obtained, provided that only the single carrier is transmitted. In this paper, we consider a practical model, a successive carrier-transmission model, where carriers are transmitted one after ...

In this paper we present a really simple linear-time algorithm constructing a contextfree grammar of size O(g log(N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is linear assuming that the alphabet Σ of the input string can be identified with ...

We present an O(n log n)-time algorithm that determines whether a given planar n-gon is weakly simple. This improves upon an O(n log n)-time algorithm by Chang, Erickson, and Xu [5]. Weakly simple polygons are required as input for several geometric algorithms. As such, how to recognize simple or weakly simple polygons is a fundamental question.

Level crossing rate, outage probability and average time of fade duration of the SSC combiner output signal are determined in this paper. The presence of log-normal fading at the input is observed. The results are shown graphically for different variance values, decision threshold values and fading parameters. Key-Words: Diversity reception, Fade Duration, Level Crossing Rate, Log-normal fading...

The main contribution of this work is to present a simple sorting algorithm for the broadcast communication model (BCM, for short). With a sequence on n items as input, our algorithm runs in O(n p log n p + n k + log k) time on a p-processor, k-channel BCM, a considerable improvement over the state of the art.

We prove that any oblivious algorithm using space S to find the median of a list of n integers from {1, . . . , 2n} requires time Ω(n log logS n). This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using only s registers, each of which can ...

We present algorithms for five interdistance enumeration problems that take as input a set S of n points in IRd (for a fixed but arbitrary dimension d) and as output enumerate pairs of points in S satisfying various conditions. We present: an O(n log n + k) time and O(n) space algorithm that takes as additional input a distance δ and outputs all k pairs of points in S separated by a distance of...

We consider the streaming complexity of a fundamental task in approximate pattern matching: the k-mismatch problem. It asks to compute Hamming distances between a pattern of length n and all length-n substrings of a text for which the Hamming distance does not exceed a given threshold k. In our problem formulation, we report not only the Hamming distance but also, on demand, the full mismatch i...