| 2026 | AAAI | On the Probabilistic Learnability of Compact Neural Network Preimage Bounds. | Luca Marzari, Manuele Bicego, Ferdinando Cicalese, Alessandro Farinelli |
| 2026 | ESA | Incongruity-Sensitive Access to Highly Compressed Strings. | Ferdinando Cicalese, Travis Gagie, Zsuzsanna Liptk, Gonzalo Navarro, Nicola Prezza, Cristian Urbina |
| 2024 | AAAI | Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees. | Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese |
| 2024 | DLT | On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. | Ferdinando Cicalese, Francesca Ugazio |
| 2024 | ECAI | Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations. | Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli |
| 2023 | IJCAI | The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks. | Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli |
| 2022 | ICIAP | Using Random Forest Distances for Outlier Detection. | Antonella Mensi, Ferdinando Cicalese, Manuele Bicego |
| 2022 | ICIAP | Distance-Based Random Forest Clustering with Missing Data. | Matteo Raniero, Manuele Bicego, Ferdinando Cicalese |
| 2022 | ISAAC | On Constrained Intersection Representations of Graphs and Digraphs. | Ferdinando Cicalese, Clment Dallard, Martin Milanic |
| 2022 | IWOCA | On the Intractability Landscape of Digraph Intersection Representations. | Andrea Caucchiolo, Ferdinando Cicalese |
| 2021 | IWOCA | The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. | Ferdinando Cicalese, Nicol Pilati |
| 2021 | SOFSEM | On the Redundancy of D-Ary Fano Codes. | Ferdinando Cicalese, Massimiliano Rossi |
| 2020 | COCOON | On the Complexity of Directed Intersection Representation of DAGs. | Andrea Caucchiolo, Ferdinando Cicalese |
| 2020 | ICML | Teaching with Limited Information on the Learner's Behaviour. | Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro |
| 2020 | ISIT | On D-ary Fano Codes. | Ferdinando Cicalese, Eros Rossi |
| 2019 | ICML | New results on information theoretic clustering. | Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho |
| 2019 | ISIT | An Information Theoretic Approach to Probability Mass Function Truncation. | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2019 | SOFSEM | On Infinite Prefix Normal Words. | Ferdinando Cicalese, Zsuzsanna Liptk, Massimiliano Rossi |
| 2018 | ISIT | Maximum Entropy Interval Aggregations. | Ferdinando Cicalese, Ugo Vaccaro |
| 2018 | LATA | Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. | Ferdinando Cicalese, Zsuzsanna Liptk, Massimiliano Rossi |
| 2017 | ISIT | H(X) vs. H(f(X)). | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2017 | ISIT | How to find a joint probability distribution of minimum entropy (almost) given the marginals. | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2016 | ISIT | Approximating probability distributions with short vectors, via information theoretic distance measures. | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2016 | SOFSEM | A Combinatorial Model of Two-Sided Search. | Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev |
| 2015 | ISAAC | Trading off Worst and Expected Cost in Decision Tree Problems. | Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese |
| 2015 | WG | On the Tree Search Problem with Non-uniform Costs. | Ferdinando Cicalese, Balzs Keszegh, Bernard Lidick, Dmtr Plvlgyi, Toms Valla |
| 2014 | FUN | How to go Viral: Cheaply and Quickly. | Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro |
| 2014 | ICML | Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. | Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler |
| 2014 | ISAIM | Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. | Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler |
| 2014 | ISIT | On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. | Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese |
| 2013 | CiE | Latency-Bounded Target Set Selection in Social Networks. | Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro |
| 2013 | ISIT | Information theoretic measures of distances and their econometric applications. | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2013 | SPIRE | Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. | Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Liptk, Romeo Rizzi, Alexandru I. Tomescu |
| 2012 | CPM | Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. | Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster |
| 2012 | FUN | The Multi-interval Ulam-Rnyi Game. | Ferdinando Cicalese |
| 2011 | FCT | Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
| 2011 | WADS | Binary Identification Problems for Weighted Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim |
| 2010 | ESA | Superselectors: Efficient Constructions and Applications. | Ferdinando Cicalese, Ugo Vaccaro |
| 2010 | FUN | On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. | Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Liptk |
| 2010 | FUN | A Better Bouncer's Algorithm. | Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch |
| 2010 | ICALP | On the Complexity of Searching in Trees: Average-Case Minimization. | Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro |
| 2010 | ISAAC | On Greedy Algorithms for Decision Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro |
| 2010 | IWOCA | Efficient Reconstruction of RC-Equivalent Strings. | Ferdinando Cicalese, Pter L. Erds, Zsuzsanna Liptk |
| 2010 | IWOCA | Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. | Ferdinando Cicalese, Martin Milanic |
| 2008 | ICALP | Function Evaluation Via Linear Programming in the Priced Information Model. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2008 | ISAAC | Computing with Priced Information: When the Value Makes the Price. | Ferdinando Cicalese, Martin Milanic |
| 2007 | ISAAC | 2-Stage Fault Tolerant Interval Group Testing. | Ferdinando Cicalese, Jos Augusto Amgarten Quitzau |
| 2007 | ISIT | Tunstall Parse Trees Optimum under Various Criteria. | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2006 | ISAAC | Faster Centralized Communication in Radio Networks. | Ferdinando Cicalese, Fredrik Manne, Qin Xin |
| 2006 | SODA | On the competitive ratio of evaluating priced functions. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2005 | COCOON | Overlaps Help: Improved Bounds for Group Testing with Interval Queries. | Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sren Werth |
| 2005 | ESA | An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2005 | ICCS | Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. | Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro |
| 2005 | STOC | A new strategy for querying priced information. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2004 | COCOON | Q-Ary Ulam-Rnyi Game with Weighted Constrained Lies. | Ferdinando Cicalese, Christian Deppe, Daniele Mundici |
| 2003 | ISAAC | Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. | Ferdinando Cicalese, Christian Deppe |
| 2000 | COCOON | Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. | Ferdinando Cicalese, Daniele Mundici |
| 2000 | ICALP | Optimal Approximation of Uniform Distributions with a Biased Coin. | Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro |
| 2000 | ISAAC | coping with Delays and Time-Outs in Binary Search Procedures. | Ferdinando Cicalese, Ugo Vaccaro |
| 1999 | ESA | Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. | Ferdinando Cicalese, Daniele Mundici |
| 1999 | SAC | A Fuzzy Evolutionary Framework for Adaptive Agents. | Ferdinando Cicalese, Antonio Di Nola, Vincenzo Loia |