Skip to main content

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

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

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