We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: ag := the least cardina...
Spatially enabled government requires the development of effective SDIs that will support the vast majority of society, who are not spatially aware, in a transparent manner. This ...
Background: Haplotypes extracted from human DNA can be used for gene mapping and other analysis of genetic patterns within and across populations. A fundamental problem is, howeve...