Ferdinando Cicalese

Francesca Ugazio

CoRR, 2024

Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Hardness and approximation of multiple sequence alignment with column score.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

RatioRF: A Novel Measure for Random Forest Clustering Based on the Tversky's Ratio Model.

[BibT_eX]

[DOI]

Antonella Mensi

IEEE Trans. Knowl. Data Eng., 2023

On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Decision Trees with Short Explainable Rules.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On the Intractability Landscape of Digraph Intersection Representations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

On Constrained Intersection Representations of Graphs and Digraphs.

[BibT_eX]

[DOI]

Clément Dallard

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Distance-Based Random Forest Clustering with Missing Data.

[BibT_eX]

[DOI]

Matteo Raniero

Proceedings of the Image Analysis and Processing - ICIAP 2022, 2022

Using Random Forest Distances for Outlier Detection.

[BibT_eX]

[DOI]

Antonella Mensi

Proceedings of the Image Analysis and Processing - ICIAP 2022, 2022

2021

Information Theoretical Clustering Is Hard to Approximate.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On infinite prefix normal words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On the Redundancy of D-Ary Fano Codes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets.

[BibT_eX]

[DOI]

Nicolò Pilati

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Hardness of MSA with Selective Column Scoring.

[BibT_eX]

[DOI]

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020

On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Tandem Duplication Distance.

[BibT_eX]

[DOI]

Nicolò Pilati

CoRR, 2020

On D-ary Fano Codes.

[BibT_eX]

[DOI]

Eros Rossi

Proceedings of the IEEE International Symposium on Information Theory, 2020

Teaching with Limited Information on the Learner's Behaviour.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

On the Complexity of Directed Intersection Representation of DAGs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Minimum-Entropy Couplings and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

An Information Theoretic Approach to Probability Mass Function Truncation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

New results on information theoretic clustering.

[BibT_eX]

[DOI]

Lucas Murtinho

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Bounds on the Entropy of a Function of a Random Variable and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Bubble-Flip - A new generation algorithm for prefix normal words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A Combinatorial Model of Two-Sided Search.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Approximation Algorithms for Clustering via Weighted Impurity Measures.

[BibT_eX]

[DOI]

CoRR, 2018

Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems.

[BibT_eX]

[DOI]

Algorithmica, 2018

Maximum Entropy Interval Aggregations.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Trading Off Worst and Expected Cost in Decision Tree Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost.

[BibT_eX]

[DOI]

Algorithmica, 2017

How to find a joint probability distribution of minimum entropy (almost) given the marginals.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

H(X) vs. H(f(X)).

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

On the tree search problem with non-uniform costs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Approximating probability distributions with short vectors, via information theoretic distance measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

On the complexity of the vector connectivity problem.

[BibT_eX]

[DOI]

Romeo Rizzi

Theor. Comput. Sci., 2015

Spread of influence in weighted networks under time and budget constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Approximating decision trees with value dependent testing costs.

[BibT_eX]

[DOI]

Wilfredo Bardales Roncalla

Inf. Process. Lett., 2015

Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Approximating the maximum consecutive subsums of a sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Latency-bounded target set selection in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model.

[BibT_eX]

[DOI]

CoRR, 2014

Improved Approximation Algorithms for the Average-Case Tree Searching Problem.

[BibT_eX]

[DOI]

Algorithmica, 2014

On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.

[BibT_eX]

[DOI]

Wilfredo Bardales Roncalla

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost.

[BibT_eX]

[DOI]

Proceedings of the 31th International Conference on Machine Learning, 2014

How to go Viral: Cheaply and Quickly.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Fault-Tolerant Search Algorithms - Reliable Computation with Unreliable Information

[BibT_eX]

[DOI]

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-17326-4, 2013

On the approximability and exact algorithms for vector domination and related problems in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis.

[BibT_eX]

[DOI]

CoRR, 2013

Guest Editorial for "Group Testing: models and applications".

[BibT_eX]

[DOI]

Ely Porat

Algorithmica, 2013

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Information theoretic measures of distances and their econometric applications.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

The binary identification problem for weighted trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On Approximate Jumbled Pattern Matching in Strings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

A linear algorithm for string reconstruction in the reverse complement equivalence model.

[BibT_eX]

[DOI]

Péter L. Erdös

J. Discrete Algorithms, 2012

Algorithms for Jumbled Pattern Matching in Strings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Graphs of separability at most 2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

The Multi-interval Ulam-Rényi Game.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

On the complexity of searching in trees and partially ordered structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the competitive ratio of evaluating priced functions.

[BibT_eX]

[DOI]

J. ACM, 2011

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Competitive evaluation of threshold functions in the priced information model.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

Binary Identification Problems for Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic.

[BibT_eX]

[DOI]

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

2010

Graphs of Separability at Most Two: Structural Characterizations and Their Consequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Efficient Reconstruction of RC-Equivalent Strings.

[BibT_eX]

[DOI]

Péter L. Erdös

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

On Greedy Algorithms for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

On the Complexity of Searching in Trees: Average-Case Minimization.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

A Better Bouncer's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Superselectors: Efficient Constructions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Two Batch Search With Lie Cost.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On the Complexity of Searching in Trees: Average-case Minimization

[BibT_eX]

[DOI]

Marco Molinaro

CoRR, 2009

Faster Deterministic Communication in Radio Networks.

[BibT_eX]

[DOI]

Fredrik Manne

Qin Xin

Algorithmica, 2009

Searching for Jumbled Patterns in Strings.

[BibT_eX]

[DOI]

Gabriele Fici

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

09281 Abstracts Collection - Search Methodologies.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

2008

Searching with lies under error cost constraints.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Discret. Appl. Math., 2008

Computing with Priced Information: When the Value Makes the Price.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Function Evaluation Via Linear Programming in the Priced Information Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Overlaps help: Improved bounds for group testing with interval queries.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Tunstall Parse Trees Optimum under Various Criteria.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2-Stage Fault Tolerant Interval Group Testing.

[BibT_eX]

[DOI]

José Augusto Amgarten Quitzau

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Faster Centralized Communication in Radio Networks.

[BibT_eX]

[DOI]

Fredrik Manne

Qin Xin

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Optimal group testing algorithms with interval queries and their application to splice site detection.

[BibT_eX]

[DOI]

Peter Damaschke

Int. J. Bioinform. Res. Appl., 2005

Q-ary Ulam-Rényi game with constrained lies.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Searching with lies under error transition cost constraints.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Electron. Notes Discret. Math., 2005

A new strategy for querying priced information.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection.

[BibT_eX]

[DOI]

Peter Damaschke

Proceedings of the Computational Science, 2005

An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Bounding the average length of optimal source codes via majorization theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

On searching strategies, parallel questions, and delayed answers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Binary search with delayed and missing answers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Supermodularity and subadditivity properties of the entropy on the majorization lattice.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Least adaptive optimal search with unreliable tests.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2000

Optimal Strategies Against a Liar.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

An improved heuristic for "Ulam-Rényi game".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Perfect Two-Fault Tolerant Search with Minimum Adaptiveness.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2000

coping with Delays and Time-Outs in Binary Search Procedures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Optimal Approximation of Uniform Distributions with a Biased Coin.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

A Fuzzy Evolutionary Framework for Adaptive Agents.

[BibT_eX]

[DOI]

Antonio Di Nola

Vincenzo Loia

Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

A fuzzy evolutionary approach to the classification problem.

[BibT_eX]

[DOI]

Vincenzo Loia

J. Intell. Fuzzy Syst., 1998

1996

Classifying through a fuzzy algebraic structure.

[BibT_eX]

[DOI]

Antonio Gisolfi