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.

Enviaments recents

  • On the consistency of circuit lower bounds for non-deterministic time 

    Atserias, Albert; Buss, Sam; Müller, Moritz (Association for Computing Machinery (ACM), 2023)
    Text en actes de congrés
    Accés obert
    We prove the first unconditional consistency result for superpolynomial circuit lower bounds with a relatively strong theory of bounded arithmetic. Namely, we show that the theory ‍V20 is consistent with the conjecture ...
  • WFAsic: A high-performance ASIC accelerator for DNA sequence alignment on a RISC-V SoC 

    Haghi, Abbas; Álvarez Martí, Lluc; Fornt Mas, Jordi; Haro Ruiz, Juan Miguel de; Figueras Bagué, Roger; Doblas Font, Max; Marco Sola, Santiago; Moretó Planas, Miquel (Association for Computing Machinery (ACM), 2023)
    Text en actes de congrés
    Accés obert
    The ever-increasing yields in genome sequence data production pose a computational challenge to current genome sequence analysis tools, jeopardizing the future of personalized medicine. Leveraging hardware accelerators ...
  • New characterizations and a concept of potential for each multinomial (probabilistic) value 

    Domènech Blázquez, Margarita; Giménez Pradales, José Miguel; Puente del Campo, María Albina (Elsevier, 2024-05-15)
    Article
    Accés obert
    In this paper we focus on multinomial probabilistic values and we consider two special classes of players: necessary and nullifying players. By introducing new properties related to this kind of players, we provide new ...
  • An aggregation rule under uncertainty 

    Freixas Bosch, Josep (2023)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Many decision-making situations require the evaluation of several agents or judges. In a situation where agents evaluate candidates, the question arises of how best to aggregate evaluations so as to compare the candidates. ...
  • Multidimension: a dimensionality extension of simple games 

    Molinero Albareda, Xavier; Riquelme Csori, Fabián; Roura Ferret, Salvador; Serna Iglesias, María José (Springer, 2023-10-20)
    Article
    Accés obert
    In voting theory and social choice theory, decision systems can be represented as simple games, i.e., cooperative games defined through their players or voters and their set of winning coalitions. The weighted voting games ...
  • Definable ellipsoid method, sums-of-squares proofs, and the graph isomorphism problem 

    Atserias, Albert; Fijalkow, Joanna (Society for Industrial and Applied Mathematics (SIAM), 2023)
    Article
    Accés obert
    The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method ...
  • On the PoA conjecture: Trees versus biconnected components 

    Álvarez Faura, M. del Carme; Messegué Buisan, Arnau (Society for Industrial and Applied Mathematics (SIAM), 2023)
    Article
    Accés obert
    In the classical model of network creation games introduced by Fabrikant et al. [Ona network creation game, in Proceedings of the Twenty-Second Annual Symposium on Principlesof Distributed Computing (PODC`03), 2003, pp. ...
  • On vanishing sums of roots of unity in polynomial calculus and sum-of-squares 

    Bonacina, Ilario; Galesi, Nicola; Lauria, Massimo (2023-12)
    Article
    Accés obert
    We introduce a novel take on sum-of-squares that is able to reason with complex numbers and still make use of polynomial inequalities. This proof system might be of independent interest since it allows to represent multivalued ...
  • Some characterizations of resolute majority rules 

    Freixas Bosch, Josep; Samaniego Vidal, Daniel (Springer, 2023-10-14)
    Article
    Accés obert
    In this paper we consider decision functions in which voters have three options and one of them is abstention or indifference and the output is a binary decision between two alternatives so that a tie is not possible. These ...
  • Reconstruction of random geometric graphs: breaking the Ω(r) distortion barrier 

    Dani, Varsha; Díaz Cort, Josep; Hayes, Thomas P.; Moore, Cristopher (2023-10-03)
    Article
    Accés obert
    Embedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph ...
  • Circular (yet sound) proofs in propositional logic 

    Atserias, Albert; Lauria, Massimo (Association for Computing Machinery (ACM), 2023-07)
    Article
    Accés obert
    Proofs in propositional logic are typically presented as trees of derived formulas or, alternatively, as directed acyclic graphs of derived formulas. This distinction between tree-like vs. dag-like structure is particularly ...
  • On the Felsenthal power index 

    Freixas Bosch, Josep; Samaniego Vidal, Daniel (Springer, 2023-07-18)
    Article
    Accés obert
    The paper that introduces the Felsenthal index is titled: ‘A well-behaved index of a priori P-Power for simple n-person games.’ In 2016, Felsenthal introduced his index for simple games. His definition does not base on the ...

Mostra'n més