Ferdinando Cicalese

163 papers A* 9A 3B 24C 8Misc 12Journal 89Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Incongruity-sensitive access to highly compressed strings.
CoRR
Ferdinando Cicalese, Zsuzsanna Lipták, Travis Gagie, Gonzalo Navarro, Nicola Prezza, Cristian Urbina
2026 A* conf
On the Probabilistic Learnability of Compact Neural Network Preimage Bounds.
AAAI
Luca Marzari, Manuele Bicego, Ferdinando Cicalese, Alessandro Farinelli
2026 J jnl
Probabilistically robust counterfactual explanations under model changes.
Artif. Intell.
Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli
2026 J jnl
Verifying Online Safety Properties for Safe Deep Reinforcement Learning.
ACM Trans. Intell. Syst. Technol.
Luca Marzari, Ferdinando Cicalese, Alessandro Farinelli, Christopher Amato, Enrico Marchesini
2025 J jnl
Decision trees with short explainable rules.
Theor. Comput. Sci.
Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2025 J jnl
Hardness and approximability of bounded access Lempel Ziv coding.
Inf. Comput.
Ferdinando Cicalese, Francesca Ugazio
2025 J jnl
On constrained intersection representations of graphs and digraphs.
CoRR
Ferdinando Cicalese, Clément Dallard, Martin Milanic
2025 J jnl
On the Probabilistic Learnability of Compact Neural Network Preimage Bounds.
CoRR
Luca Marzari, Manuele Bicego, Ferdinando Cicalese, Alessandro Farinelli
2025 J jnl
Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification.
CoRR
Luca Marzari, Ferdinando Cicalese, Alessandro Farinelli
2025 J jnl
Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification.
J. Artif. Intell. Res.
Luca Marzari, Ferdinando Cicalese, Alessandro Farinelli
2024 — conf
An Interesting Property of Random Forest Distances with Respect to the Curse of Dimensionality.
S+SSPR
Manuele Bicego, Ferdinando Cicalese
2024 J jnl
Computing Random Forest-distances in the presence of missing data.
ACM Trans. Knowl. Discov. Data
Manuele Bicego, Ferdinando Cicalese
2024 A* conf
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees.
AAAI
Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese
2024 C conf
On the Complexity and Approximability of Bounded Access Lempel Ziv Coding.
DLT
Ferdinando Cicalese, Francesca Ugazio
2024 J jnl
On the complexity and approximability of Bounded access Lempel Ziv coding.
CoRR
Ferdinando Cicalese, Francesca Ugazio
2024 A conf
Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations.
ECAI
Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli
2024 J jnl
Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations.
CoRR
Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli
2023 J jnl
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees.
CoRR
Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese
2023 J jnl
Hardness and approximation of multiple sequence alignment with column score.
Theor. Comput. Sci.
Andrea Caucchiolo, Ferdinando Cicalese
2023 — conf
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation.
ECML/PKDD (4)
Manuele Bicego, Ferdinando Cicalese
2023 J jnl
RatioRF: A Novel Measure for Random Forest Clustering Based on the Tversky's Ratio Model.
IEEE Trans. Knowl. Data Eng.
Manuele Bicego, Ferdinando Cicalese, Antonella Mensi
2023 A* conf
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks.
IJCAI
Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli
2023 J jnl
The #DNN-Verification problem: Counting Unsafe Inputs for Deep Neural Networks.
CoRR
Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli
2022 A* conf
Decision Trees with Short Explainable Rules.
NeurIPS
Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2022 — conf
Distance-Based Random Forest Clustering with Missing Data.
ICIAP (3)
Matteo Raniero, Manuele Bicego, Ferdinando Cicalese
2022 B conf
On Constrained Intersection Representations of Graphs and Digraphs.
ISAAC
Ferdinando Cicalese, Clément Dallard, Martin Milanic
2022 C conf
On the Intractability Landscape of Digraph Intersection Representations.
IWOCA
Andrea Caucchiolo, Ferdinando Cicalese
2022 — conf
Using Random Forest Distances for Outlier Detection.
ICIAP (3)
Antonella Mensi, Ferdinando Cicalese, Manuele Bicego
2021 — conf
Hardness of MSA with Selective Column Scoring.
ICTCS
Andrea Caucchiolo, Ferdinando Cicalese
2021 J jnl
Information Theoretical Clustering Is Hard to Approximate.
IEEE Trans. Inf. Theory
Ferdinando Cicalese, Eduardo Sany Laber
2021 J jnl
On infinite prefix normal words.
Theor. Comput. Sci.
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
2021 B conf
On the Redundancy of D-Ary Fano Codes.
SOFSEM
Ferdinando Cicalese, Massimiliano Rossi
2021 J jnl
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem.
Discret. Appl. Math.
Ferdinando Cicalese, Eduardo Sany Laber
2021 C conf
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets.
IWOCA
Ferdinando Cicalese, Nicolò Pilati
2020 B conf
On D-ary Fano Codes.
ISIT
Ferdinando Cicalese, Eros Rossi
2020 Misc conf
On the Complexity of Directed Intersection Representation of DAGs.
COCOON
Andrea Caucchiolo, Ferdinando Cicalese
2020 J jnl
On the Tandem Duplication Distance.
CoRR
Ferdinando Cicalese, Nicolò Pilati
2020 J jnl
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice.
Theor. Comput. Sci.
Ferdinando Cicalese, Massimiliano Rossi
2020 A* conf
Teaching with Limited Information on the Learner's Behaviour.
ICML
Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro
2019 B conf
An Information Theoretic Approach to Probability Mass Function Truncation.
ISIT
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2019 J jnl
Minimum-Entropy Couplings and Their Applications.
IEEE Trans. Inf. Theory
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2019 J jnl
Minimum-Entropy Couplings and their Applications.
CoRR
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2019 A* conf
New results on information theoretic clustering.
ICML
Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho
2019 B conf
On Infinite Prefix Normal Words.
SOFSEM
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
2018 J jnl
A Combinatorial Model of Two-Sided Search.
Int. J. Found. Comput. Sci.
Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev
2018 J jnl
Approximation Algorithms for Clustering via Weighted Impurity Measures.
CoRR
Ferdinando Cicalese, Eduardo Sany Laber
2018 J jnl
Bounds on the Entropy of a Function of a Random Variable and Their Applications.
IEEE Trans. Inf. Theory
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2018 C conf
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words.
LATA
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
2018 J jnl
Bubble-Flip - A new generation algorithm for prefix normal words.
Theor. Comput. Sci.
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
2018 J jnl
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems.
Algorithmica
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
2018 J jnl
Information theoretical clustering is hard to approximate.
CoRR
Ferdinando Cicalese, Eduardo Sany Laber
2018 B conf
Maximum Entropy Interval Aggregations.
ISIT
Ferdinando Cicalese, Ugo Vaccaro
2018 J jnl
Maximum Entropy Interval Aggregations.
CoRR
Ferdinando Cicalese, Ugo Vaccaro
2018 J jnl
On Infinite Prefix Normal Words.
CoRR
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
2017 J jnl
Bounds on the Entropy of a Function of a Random Variable and their Applications.
CoRR
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2017 J jnl
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words.
CoRR
Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
2017 J jnl
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost.
Algorithmica
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
2017 B conf
H(X) vs. H(f(X)).
ISIT
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2017 J jnl
H(X) vs. H(f(X)).
CoRR
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2017 J jnl
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals.
CoRR
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2017 B conf
How to find a joint probability distribution of minimum entropy (almost) given the marginals.
ISIT
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2017 — conf
On the Multi-interval Ulam-Rényi game: For 3 Lies 4 Intervals Suffice.
ICTCS/CILC
Ferdinando Cicalese, Massimiliano Rossi
2017 J jnl
Trading Off Worst and Expected Cost in Decision Tree Problems.
Algorithmica
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
2016 B conf
A Combinatorial Model of Two-Sided Search.
SOFSEM
Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev
2016 B conf
Approximating probability distributions with short vectors, via information theoretic distance measures.
ISIT
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2016 J jnl
On the tree search problem with non-uniform costs.
Theor. Comput. Sci.
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
2015 J jnl
Approximating decision trees with value dependent testing costs.
Inf. Process. Lett.
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
2015 B ed.
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings
CPM
Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
2015 B conf
On the Tree Search Problem with Non-uniform Costs.
WG
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
2015 J jnl
On the complexity of the vector connectivity problem.
Theor. Comput. Sci.
Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
2015 J jnl
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.
CoRR
Wilfredo Bardales Roncalla, Eduardo Sany Laber, Ferdinando Cicalese
2015 J jnl
Spread of Influence in Weighted Networks under Time and Budget Constraints.
CoRR
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2015 J jnl
Spread of influence in weighted networks under time and budget constraints.
Theor. Comput. Sci.
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2015 B conf
Trading off Worst and Expected Cost in Decision Tree Problems.
ISAAC
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
2014 J jnl
Approximating the maximum consecutive subsums of a sequence.
Theor. Comput. Sci.
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2014 A* conf
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost.
ICML
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
2014 Misc conf
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost.
ISAIM
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
2014 Misc conf
How to go Viral: Cheaply and Quickly.
FUN
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2014 J jnl
How to go Viral: Cheaply and Quickly.
CoRR
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2014 J jnl
Improved Approximation Algorithms for the Average-Case Tree Searching Problem.
Algorithmica
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
2014 J jnl
Latency-bounded target set selection in social networks.
Theor. Comput. Sci.
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
2014 B conf
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.
ISIT
Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese
2014 J jnl
On the Tree Search Problem with Non-uniform Costs.
CoRR
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
2014 J jnl
On the complexity of the vector connectivity problem.
CoRR
Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
2014 J jnl
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions.
Theory Comput. Syst.
Ferdinando Cicalese
2014 J jnl
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model.
CoRR
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
2013 J jnl
Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis.
CoRR
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
2013 — book
Fault-Tolerant Search Algorithms - Reliable Computation with Unreliable Information
Ferdinando Cicalese
2013 J jnl
Guest Editorial for "Group Testing: models and applications".
Algorithmica
Ferdinando Cicalese, Ely Porat
2013 J jnl
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs
CoRR
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
2013 C conf
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
SPIRE
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
2013 — ed.
Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe
2013 B conf
Information theoretic measures of distances and their econometric applications.
ISIT
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2013 J jnl
Latency-Bounded Target Set Selection in Social Networks
CoRR
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
2013 C conf
Latency-Bounded Target Set Selection in Social Networks.
CiE
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
2013 J jnl
On the approximability and exact algorithms for vector domination and related problems in graphs.
Discret. Appl. Math.
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
2012 J jnl
A linear algorithm for string reconstruction in the reverse complement equivalence model.
J. Discrete Algorithms
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
2012 J jnl
Algorithms for Jumbled Pattern Matching in Strings.
Int. J. Found. Comput. Sci.
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
2012 J jnl
Graphs of separability at most 2.
Discret. Appl. Math.
Ferdinando Cicalese, Martin Milanic
2012 B conf
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.
CPM
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2012 J jnl
On Approximate Jumbled Pattern Matching in Strings.
Theory Comput. Syst.
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
2012 Misc conf
The Multi-interval Ulam-Rényi Game.
FUN
Ferdinando Cicalese
2012 J jnl
The binary identification problem for weighted trees.
Theor. Comput. Sci.
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim
2011 J jnl
Algorithms for Jumbled Pattern Matching in Strings
CoRR
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
2011 B conf
Binary Identification Problems for Weighted Trees.
WADS
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim
2011 J jnl
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.
Discret. Appl. Math.
Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
2011 J jnl
Competitive evaluation of threshold functions in the priced information model.
Ann. Oper. Res.
Ferdinando Cicalese, Martin Milanic
2011 B conf
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs.
FCT
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
2011 J jnl
On the competitive ratio of evaluating priced functions.
J. ACM
Ferdinando Cicalese, Eduardo Sany Laber
2011 J jnl
On the complexity of searching in trees and partially ordered structures.
Theor. Comput. Sci.
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
2011 — ch.
Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic.
Proof, Computation and Agency
Ferdinando Cicalese, Daniele Mundici
2010 Misc conf
A Better Bouncer's Algorithm.
FUN
Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch
2010 J jnl
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case
CoRR
Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
2010 C conf
Efficient Reconstruction of RC-Equivalent Strings.
IWOCA
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
2010 C conf
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences.
IWOCA
Ferdinando Cicalese, Martin Milanic
2010 J jnl
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
CoRR
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
2010 — conf
On Greedy Algorithms for Decision Trees.
ISAAC (2)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
2010 Misc conf
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.
FUN
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
2010 — conf
On the Complexity of Searching in Trees: Average-Case Minimization.
ICALP (1)
Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2010 J jnl
Superselectors: Efficient Constructions and Applications
CoRR
Ferdinando Cicalese, Ugo Vaccaro
2010 — conf
Superselectors: Efficient Constructions and Applications.
ESA (1)
Ferdinando Cicalese, Ugo Vaccaro
2009 — conf
09281 Abstracts Collection - Search Methodologies.
Search Methodologies
Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro
2009 J jnl
Faster Deterministic Communication in Radio Networks.
Algorithmica
Ferdinando Cicalese, Fredrik Manne, Qin Xin
2009 J jnl
On the Complexity of Searching in Trees: Average-case Minimization
CoRR
Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2009 — ed.
Search Methodologies, 05.07. - 10.07.2009
Search Methodologies
Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro
2009 Misc conf
Searching for Jumbled Patterns in Strings.
PSC
Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
2009 J jnl
Two Batch Search With Lie Cost.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro
2008 B conf
Computing with Priced Information: When the Value Makes the Price.
ISAAC
Ferdinando Cicalese, Martin Milanic
2008 — conf
Function Evaluation Via Linear Programming in the Priced Information Model.
ICALP (1)
Ferdinando Cicalese, Eduardo Sany Laber
2008 J jnl
Searching with lies under error cost constraints.
Discret. Appl. Math.
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
2007 B conf
2-Stage Fault Tolerant Interval Group Testing.
ISAAC
Ferdinando Cicalese, José Augusto Amgarten Quitzau
2007 J jnl
Overlaps help: Improved bounds for group testing with interval queries.
Discret. Appl. Math.
Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
2007 B conf
Tunstall Parse Trees Optimum under Various Criteria.
ISIT
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2006 J jnl
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes.
IEEE Trans. Inf. Theory
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2006 B conf
Faster Centralized Communication in Radio Networks.
ISAAC
Ferdinando Cicalese, Fredrik Manne, Qin Xin
2006 A* conf
On the competitive ratio of evaluating priced functions.
SODA
Ferdinando Cicalese, Eduardo Sany Laber
2006 — conf
Q-Ary Ulam-Renyi Game with Constrained Lies.
GTIT-C
Ferdinando Cicalese, Christian Deppe
2005 A* conf
A new strategy for querying priced information.
STOC
Ferdinando Cicalese, Eduardo Sany Laber
2005 A conf
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.
ESA
Ferdinando Cicalese, Eduardo Sany Laber
2005 Misc conf
Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection.
International Conference on Computational Science (2)
Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
2005 J jnl
Optimal group testing algorithms with interval queries and their application to splice site detection.
Int. J. Bioinform. Res. Appl.
Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
2005 Misc conf
Overlaps Help: Improved Bounds for Group Testing with Interval Queries.
COCOON
Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
2005 J jnl
Q-ary Ulam-Rényi game with constrained lies.
Electron. Notes Discret. Math.
Ferdinando Cicalese, Christian Deppe
2005 J jnl
Searching with lies under error transition cost constraints.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
2004 J jnl
Bounding the average length of optimal source codes via majorization theory.
IEEE Trans. Inf. Theory
Ferdinando Cicalese, Ugo Vaccaro
2004 J jnl
On searching strategies, parallel questions, and delayed answers.
Discret. Appl. Math.
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2004 J jnl
Preface.
Discret. Appl. Math.
Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro
2004 Misc conf
Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.
COCOON
Ferdinando Cicalese, Christian Deppe, Daniele Mundici
2003 J jnl
Binary search with delayed and missing answers.
Inf. Process. Lett.
Ferdinando Cicalese, Ugo Vaccaro
2003 B conf
Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests.
ISAAC
Ferdinando Cicalese, Christian Deppe
2002 J jnl
Least adaptive optimal search with unreliable tests.
Theor. Comput. Sci.
Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro
2002 J jnl
Supermodularity and subadditivity properties of the entropy on the majorization lattice.
IEEE Trans. Inf. Theory
Ferdinando Cicalese, Ugo Vaccaro
2000 J jnl
An improved heuristic for "Ulam-Rényi game".
Inf. Process. Lett.
Ferdinando Cicalese, Ugo Vaccaro
2000 — conf
Least Adaptive Optimal Search with Unreliable Tests.
SWAT
Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici
2000 — conf
Optimal Approximation of Uniform Distributions with a Biased Coin.
ICALP Satellite Workshops
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
2000 Misc conf
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.
COCOON
Ferdinando Cicalese, Daniele Mundici
2000 J jnl
Optimal Strategies Against a Liar.
Theor. Comput. Sci.
Ferdinando Cicalese, Ugo Vaccaro
2000 J jnl
Perfect Two-Fault Tolerant Search with Minimum Adaptiveness.
Adv. Appl. Math.
Ferdinando Cicalese, Daniele Mundici
2000 B conf
coping with Delays and Time-Outs in Binary Search Procedures.
ISAAC
Ferdinando Cicalese, Ugo Vaccaro
1999 Misc conf
A Fuzzy Evolutionary Framework for Adaptive Agents.
SAC
Ferdinando Cicalese, Antonio Di Nola, Vincenzo Loia
1999 A conf
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness.
ESA
Ferdinando Cicalese, Daniele Mundici
1998 J jnl
A fuzzy evolutionary approach to the classification problem.
J. Intell. Fuzzy Syst.
Ferdinando Cicalese, Vincenzo Loia
1996 J jnl
Classifying through a fuzzy algebraic structure.
Fuzzy Sets Syst.
Antonio Gisolfi, Ferdinando Cicalese