66 citations · 204 across the 20 of their papers we have counts for
27 papers
On constrained intersection representations of graphs and digraphs
Ferdinando Cicalese, Clément Dallard, Martin Milanič
We study the problem of determining optimal directed intersection representations of DAGs in a model introduced by Kostochka, Liu, Machado, and Milenkovic [ISIT2019]: vertices are…
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees
Luca Marzari, Davide Corsi, Enrico Marchesini +2
Identifying safe areas is a key point to guarantee trust for systems that are based on Deep Neural Networks (DNNs). To this end, we introduce the AllDNN-Verification problem: given…
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks
Luca Marzari, Davide Corsi, Ferdinando Cicalese +1
Deep Neural Networks are increasingly adopted in critical tasks that require a high level of safety, e.g., autonomous driving. While state-of-the-art verifiers can be employed to c…
The Tandem Duplication Distance Problem is hard over bounded alphabets
Ferdinando Cicalese, Nicolò Pilati
A tandem duplication denotes the process of inserting a copy of a segment of DNA adjacent to its original position. More formally, a tandem duplication can be thought of as an oper…
Minimum--Entropy Couplings and their Applications
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Given two discrete random variables and with probability distributions and , respectively, denote by ${\cal C}({…
Information theoretical clustering is hard to approximate
Ferdinando Cicalese, Eduardo Laber
An impurity measures is a function that assigns a -dimensional vector to a non-negative value so that the more homo…