We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
Edgar H. de Graaf, Walter A. Kosters, Joost N. Kok...
The e-learning project GOLEM introduces a group and role-oriented concept to the course "Man-Machine Interfaces" at the University of Technology in Hamburg, Germany. Stu...
We consider a network of remote agent platforms that are tested by roaming spy agents in order to identify those that are malicious, based on the outcome of each agent. It is show...
View-oriented group communication is an important and widely used building block for constructing highlyavailable fault-tolerant systems. Unfortunately, groupcommunication based s...
Eitan Farchi, Gabriel Kliot, Yoel Krasny, Alex Kri...