Recent Submissions

  • The scaling of the minimum sum of edge lengths in uniformly random trees 

    Esteban Ángeles, Juan Luis; Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (Institute of Physics (IOP), 2016-06-21)
    Article
    Restricted access - publisher's policy
    The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on ...
  • The computability path ordering 

    Blanqui, Frédéric; Jouannaud, Jean Pierre; Rubio Gimeno, Alberto (2015-10-26)
    Article
    Open Access
    This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation ...
  • Normal higher-order termination 

    Jouannaud, Jean Pierre; Rubio Gimeno, Alberto (2015-03-01)
    Article
    Open Access
    We extend the termination proof methods based on reduction orderings to higher-order rewriting systems based on higher-order pattern matching. We accommodate, on the one hand, a weakly polymorphic, algebraic extension of ...
  • Efficiently calculating evolutionary tree measures using SAT 

    Bonet Carbonell, M. Luisa; John, Katherine St. (2009)
    Article
    Open Access
    We develop techniques to calculate important measures in evolutionary biology by encoding to CNF formulas and using powerful SAT solvers. Comparing evolutionary trees is a necessary step in tree reconstruction algorithms, ...
  • Mining frequent closed rooted trees 

    Balcázar Navarro, José Luis; Bifet Figuerol, Albert Carles; Lozano Bojados, Antoni (2010-01)
    Article
    Open Access
    Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based ...

View more