Classifying through a fuzzy algebraic structure. - Antonio Gisolfi; Ferdinando Cicalese (Fuzzy Sets Syst., 1996)

A fuzzy evolutionary approach to the classification problem. - Ferdinando Cicalese; Vincenzo Loia (J. Intell. Fuzzy Syst., 1998)

Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. - Ferdinando Cicalese; Daniele Mundici (ESA, 1999)

A Fuzzy Evolutionary Framework for Adaptive Agents. - Ferdinando Cicalese; Antonio Di Nola; Vincenzo Loia (SAC, 1999)

Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. - Ferdinando Cicalese; Daniele Mundici (COCOON, 2000)

Optimal Approximation of Uniform Distributions with a Biased Coin. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ICALP Satellite Workshops, 2000)

coping with Delays and Time-Outs in Binary Search Procedures. - Ferdinando Cicalese; Ugo Vaccaro (ISAAC, 2000)

Perfect Two-Fault Tolerant Search with Minimum Adaptiveness. - Ferdinando Cicalese; Daniele Mundici (Adv. Appl. Math., 2000)

An improved heuristic for "Ulam-Rényi game". - Ferdinando Cicalese; Ugo Vaccaro (Inf. Process. Lett., 2000)

Optimal Strategies Against a Liar. - Ferdinando Cicalese; Ugo Vaccaro (Theor. Comput. Sci., 2000)

Least adaptive optimal search with unreliable tests. - Ferdinando Cicalese; Daniele Mundici; Ugo Vaccaro (Theor. Comput. Sci., 2002)

Supermodularity and subadditivity properties of the entropy on the majorization lattice. - Ferdinando Cicalese; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2002)

Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. - Ferdinando Cicalese; Christian Deppe (ISAAC, 2003)

Binary search with delayed and missing answers. - Ferdinando Cicalese; Ugo Vaccaro (Inf. Process. Lett., 2003)

Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. - Ferdinando Cicalese; Christian Deppe; Daniele Mundici (COCOON, 2004)

On searching strategies, parallel questions, and delayed answers. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (Discret. Appl. Math., 2004)

Preface. - Ferdinando Cicalese; Daniele Mundici; Ugo Vaccaro (Discret. Appl. Math., 2004)

Bounding the average length of optimal source codes via majorization theory. - Ferdinando Cicalese; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2004)

An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. - Ferdinando Cicalese; Eduardo Sany Laber (ESA, 2005)

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. - Ferdinando Cicalese; Peter Damaschke; Ugo Vaccaro (International Conference on Computational Science (2), 2005)

A new strategy for querying priced information. - Ferdinando Cicalese; Eduardo Sany Laber (STOC, 2005)

Searching with lies under error transition cost constraints. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe (Electron. Notes Discret. Math., 2005)

Q-ary Ulam-Rényi game with constrained lies. - Ferdinando Cicalese; Christian Deppe (Electron. Notes Discret. Math., 2005)

Optimal group testing algorithms with interval queries and their application to splice site detection. - Ferdinando Cicalese; Peter Damaschke; Ugo Vaccaro (Int. J. Bioinform. Res. Appl., 2005)

Faster Centralized Communication in Radio Networks. - Ferdinando Cicalese; Fredrik Manne; Qin Xin 001 (ISAAC, 2006)

A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2006)

2-Stage Fault Tolerant Interval Group Testing. - Ferdinando Cicalese; José Augusto Amgarten Quitzau (ISAAC, 2007)

Tunstall Parse Trees Optimum under Various Criteria. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2007)

Overlaps help: Improved bounds for group testing with interval queries. - Ferdinando Cicalese; Peter Damaschke; Libertad Tansini; Sören Werth (Discret. Appl. Math., 2007)

Function Evaluation Via Linear Programming in the Priced Information Model. - Ferdinando Cicalese; Eduardo Sany Laber (ICALP (1), 2008)

Computing with Priced Information: When the Value Makes the Price. - Ferdinando Cicalese; Martin Milanic (ISAAC, 2008)

Searching with lies under error cost constraints. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe (Discret. Appl. Math., 2008)

09281 Abstracts Collection - Search Methodologies. - Rudolf Ahlswede; Ferdinando Cicalese; Ugo Vaccaro (Search Methodologies, 2009)

Searching for Jumbled Patterns in Strings. - Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Stringology, 2009)

Faster Deterministic Communication in Radio Networks. - Ferdinando Cicalese; Fredrik Manne; Qin Xin 001 (Algorithmica, 2009)

On the Complexity of Searching in Trees: Average-case Minimization - Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (CoRR, 2009)

Two Batch Search With Lie Cost. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2009)

Superselectors: Efficient Constructions and Applications. - Ferdinando Cicalese; Ugo Vaccaro (ESA (1), 2010)

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (FUN, 2010)

A Better Bouncer's Algorithm. - Ferdinando Cicalese; Travis Gagie; Anthony J. Macula; Martin Milanic; Eberhard Triesch (FUN, 2010)

