2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.DC2017
Self-Stabilizing Supervised Publish-Subscribe Systems
Michael Feldmann, Christina Kolb, Christian Scheideler +1
In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip…
cs.DC2017★ 1 cited
A Self-Stabilizing General De Bruijn Graph
Michael Feldmann, Christian Scheideler
Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fix…
cs.DS2012★ 2 cited
Polynomial time factoring algorithm using Bayesian arithmetic
Michel Feldmann
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-compl…