Skip to main content

and
  1. No Access

    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...

    Rastislav KráĽovič, Branislav Rovan, Peter RuŽička in Distributed Computing (1998)

  2. No Access

    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...

    Peter Ružička in Mathematical Foundations of Computer Science 1991 (1991)

  3. No Access

    Chapter and Conference Paper

    On efficiency of interval routing algorithms

    Peter Ružička in Mathematical Foundations of Computer Science 1988 (1988)

  4. No Access

    Chapter and Conference Paper

    An almost linear robinson unification algorithm

    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...

    Peter Ružička, Igor Prívara in Mathematical Foundations of Computer Science 1988 (1988)

  5. No Access

    Chapter and Conference Paper

    Local disambiguating transformation

    Peter Ružička in Mathematical Foundations of Computer Scien… (1975)