We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Owing to the stochastic nature of discrete processes such as photon counts in imaging, real-world data measurements often exhibit heteroscedastic behavior. In particular, time ser...