Suppose a user wants to broadcast an encrypted message to K recipients. With public-key
encryption, the sender would construct K different ciphertexts, one for each recipient. The …

We survey recent work on approximation algorithms for computing degree-constrained
subgraphs in graphs and their applications in combinatorial scientific computing. The …

We report on careful implementations of seven algorithms for solving the problem of finding
a maximum transversal of a sparse matrix. We analyze the algorithms and discuss the …

A Perfect Hash Function (PHF) is a hash function that has no collisions on a given input set.
PHFs can be used for space efficient storage of data in an array, or for determining a …

We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a
finite field, represented with a black box. Our algorithm modifies the algorithm of Ben-Or and …

The problem of allocating students to supervisors for the development of a personal project
or a dissertation is a crucial activity in the higher education environment, as it enables …

Previous work on estimating the epipolar geometry of two views relies on being able to
reliably match feature points based on appearance. In this paper, we go one step further and …

In recent years, the expander decomposition method was used to develop many graph
algorithms, resulting in major improvements to longstanding complexity barriers. This …

It is difficult to obtain high performance when computing matchings on parallel processors
because matching algorithms explicitly or implicitly search for paths in the graph, and when …

We survey network topologies, in particular networks with full all-to-all bandwidth scaling.
For more detailed study, we select several recently introduced, promising networks that are …