LARCA és un grup de recerca de nivell internacional en temes d'aprenentatge i mineria de dades, anàlisi de dades i lingüística matemàtica. Típicament, abordem els problemes des de principis matemàtics sòlids, usant eines de modelització i tècniques de l'algorísmia, complexitat computacional, teoria d'autòmats, lògica, matemàtica discreta, estadística, i sistemes dinàmics. Estem iniciant
col·laboracions amb empreses i altres institucions per tal d'aplicar les nostres solucions al problemes del món real.

LARCA es un grupo de investigación de nivel internacional en temas de aprendizaje y minería de datos, análisis de datos y lingüística matemática. Típicamente, abordamos los problemas desde principios matemáticos sólidos, usando técnicas de modelización de la algoritmia, la complejidad computacional, teoría de autómatas, lógica, matemática discreta, estadística y sistemas dinámicos. Estamos iniciando colaboraciones con empresas e instituciones para la aplicación de nuestras soluciones a contextos reales.

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

Recent Submissions

  • Parallel complexity in the design and analysis of concurrent systems 

    Álvarez Faura, M. del Carme; Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (1990-10)
    External research report
    Open Access
    We study the parallel complexity of three problems on concurrency: decision of firing sequences for Petri nets, trace equivalence for partially commutative monoids, and strong bisimilarity in finite transition systems. We ...
  • Computational complexity of small descriptions 

    Gavaldà Mestre, Ricard; Watanabe, Osamu (1990-11-19)
    External research report
    Open Access
    For a set L that is polynomial time reducible (in short, = sub T super P-reducible) to some sparse set, we investigate the computational complexity of such sparse sets relative to L. We construct sets A and B such that ...
  • Together at home! Coronavirus days 

    Copons, Jaume; Fortuny, Liliana; Macip, Salvador; Hernández Fernández, Antonio; Rottier, Elena (Combel, 2020-05)
    Book
    Open Access
    TOGETHER AT HOME. Coronavirus Days invites readers to learn to live under lockdown and subsequent lifting of the lockdown and act as heroes, helping to prevent the pandemic from spreading. As Agus says: “each of us was in ...
  • ¡Juntos en casa! Los días del coronavirus 

    Macip, Salvador; Hernández Fernández, Antonio; Rottier, Elena; Copons, Jaume; Fortuny, Liliana (Combel, 2020-05)
    Book
    Open Access
    Este libro solidario de Agus y los monstruos es un libro muy especial que ha surgido en un contexto excepcional. Se trata de una novela gráfica breve, en formato digital, resultado del momento actual y que tiene un objetivo ...
  • Junts a casa! Els dies del coronavirus 

    Macip, Salvador; Hernández Fernández, Antonio; Rottier, Elena; Copons, Jaume; Fortuny, Liliana (Combel, 2020-05-11)
    Book
    Open Access
    Aquest llibre solidari de “L’ Agus i els monstres” és un llibre molt especial generat en un context excepcional. Es tracta d’una novel·la gràfica breu, en format digital, que és el resultat del moment actual i que té un ...
  • Challenging the generalization capabilities of Graph Neural Networks for network modeling 

    Suárez-Varela Maciá, José Rafael; Carol Bosch, Sergi; Rusek, Krzysztof; Almasan Puscas, Felician Paul; Arias Vicente, Marta; Barlet Ros, Pere; Cabellos Aparicio, Alberto (Association for Computing Machinery (ACM), 2019)
    Conference report
    Open Access
    Today, network operators still lack functional network models able to make accurate predictions of end-to-end Key Performance Indicators (e.g., delay or jitter) at limited cost. Recently a novel Graph Neural Network (GNN) ...
  • Embedding: a unifying concept for recursive program design 

    Roselló Balanyà, Celestí; Balcázar Navarro, José Luis; Peña Marí, Ricardo (1988)
    External research report
    Open Access
    The concept of embedding one function into another is used to get a unified view of some well-known design techniques, such as loop derivation using inveriants, recursion removal, or folding-unfolding. A design method for ...
  • Logarithmic advice classes 

    Balcázar Navarro, José Luis; Schöning, Uwe (1988)
    External research report
    Open Access
    Karp and Lipton [9] introduced the notion of non-uniform complexity classes where a certain amount of "side information", the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton ...
  • El algoritmo de compleción de Knuth-Bendix 

    Balcázar Navarro, José Luis (1988)
    External research report
    Open Access
    An introduction to the confluence and finite termination properties of rewriting systems is presented and also to the Kunth-Bendix completion algorithm is presented.
  • Only smart oracles help 

    Balcázar Navarro, José Luis (1988-09)
    External research report
    Open Access
    It is shown that every set that is p-cheateble up to a logarithmic extent is a no-1-helper.
  • Self-reducibility structures and solutions of NP problems 

    Balcázar Navarro, José Luis (1988)
    External research report
    Open Access
    Using polynomial time self-reducibility structures, we characterize certain "helping" notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional ...
  • Tractabilitat de NP i altres classes de complexitat per famílies de circuits booleans 

    Gavaldà Mestre, Ricard (1987-11)
    External research report
    Open Access
    We search for nonuniform analogs of the complexity class N P ¿ coN P. Following mainly the work of Karp and Lipton on these classes, 1) We define two types of polynomial time reducibility, study some of their basic properties ...

View more