ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

 

El grup de recerca ALBCOM uneix 19 reconeguts investigadors en mètodes formals; disseny, automatització i verificació de VLSI; algorismes i complexitat; bioinformàtica (vegeu http://albcom.cs.upc.edu/ per a més detalls). La recerca que es realitza a ALBCOM té un important prestigi en la comunitat científica internacional, degut a la qualitat de la seva recerca, tal com mostren les seves publicacions, i a l'activitat en projectes de recerca i de transferència de tecnologia amb empreses i institucions del sector.

El grupo de investigación ALBCOM une 19 reconocidos investigadores en métodos formales; diseño, automatización y verificación de VLSI; algoritmos y complejidad; bioinformática (véase http://albcom.cs.upc.edu/ para más detalles). La investigación que se realiza a ALBCOM tiene un importante prestigio en la comunidad científica internacional, debido a la calidad de su investigación, tal como muestran sus publicaciones, y a la actividad en proyectos de investigación y de transferencia de tecnología con empresas e instituciones del sector.

The primary goal is to produce relevant contributions in the areas of expertise of the group and to disseminate them in renowned international journals and conferences. It is the group's aim that these contributions have a tangible and long-term impact on the scientific community. Technology transfer is considered a byproduct of research excellence and should be sought as a means of increasing the impact of the results, obtaining resources for the group and envisioning new directions for future research.

The primary goal is to produce relevant contributions in the areas of expertise of the group and to disseminate them in renowned international journals and conferences. It is the group's aim that these contributions have a tangible and long-term impact on the scientific community. Technology transfer is considered a byproduct of research excellence and should be sought as a means of increasing the impact of the results, obtaining resources for the group and envisioning new directions for future research.

Recent Submissions

  • Size-degree trade-offs for Sums-of-Squares and Positivstellensatz proofs 

    Atserias, Albert; Hakoniemi, Tuomas Antero (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019)
    Conference report
    Open Access
    We show that if a system of degree-k polynomial constraints on n Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most s many monomials, then it also has one whose degree is of the order of ...

  • The neighborhood role in the linear threshold rank on social networks 

    Riquelme Csori, Fabián; Gonzalez Cantergiani, Pablo; Molinero Albareda, Xavier; Serna Iglesias, María José (2019-08-15)
    Article
    Restricted access - publisher's policy
    Centrality and influence spread are two of the most studied concepts in social network analysis. Several centrality measures, most of them, based on topological criteria, have been proposed and studied. In recent years new ...

  • Circular (yet sound) proofs 

    Atserias, Albert; Lauria, Massimo (Springer, 2019)
    Conference report
    Open Access
    We introduce a new way of composing proofs in rule-based proof systems that generalizes tree-like and dag-like proofs. In the new definition, proofs are directed graphs of derived formulas, in which cycles are allowed as ...

  • RTL-aware dataflow-driven macro placement 

    Vidal Obiols, Alexandre; Cortadella, Jordi; Petit Silvestre, Jordi; Galcerán Oms, Marc; Martorell Cid, Ferran (Institute of Electrical and Electronics Engineers (IEEE), 2019)
    Conference report
    Open Access
    When RTL designers define the hierarchy of a system, they exploit their knowledge about the conceptual abstractions devised during the design and the functional interactions between the logical components. This valuable ...

  • Satellites in the prokaryote world 

    Subirana Torrent, Juan A.; Messeguer Peypoch, Xavier (2019-09-18)
    Article
    Open Access
    Background Satellites or tandem repeats are very abundant in many eukaryotic genomes. Occasionally they have been reported to be present in some prokaryotes, but to our knowledge there is no general comparative study ...

  • The dynamic pipeline paradigm 

    Zoltán, Cristina; Pasarella Sánchez, Ana Edelmira; Aráoz Durand, Julián Arturo; Vidal, Maria-Esther (Sociedad de Ingeniería de Software y Tecnologías de Desarrollo de Software (SISTEDES), 2019)
    Conference report
    Open Access
    Nowadays, in the era of Big Data and Internet of Things, large volumes of data in motion are produced in heterogeneous formats, frequencies, densities, and quantities. In general, data is continuously produced by diverse ...

  • A balance index for phylogenetic trees based on rooted quartets 

    Martínez Coronado, Tomás; Mir Torres, Arnau; Rosselló Llompart, Francesc A.; Valiente Feruglio, Gabriel Alejandro (2019-06-17)
    Article
    Restricted access - publisher's policy
    We define a new balance index for rooted phylogenetic trees based on the symmetry of the evolutive history of every set of 4 leaves. This index makes sense for multifurcating trees and it can be computed in time linear in ...

  • Exact and heuristic allocation of multi-kernel applications to multi-FPGA platforms 

    Shan, Junnan; Casu, Mario R.; Cortadella, Jordi; Lavagno, Luciano; Lazarescu, Mihai T.
    Conference report
    Open Access
    FPGA-based accelerators demonstrated high energy efficiency compared to GPUs and CPUs. However, single FPGA designs may not achieve sufficient task parallelism. In this work, we optimize the mapping of high-performance ...

  • Dynamic pipelining of multidimensional range queries 

    Duch Brown, Amalia; Lugosi, Daniel; Pasarella Sánchez, Ana Edelmira; Zoltan Torres, Ana Cristina (2019-06-07)
    Article
    Open Access
    The problem of evaluating orthogonal range queries efficiently has been studied widely in the data structures community. It has been common wisdom for several years that for queries containing more than 20% of the ...

  • Sesquickselect: One and a half pivots for cache-efficient selection 

    Martínez Parra, Conrado; Nebel, Markus; Wild, Sebastian (Curran, 2019)
    Conference report
    Open Access
    Because of unmatched improvements in CPU performance, memory transfers have become a bottleneck of program execution. As discovered in recent years, this also affects sorting in internal memory. Since partitioning around ...

  • Generalized satisfiability problems via operator assignments 

    Atserias, Albert; Kolaitis, Phokion; Severini, Simone (2019-09)
    Article
    Open Access
    Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in ...

  • Petri net analysis using boolean manipulation 

    Pastor Llorens, Enric; Roig Mansilla, Oriol; Cortadella, Jordi; Badia Sala, Rosa Maria (Springer, 1994)
    Part of book or chapter of book
    Open Access
    This paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed ...

View more