![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Yet Another Modular Technique for Efficient Leader Election
In this paper we present a general and still flexible modular technique for the design of efficient leader election algorithms in N-node networks. Our approach can be viewed as a generalization of the previous me...
-
Chapter and Conference Paper
Efficient deadlock-free multi-dimensional interval routing in interconnection networks
We present deadlock-free packet (wormhole) routing algorithms based on multi-dimensional interval schemes for certain multiprocessor interconnection networks and give their analysis in terms of the compactness...
-
Chapter and Conference Paper
Efficient Communication Schemes
We give a survey of recent theoretical results for communication problems in point to point networks. This survey is based on the previous surveys in [57, 25].
-
Chapter and Conference Paper
Efficient tree pattern unification
The problem of many-to-one unification, i.e. a simultaneous weak unification of pattern terms against all subterms of a target term, is studied for linear terms. Two algorithms proposed in [10] generalize eith...
-
Chapter and Conference Paper
An efficient decision algorithm for the uniform semi-unification problem extended abstract
An algorithm to decide whether a pair of terms is semi-unifiable is presented. It is based on compact graph representation of terms and on efficient implementation of variable replacements. The time complexity...