• Contributions to the analysis of approximate counting 

      Prodinger, Helmut (Stellenbosch : Stellenbosch University, 2016-03)
      ENGLISH ABSTRACT : Approximate Counting is a classical technique with very challenging questions re- lated to its performance analysis. It is also somewhat similar to parameters around Digital Search trees. Surprising ...
    • On the inducibility of rooted trees 

      Dossou-Olory, Audace Amen Vioutou (Stellenbosch : Stellenbosch University, 2018-12)
      ENGLISH ABSTRACT : The density of appearances of a fixed tree in a larger tree is examined for rooted trees without vertices of outdegree 1 (also known as topological trees). Given a topological tree S with k leaves and ...