SOFSEM 2001: Theory and Practice of Informatics
28th Conference on Current Trends in Theory and Practice of Informatics Piešt’any, Slovak Republic, November 24 – December 1, 2001 Proceedings
Article
Further asymptotical improvement of original Robinson's unification idea is presented. By postponing the so-called occur-check in Corbin and Bidoit's quadratic rehabilitation of the Robinson algorithm at the e...
Chapter and Conference Paper
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...
Chapter and Conference Paper
Pebble game on dynamic graphs is studied as an abstract model for the incremental computations. We investigate how the time T and/or the space S is changing according to the number m of insert-edge/delete-edge op...
Chapter and Conference Paper
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
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
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
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].
Book and Conference Proceedings
28th Conference on Current Trends in Theory and Practice of Informatics Piešt’any, Slovak Republic, November 24 – December 1, 2001 Proceedings