On the Complexity of Searching in Trees: Average-Case Minimization. - Tobias Jacobs; Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (ICALP (1), 2010)

On Greedy Algorithms for Decision Trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (ISAAC (2), 2010)

Efficient Reconstruction of RC-Equivalent Strings. - Ferdinando Cicalese; Péter L. Erdös; Zsuzsanna Lipták (IWOCA, 2010)

Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. - Ferdinando Cicalese; Martin Milanic (IWOCA, 2010)

Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic. - Ferdinando Cicalese; Daniele Mundici (Proof, Computation and Agency, 2011)

Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. - Ferdinando Cicalese; Martin Milanic; Ugo Vaccaro (FCT, 2011)

Binary Identification Problems for Weighted Trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Caio Dias Valentim (WADS, 2011)

Competitive evaluation of threshold functions in the priced information model. - Ferdinando Cicalese; Martin Milanic (Ann. Oper. Res., 2011)

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. - Ferdinando Cicalese; Travis Gagie; Eduardo Sany Laber; Martin Milanic (Discret. Appl. Math., 2011)

On the competitive ratio of evaluating priced functions. - Ferdinando Cicalese; Eduardo Sany Laber (J. ACM, 2011)

On the complexity of searching in trees and partially ordered structures. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (Theor. Comput. Sci., 2011)

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 (CPM, 2012)

The Multi-interval Ulam-Rényi Game. - Ferdinando Cicalese (FUN, 2012)

Graphs of separability at most 2. - Ferdinando Cicalese; Martin Milanic (Discret. Appl. Math., 2012)

Algorithms for Jumbled Pattern Matching in Strings. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Int. J. Found. Comput. Sci., 2012)

A linear algorithm for string reconstruction in the reverse complement equivalence model. - Ferdinando Cicalese; Péter L. Erdös; Zsuzsanna Lipták (J. Discrete Algorithms, 2012)

On Approximate Jumbled Pattern Matching in Strings. - Peter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták (Theory Comput. Syst., 2012)

The binary identification problem for weighted trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Caio Dias Valentim (Theor. Comput. Sci., 2012)

Information theoretic measures of distances and their econometric applications. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2013)

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. - Ferdinando Cicalese; Travis Gagie; Emanuele Giaquinta; Eduardo Sany Laber; Zsuzsanna Lipták; Romeo Rizzi; Alexandru I. Tomescu (SPIRE, 2013)

Guest Editorial for "Group Testing: models and applications". - Ferdinando Cicalese; Ely Porat (Algorithmica, 2013)

Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (CoRR, 2013)

On the approximability and exact algorithms for vector domination and related problems in graphs. - Ferdinando Cicalese; Martin Milanic; Ugo Vaccaro (Discret. Appl. Math., 2013)

Fault-Tolerant Search Algorithms - Reliable Computation with Unreliable Information - Ferdinando Cicalese (Springer, 2013)

How to go Viral: Cheaply and Quickly. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Joseph G. Peters; Ugo Vaccaro (FUN, 2014)

Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (ICML, 2014)

Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (ISAIM, 2014)

On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. - Eduardo Sany Laber; Wilfredo Bardales Roncalla; Ferdinando Cicalese (ISIT, 2014)

Improved Approximation Algorithms for the Average-Case Tree Searching Problem. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (Algorithmica, 2014)

Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (CoRR, 2014)

Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions. - Ferdinando Cicalese (Theory Comput. Syst., 2014)

Latency-bounded target set selection in social networks. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Ugo Vaccaro (Theor. Comput. Sci., 2014)

Approximating the maximum consecutive subsums of a sequence. - Ferdinando Cicalese; Eduardo Sany Laber; Oren Weimann; Raphael Yuster (Theor. Comput. Sci., 2014)

Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. - Wilfredo Bardales Roncalla; Eduardo Sany Laber; Ferdinando Cicalese (CoRR, 2015)

Approximating decision trees with value dependent testing costs. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (Inf. Process. Lett., 2015)

Spread of influence in weighted networks under time and budget constraints. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Joseph G. Peters; Ugo Vaccaro (Theor. Comput. Sci., 2015)

On the complexity of the vector connectivity problem. - Ferdinando Cicalese; Martin Milanic; Romeo Rizzi (Theor. Comput. Sci., 2015)

Approximating probability distributions with short vectors, via information theoretic distance measures. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2016)

On the tree search problem with non-uniform costs. - Ferdinando Cicalese; Balázs Keszegh; Bernard Lidický; Dömötör Pálvölgyi; Tomás Valla (Theor. Comput. Sci., 2016)

H(X) vs. H(f(X)). - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2017)

How to find a joint probability distribution of minimum entropy (almost) given the marginals. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2017)

Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (Algorithmica, 2017)

Trading Off Worst and Expected Cost in Decision Tree Problems. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (Algorithmica, 2017)

