2 Result(s)
within
English
Computer Science
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Theory of Computation
Peter Ružička
Chapter
-
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
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...
