Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
This paper presents a benchmark for dependablesystems. The benchmark consists of two metrics, number of catastrophic incidents and performance degradation, which are obtained by a...
We present a weakly nonlinear analysis of our recently developed model for the formation of crime patterns. Using a perturbative approach, we find amplitude equations that govern t...
Martin B. Short, Andrea L. Bertozzi, P. J. Brantin...
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...