We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...