Ferdinando Cicalese

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 55

Top Venues

Publications

Ferdinando Cicalese, Francesca Ugazio
On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. DLT (2024)
Ferdinando Cicalese, Francesca Ugazio
On the complexity and approximability of Bounded access Lempel Ziv coding. CoRR (2024)
Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli
Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations. CoRR (2024)
Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees. AAAI (2024)
Manuele Bicego, Ferdinando Cicalese
Computing Random Forest-distances in the presence of missing data. ACM Trans. Knowl. Discov. Data 18 (7) (2024)
Manuele Bicego, Ferdinando Cicalese
Computing Random Forest-distances in the presence of missing data. IEEE Trans. Knowl. Data Eng. 18 (7) (2024)
Andrea Caucchiolo, Ferdinando Cicalese
Hardness and approximation of multiple sequence alignment with column score. Theor. Comput. Sci. 946 (2023)
Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli
The #DNN-Verification problem: Counting Unsafe Inputs for Deep Neural Networks. CoRR (2023)
Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks. IJCAI (2023)
Manuele Bicego, Ferdinando Cicalese
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation. ECML/PKDD (4) (2023)
Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees. CoRR (2023)
Manuele Bicego, Ferdinando Cicalese, Antonella Mensi
RatioRF: A Novel Measure for Random Forest Clustering Based on the Tversky's Ratio Model. IEEE Trans. Knowl. Data Eng. 35 (1) (2023)
Matteo Raniero, Manuele Bicego, Ferdinando Cicalese
Distance-Based Random Forest Clustering with Missing Data. ICIAP (3) (2022)
Ferdinando Cicalese, Clément Dallard, Martin Milanic
On Constrained Intersection Representations of Graphs and Digraphs. ISAAC (2022)
Andrea Caucchiolo, Ferdinando Cicalese
On the Intractability Landscape of Digraph Intersection Representations. IWOCA (2022)
Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
Decision Trees with Short Explainable Rules. NeurIPS (2022)
Antonella Mensi, Ferdinando Cicalese, Manuele Bicego
Using Random Forest Distances for Outlier Detection. ICIAP (3) (2022)
Ferdinando Cicalese, Nicolò Pilati
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. IWOCA (2021)
Ferdinando Cicalese, Massimiliano Rossi
On the Redundancy of D-Ary Fano Codes. SOFSEM (2021)
Ferdinando Cicalese, Eduardo Sany Laber
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. Discret. Appl. Math. 289 (2021)
Andrea Caucchiolo, Ferdinando Cicalese
Hardness of MSA with Selective Column Scoring. ICTCS (2021)
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
On infinite prefix normal words. Theor. Comput. Sci. 859 (2021)
Ferdinando Cicalese, Eduardo Sany Laber
Information Theoretical Clustering Is Hard to Approximate. IEEE Trans. Inf. Theory 67 (1) (2021)
Ferdinando Cicalese, Eros Rossi
On D-ary Fano Codes. ISIT (2020)
Ferdinando Cicalese, Massimiliano Rossi
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice. Theor. Comput. Sci. 809 (2020)
Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro
Teaching with Limited Information on the Learner's Behaviour. ICML (2020)
Andrea Caucchiolo, Ferdinando Cicalese
On the Complexity of Directed Intersection Representation of DAGs. COCOON (2020)
Ferdinando Cicalese, Nicolò Pilati
On the Tandem Duplication Distance. CoRR (2020)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Minimum-Entropy Couplings and their Applications. CoRR (2019)
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
On Infinite Prefix Normal Words. SOFSEM (2019)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Minimum-Entropy Couplings and Their Applications. IEEE Trans. Inf. Theory 65 (6) (2019)
Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho
New results on information theoretic clustering. ICML (2019)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
An Information Theoretic Approach to Probability Mass Function Truncation. ISIT (2019)
Ferdinando Cicalese, Eduardo Sany Laber
Approximation Algorithms for Clustering via Weighted Impurity Measures. CoRR (2018)
Ferdinando Cicalese, Eduardo Sany Laber
Information theoretical clustering is hard to approximate. CoRR (2018)
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. LATA (2018)
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
Bubble-Flip - A new generation algorithm for prefix normal words. Theor. Comput. Sci. 743 (2018)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 80 (11) (2018)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Bounds on the Entropy of a Function of a Random Variable and Their Applications. IEEE Trans. Inf. Theory 64 (4) (2018)
Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev
A Combinatorial Model of Two-Sided Search. Int. J. Found. Comput. Sci. 29 (4) (2018)
Ferdinando Cicalese, Ugo Vaccaro
Maximum Entropy Interval Aggregations. CoRR (2018)
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
On Infinite Prefix Normal Words. CoRR (2018)
Ferdinando Cicalese, Ugo Vaccaro
Maximum Entropy Interval Aggregations. ISIT (2018)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals. CoRR (2017)
Ferdinando Cicalese, Massimiliano Rossi
On the Multi-interval Ulam-Rényi game: For 3 Lies 4 Intervals Suffice. ICTCS/CILC (2017)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 79 (3) (2017)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
H(X) vs. H(f(X)). ISIT (2017)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
How to find a joint probability distribution of minimum entropy (almost) given the marginals. ISIT (2017)
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. CoRR (2017)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. Algorithmica 79 (3) (2017)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
H(X) vs. H(f(X)). CoRR (2017)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Bounds on the Entropy of a Function of a Random Variable and their Applications. CoRR (2017)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the tree search problem with non-uniform costs. Theor. Comput. Sci. 647 (2016)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Approximating probability distributions with short vectors, via information theoretic distance measures. ISIT (2016)
Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev
A Combinatorial Model of Two-Sided Search. SOFSEM (2016)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Trading off Worst and Expected Cost in Decision Tree Problems. ISAAC (2015)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Approximating decision trees with value dependent testing costs. Inf. Process. Lett. 115 (6-8) (2015)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
Spread of Influence in Weighted Networks under Time and Budget Constraints. CoRR (2015)
Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
On the complexity of the vector connectivity problem. Theor. Comput. Sci. 591 (2015)
Wilfredo Bardales Roncalla, Eduardo Sany Laber, Ferdinando Cicalese
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. CoRR (2015)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. 586 (2015)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the Tree Search Problem with Non-uniform Costs. WG (2015)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
How to go Viral: Cheaply and Quickly. FUN (2014)
Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. ISIT (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. ICML (2014)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the Tree Search Problem with Non-uniform Costs. CoRR (2014)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
Latency-bounded target set selection in social networks. Theor. Comput. Sci. 535 (2014)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68 (4) (2014)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. CoRR (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. ISAIM (2014)
Ferdinando Cicalese
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions. Theory Comput. Syst. 54 (4) (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525 (2014)
Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
On the complexity of the vector connectivity problem. CoRR (2014)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
How to go Viral: Cheaply and Quickly. CoRR (2014)
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs CoRR (2013)
Ferdinando Cicalese, Ely Porat
Guest Editorial for "Group Testing: models and applications". Algorithmica 67 (3) (2013)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
Latency-Bounded Target Set Selection in Social Networks CoRR (2013)
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. 161 (6) (2013)
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
Latency-Bounded Target Set Selection in Social Networks. CiE (2013)
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Information theoretic measures of distances and their econometric applications. ISIT (2013)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. CoRR (2013)
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE (2013)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM (2012)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim
The binary identification problem for weighted trees. Theor. Comput. Sci. 459 (2012)
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
A linear algorithm for string reconstruction in the reverse complement equivalence model. J. Discrete Algorithms 14 (2012)
Ferdinando Cicalese, Martin Milanic
Graphs of separability at most 2. Discret. Appl. Math. 160 (6) (2012)
Ferdinando Cicalese
The Multi-interval Ulam-Rényi Game. FUN (2012)
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
Algorithms for Jumbled Pattern Matching in Strings. Int. J. Found. Comput. Sci. 23 (2) (2012)
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
On Approximate Jumbled Pattern Matching in Strings. Theory Comput. Syst. 50 (1) (2012)
Ferdinando Cicalese, Martin Milanic
Competitive evaluation of threshold functions in the priced information model. Ann. Oper. Res. 188 (1) (2011)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412 (50) (2011)
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
Algorithms for Jumbled Pattern Matching in Strings CoRR (2011)
Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. 159 (11) (2011)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim
Binary Identification Problems for Weighted Trees. WADS (2011)
Ferdinando Cicalese, Eduardo Sany Laber
On the competitive ratio of evaluating priced functions. J. ACM 58 (3) (2011)
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT (2011)
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. FUN (2010)
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs CoRR (2010)
Ferdinando Cicalese, Ugo Vaccaro
Superselectors: Efficient Constructions and Applications. ESA (1) (2010)
Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) (2010)

Ferdinando Cicalese.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ferdinando Cicalese