Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...