Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...
A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, ...