Maximum Entropy Interval Aggregations. - Ferdinando Cicalese; Ugo Vaccaro (ISIT, 2018)

Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (Algorithmica, 2018)

Approximation Algorithms for Clustering via Weighted Impurity Measures. - Ferdinando Cicalese; Eduardo Sany Laber (CoRR, 2018)

A Combinatorial Model of Two-Sided Search. - Harout K. Aydinian; Ferdinando Cicalese; Christian Deppe; Vladimir S. Lebedev (Int. J. Found. Comput. Sci., 2018)

Bubble-Flip - A new generation algorithm for prefix normal words. - Ferdinando Cicalese; Zsuzsanna Lipták; Massimiliano Rossi 001 (Theor. Comput. Sci., 2018)

Bounds on the Entropy of a Function of a Random Variable and Their Applications. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2018)

New results on information theoretic clustering. - Ferdinando Cicalese; Eduardo Sany Laber; Lucas Murtinho (ICML, 2019)

An Information Theoretic Approach to Probability Mass Function Truncation. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2019)

Minimum-Entropy Couplings and Their Applications. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2019)

On the Complexity of Directed Intersection Representation of DAGs. - Andrea Caucchiolo; Ferdinando Cicalese (COCOON, 2020)

Teaching with Limited Information on the Learner's Behaviour. - Ferdinando Cicalese; Sergio Filho; Eduardo Sany Laber; Marco Molinaro 001 (ICML, 2020)

On D-ary Fano Codes. - Ferdinando Cicalese; Eros Rossi (ISIT, 2020)

On the Tandem Duplication Distance. - Ferdinando Cicalese; Nicolò Pilati (CoRR, 2020)

On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice. - Ferdinando Cicalese; Massimiliano Rossi 001 (Theor. Comput. Sci., 2020)

Hardness of MSA with Selective Column Scoring. - Andrea Caucchiolo; Ferdinando Cicalese (ICTCS, 2021)

The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. - Ferdinando Cicalese; Nicolò Pilati (IWOCA, 2021)

On the Redundancy of D-Ary Fano Codes. - Ferdinando Cicalese; Massimiliano Rossi 001 (SOFSEM, 2021)

On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. - Ferdinando Cicalese; Eduardo Sany Laber (Discret. Appl. Math., 2021)

On infinite prefix normal words. - Ferdinando Cicalese; Zsuzsanna Lipták; Massimiliano Rossi 001 (Theor. Comput. Sci., 2021)

Information Theoretical Clustering Is Hard to Approximate. - Ferdinando Cicalese; Eduardo Sany Laber (IEEE Trans. Inf. Theory, 2021)

Using Random Forest Distances for Outlier Detection. - Antonella Mensi; Ferdinando Cicalese; Manuele Bicego (ICIAP (3), 2022)

Distance-Based Random Forest Clustering with Missing Data. - Matteo Raniero; Manuele Bicego; Ferdinando Cicalese (ICIAP (3), 2022)

On Constrained Intersection Representations of Graphs and Digraphs. - Ferdinando Cicalese; Clément Dallard; Martin Milanic (ISAAC, 2022)

On the Intractability Landscape of Digraph Intersection Representations. - Andrea Caucchiolo; Ferdinando Cicalese (IWOCA, 2022)

The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks. - Luca Marzari; Davide Corsi; Ferdinando Cicalese; Alessandro Farinelli (IJCAI, 2023)

On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation. - Manuele Bicego; Ferdinando Cicalese (ECML/PKDD (4), 2023)

RatioRF: A Novel Measure for Random Forest Clustering Based on the Tversky's Ratio Model. - Manuele Bicego; Ferdinando Cicalese; Antonella Mensi (IEEE Trans. Knowl. Data Eng., 2023)

Hardness and approximation of multiple sequence alignment with column score. - Andrea Caucchiolo; Ferdinando Cicalese (Theor. Comput. Sci., 2023)

Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees. - Luca Marzari; Davide Corsi; Enrico Marchesini; Alessandro Farinelli; Ferdinando Cicalese (AAAI, 2024)

On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. - Ferdinando Cicalese; Francesca Ugazio (DLT, 2024)

Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations. - Luca Marzari; Francesco Leofante; Ferdinando Cicalese; Alessandro Farinelli (ECAI, 2024)

An Interesting Property of Random Forest Distances with Respect to the Curse of Dimensionality. - Manuele Bicego; Ferdinando Cicalese (S+SSPR, 2024)

Computing Random Forest-distances in the presence of missing data. - Manuele Bicego; Ferdinando Cicalese (ACM Trans. Knowl. Discov. Data, 2024)

Decision trees with short explainable rules. - Victor Feitosa Souza; Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (Theor. Comput. Sci., 2025)

Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification. - Luca Marzari; Ferdinando Cicalese; Alessandro Farinelli (CoRR, 2025)