Skip to main content

and
  1. No Access

    Article

    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 Acta Informatica (1989)

  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 time-space trade-offs in dynamic graph pebbling

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

    Peter Ružička, Juraj Waczulík in Mathematical Foundations of Computer Science 1993 (1993)

  4. No Access

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

    Peter Ružička in SOFSEM'96: Theory and Practice of Informatics (1996)

  5. No Access

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

    Stefan Dobrev, Peter RuŽička in SOFSEM’ 98: Theory and Practice of Informatics (1998)

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

  7. No Access

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

    Peter RuŽička in SOFSEM’ 98: Theory and Practice of Informatics (1998)

  8. No Access

    Book and Conference Proceedings

    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

    Leszek Pacholski, Peter Ružička in Lecture Notes in Computer Science (2001)