Skip to main content

and
  1. 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)

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