We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...