We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...