CICALESE, Ferdinando
CICALESE, Ferdinando
DIPARTIMENTO DI INFORMATICA
A Combinatorial Model of Two-Sided Search
2018-01-01 Aydinian, Harout; Cicalese, Ferdinando; Deppe, Christian; Lebedev, Vladimir
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes
2006-01-01 Cicalese, Ferdinando; Gargano, L; Vaccaro, U.
Algorithms for Jumbled Pattern Matching in Strings
2012-01-01 Péter, Burcsi; Cicalese, Ferdinando; Gabriele, Fici; Liptak, Zsuzsanna
Approximating decision trees with value dependent testing costs
2015-01-01 Saettler, Aline; Laber, Eduardo; Cicalese, Ferdinando
Approximating the maximum consecutive subsums of a sequence
2014-01-01 Cicalese, Ferdinando; E. S., Laber; O., Weimann; R., Yuster
Bounds on the Entropy of a Function of a Random Variable and their Applications
2018-01-01 Cicalese, Ferdinando; Gargano, Luisa; Vaccaro, Ugo
Bubble-Flip—A new generation algorithm for prefix normal words
2018-01-01 Cicalese, Ferdinando; Lipták, Zsuzsanna; Rossi, Massimiliano
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case
2011-01-01 Cicalese, Ferdinando; Travis, Gagie; Eduardo, Laber; Martin, Milanic
Competitive Evaluation of Threshold Functions in the Priced Information Model
2011-01-01 Cicalese, Ferdinando; Martin, Milanic
Computing Random Forest-distances in the presence of missing data
2024-01-01 Bicego, Manuele; Cicalese, Ferdinando
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems
2018-01-01 Saettler, A; Laber, E; Cicalese, F
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost
2017-01-01 Cicalese, Ferdinando; Laber, Eduardo; Saettler, Aline
Faster Deterministic Communication in Radio Networks
2009-01-01 Cicalese, Ferdinando; Manne, F; Xin, Q.
Graphs of separability at most two
2012-01-01 Cicalese, Ferdinando; Martin, Milanič
Guest Editorial for "Group Testing: models and applications"
2013-01-01 Cicalese, Ferdinando; Porat, Ely
Hardness and approximation of multiple sequence alignment with column score
2023-01-01 Caucchiolo, A; Cicalese, F
Improved Approximation Algorithms for the Average-Case Tree Searching Problem
2014-01-01 Cicalese, Ferdinando; T., Jacobs; E. S., Laber; M., Molinaro
Information Theoretical Clustering Is Hard to Approximate
2021-01-01 Cicalese, Ferdinando; Sany Laber, Eduardo
Latency-bounded target set selection in social networks
2014-01-01 Cicalese, Ferdinando; Gennaro, Cordasco; Luisa, Gargano; Martin, Milanic; Ugo, Vaccaro
Least adaptive optimal search with unreliable tests
2002-01-01 Cicalese, Ferdinando; Mundici, Daniele; Vaccaro, Ugo
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A Combinatorial Model of Two-Sided Search | 1-gen-2018 | Aydinian, Harout; Cicalese, Ferdinando; Deppe, Christian; Lebedev, Vladimir | |
| A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes | 1-gen-2006 | Cicalese, Ferdinando; Gargano, L; Vaccaro, U. | |
| Algorithms for Jumbled Pattern Matching in Strings | 1-gen-2012 | Péter, Burcsi; Cicalese, Ferdinando; Gabriele, Fici; Liptak, Zsuzsanna | |
| Approximating decision trees with value dependent testing costs | 1-gen-2015 | Saettler, Aline; Laber, Eduardo; Cicalese, Ferdinando | |
| Approximating the maximum consecutive subsums of a sequence | 1-gen-2014 | Cicalese, Ferdinando; E. S., Laber; O., Weimann; R., Yuster | |
| Bounds on the Entropy of a Function of a Random Variable and their Applications | 1-gen-2018 | Cicalese, Ferdinando; Gargano, Luisa; Vaccaro, Ugo | |
| Bubble-Flip—A new generation algorithm for prefix normal words | 1-gen-2018 | Cicalese, Ferdinando; Lipták, Zsuzsanna; Rossi, Massimiliano | |
| Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case | 1-gen-2011 | Cicalese, Ferdinando; Travis, Gagie; Eduardo, Laber; Martin, Milanic | |
| Competitive Evaluation of Threshold Functions in the Priced Information Model | 1-gen-2011 | Cicalese, Ferdinando; Martin, Milanic | |
| Computing Random Forest-distances in the presence of missing data | 1-gen-2024 | Bicego, Manuele; Cicalese, Ferdinando | |
| Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems | 1-gen-2018 | Saettler, A; Laber, E; Cicalese, F | |
| Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost | 1-gen-2017 | Cicalese, Ferdinando; Laber, Eduardo; Saettler, Aline | |
| Faster Deterministic Communication in Radio Networks | 1-gen-2009 | Cicalese, Ferdinando; Manne, F; Xin, Q. | |
| Graphs of separability at most two | 1-gen-2012 | Cicalese, Ferdinando; Martin, Milanič | |
| Guest Editorial for "Group Testing: models and applications" | 1-gen-2013 | Cicalese, Ferdinando; Porat, Ely | |
| Hardness and approximation of multiple sequence alignment with column score | 1-gen-2023 | Caucchiolo, A; Cicalese, F | |
| Improved Approximation Algorithms for the Average-Case Tree Searching Problem | 1-gen-2014 | Cicalese, Ferdinando; T., Jacobs; E. S., Laber; M., Molinaro | |
| Information Theoretical Clustering Is Hard to Approximate | 1-gen-2021 | Cicalese, Ferdinando; Sany Laber, Eduardo | |
| Latency-bounded target set selection in social networks | 1-gen-2014 | Cicalese, Ferdinando; Gennaro, Cordasco; Luisa, Gargano; Martin, Milanic; Ugo, Vaccaro | |
| Least adaptive optimal search with unreliable tests | 1-gen-2002 | Cicalese, Ferdinando; Mundici, Daniele; Vaccaro, Ugo |