Articles de revista
Enviaments recents
-
On the expected cost of partial match queries in random Quad-K-d trees
(Springer, 2024-03-04)
Article
Accés obertQuad-K-d trees introduced by Bereckzy et al. (In: Proceedings of the 11th Latin merican Theoretical Informatics Conference (LATIN). Lecture Notes in Computer Science, vol. 8392, pp. 743–754, 2014) are a generalization of ... -
Social disruption games in signed networks
(2024-05)
Article
Accés restringit per política de l'editorialSigned networks describe many real-world relations among users. Positive connections between two users or vertices generally mean good feelings between them, but negative connections mean bad feelings. A disruptor cycle ... -
The k-Robinson–Foulds dissimilarity measures for comparison of labeled treesd
(2024-01-25)
Article
Accés obertUnderstanding the mutational history of tumor cells is a critical endeavor in unraveling the mechanisms that drive the onset and progression of cancer. Modeling tumor cell evolution with labeled trees motivates researchers ... -
Weighted, circular and semi-algebraic proofs
(2024-02-11)
Article
Accés obertIn recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find ... -
New characterizations and a concept of potential for each multinomial (probabilistic) value
(Elsevier, 2024-05-15)
Article
Accés obertIn 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 ... -
Multidimension: a dimensionality extension of simple games
(Springer, 2023-10-20)
Article
Accés obertIn 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
(Society for Industrial and Applied Mathematics (SIAM), 2023)
Article
Accés obertThe 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
(Society for Industrial and Applied Mathematics (SIAM), 2023)
Article
Accés obertIn 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
(2023-12)
Article
Accés obertWe 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
(Springer, 2023-10-14)
Article
Accés obertIn 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
(2023-10-03)
Article
Accés obertEmbedding 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
(Association for Computing Machinery (ACM), 2023-07)
Article
Accés obertProofs 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 ...
RSS 1.0