default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFerdinando Cicalese
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Manuele Bicego
, Ferdinando Cicalese:
Computing Random Forest-distances in the presence of missing data. ACM Trans. Knowl. Discov. Data 18(7): 180 (2024)- [c66]Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese:
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees. AAAI 2024: 21387-21394 - [c65]Ferdinando Cicalese, Francesca Ugazio:
On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. DLT 2024: 114-130 - [c64]Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli:
Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations. ECAI 2024: 1059-1066 - [i29]Ferdinando Cicalese, Francesca Ugazio:
On the complexity and approximability of Bounded access Lempel Ziv coding. CoRR abs/2403.15871 (2024) - [i28]Luca Marzari, Francesco Leofante, Ferdinando Cicalese, Alessandro Farinelli:
Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations. CoRR abs/2407.07482 (2024) - 2023
- [j51]Andrea Caucchiolo, Ferdinando Cicalese:
Hardness and approximation of multiple sequence alignment with column score. Theor. Comput. Sci. 946: 113683 (2023) - [j50]Manuele Bicego, Ferdinando Cicalese, Antonella Mensi:
RatioRF: A Novel Measure for Random Forest Clustering Based on the Tversky's Ratio Model. IEEE Trans. Knowl. Data Eng. 35(1): 830-841 (2023) - [c63]Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli:
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks. IJCAI 2023: 217-224 - [c62]Manuele Bicego, Ferdinando Cicalese:
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation. ECML/PKDD (4) 2023: 645-660 - [i27]Luca Marzari, Davide Corsi, Ferdinando Cicalese, Alessandro Farinelli:
The #DNN-Verification problem: Counting Unsafe Inputs for Deep Neural Networks. CoRR abs/2301.07068 (2023) - [i26]Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli, Ferdinando Cicalese:
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees. CoRR abs/2308.09842 (2023) - 2022
- [c61]Antonella Mensi, Ferdinando Cicalese, Manuele Bicego:
Using Random Forest Distances for Outlier Detection. ICIAP (3) 2022: 75-86 - [c60]Matteo Raniero, Manuele Bicego, Ferdinando Cicalese:
Distance-Based Random Forest Clustering with Missing Data. ICIAP (3) 2022: 121-132 - [c59]Ferdinando Cicalese, Clément Dallard, Martin Milanic:
On Constrained Intersection Representations of Graphs and Digraphs. ISAAC 2022: 38:1-38:15 - [c58]Andrea Caucchiolo, Ferdinando Cicalese:
On the Intractability Landscape of Digraph Intersection Representations. IWOCA 2022: 270-284 - [c57]Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
Decision Trees with Short Explainable Rules. NeurIPS 2022 - 2021
- [j49]Ferdinando Cicalese, Eduardo Sany Laber:
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. Discret. Appl. Math. 289: 503-515 (2021) - [j48]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On infinite prefix normal words. Theor. Comput. Sci. 859: 134-148 (2021) - [j47]Ferdinando Cicalese, Eduardo Sany Laber:
Information Theoretical Clustering Is Hard to Approximate. IEEE Trans. Inf. Theory 67(1): 586-597 (2021) - [c56]Andrea Caucchiolo, Ferdinando Cicalese:
Hardness of MSA with Selective Column Scoring. ICTCS 2021: 317-327 - [c55]Ferdinando Cicalese, Nicolò Pilati:
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. IWOCA 2021: 179-193 - [c54]Ferdinando Cicalese, Massimiliano Rossi:
On the Redundancy of D-Ary Fano Codes. SOFSEM 2021: 263-277 - 2020
- [j46]Ferdinando Cicalese, Massimiliano Rossi:
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice. Theor. Comput. Sci. 809: 339-356 (2020) - [c53]Andrea Caucchiolo, Ferdinando Cicalese:
On the Complexity of Directed Intersection Representation of DAGs. COCOON 2020: 554-565 - [c52]Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro:
Teaching with Limited Information on the Learner's Behaviour. ICML 2020: 2016-2026 - [c51]Ferdinando Cicalese, Eros Rossi:
On D-ary Fano Codes. ISIT 2020: 2365-2370 - [i25]Ferdinando Cicalese, Nicolò Pilati:
On the Tandem Duplication Distance. CoRR abs/2004.02338 (2020)
2010 – 2019
- 2019
- [j45]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Minimum-Entropy Couplings and Their Applications. IEEE Trans. Inf. Theory 65(6): 3436-3451 (2019) - [c50]Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho:
New results on information theoretic clustering. ICML 2019: 1242-1251 - [c49]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
An Information Theoretic Approach to Probability Mass Function Truncation. ISIT 2019: 702-706 - [c48]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. SOFSEM 2019: 122-135 - [i24]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Minimum-Entropy Couplings and their Applications. CoRR abs/1901.07530 (2019) - 2018
- [j44]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 80(11): 3431-3436 (2018) - [j43]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. Int. J. Found. Comput. Sci. 29(4): 481-504 (2018) - [j42]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A new generation algorithm for prefix normal words. Theor. Comput. Sci. 743: 38-52 (2018) - [j41]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Bounds on the Entropy of a Function of a Random Variable and Their Applications. IEEE Trans. Inf. Theory 64(4): 2220-2230 (2018) - [c47]Ferdinando Cicalese, Ugo Vaccaro:
Maximum Entropy Interval Aggregations. ISIT 2018: 1764-1768 - [c46]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. LATA 2018: 207-219 - [i23]Ferdinando Cicalese, Ugo Vaccaro:
Maximum Entropy Interval Aggregations. CoRR abs/1805.05375 (2018) - [i22]Ferdinando Cicalese, Eduardo Sany Laber:
Approximation Algorithms for Clustering via Weighted Impurity Measures. CoRR abs/1807.05241 (2018) - [i21]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. CoRR abs/1811.06273 (2018) - [i20]Ferdinando Cicalese, Eduardo Sany Laber:
Information theoretical clustering is hard to approximate. CoRR abs/1812.07075 (2018) - 2017
- [j40]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. Algorithmica 79(3): 763-796 (2017) - [j39]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 79(3): 886-908 (2017) - [c45]Ferdinando Cicalese, Massimiliano Rossi:
On the Multi-interval Ulam-Rényi game: For 3 Lies 4 Intervals Suffice. ICTCS/CILC 2017: 39-50 - [c44]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
H(X) vs. H(f(X)). ISIT 2017: 51-55 - [c43]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
How to find a joint probability distribution of minimum entropy (almost) given the marginals. ISIT 2017: 2173-2177 - [i19]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals. CoRR abs/1701.05243 (2017) - [i18]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
H(X) vs. H(f(X)). CoRR abs/1704.07059 (2017) - [i17]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. CoRR abs/1712.05876 (2017) - [i16]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Bounds on the Entropy of a Function of a Random Variable and their Applications. CoRR abs/1712.07906 (2017) - 2016
- [j38]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the tree search problem with non-uniform costs. Theor. Comput. Sci. 647: 22-32 (2016) - [c42]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Approximating probability distributions with short vectors, via information theoretic distance measures. ISIT 2016: 1138-1142 - [c41]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. SOFSEM 2016: 148-160 - 2015
- [j37]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Approximating decision trees with value dependent testing costs. Inf. Process. Lett. 115(6-8): 594-599 (2015) - [j36]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. 586: 40-58 (2015) - [j35]Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. Theor. Comput. Sci. 591: 60-71 (2015) - [c40]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading off Worst and Expected Cost in Decision Tree Problems. ISAAC 2015: 223-234 - [c39]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. WG 2015: 90-102 - [e3]Ferdinando Cicalese, Ely Porat, Ugo Vaccaro:
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science 9133, Springer 2015, ISBN 978-3-319-19928-3 [contents] - [i15]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of Influence in Weighted Networks under Time and Budget Constraints. CoRR abs/1502.05599 (2015) - [i14]Wilfredo Bardales Roncalla, Eduardo Sany Laber, Ferdinando Cicalese:
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. CoRR abs/1509.05445 (2015) - 2014
- [j34]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68(4): 1045-1074 (2014) - [j33]Ferdinando Cicalese:
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions. Theory Comput. Syst. 54(4): 578-594 (2014) - [j32]Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525: 130-137 (2014) - [j31]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-bounded target set selection in social networks. Theor. Comput. Sci. 535: 1-15 (2014) - [c38]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. FUN 2014: 100-112 - [c37]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. ICML 2014: 414-422 - [c36]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. ISAIM 2014 - [c35]Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese:
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. ISIT 2014: 1807-1811 - [i13]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. CoRR abs/1404.3033 (2014) - [i12]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. CoRR abs/1404.4504 (2014) - [i11]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. CoRR abs/1406.3655 (2014) - [i10]Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. CoRR abs/1412.2559 (2014) - 2013
- [b1]Ferdinando Cicalese:
Fault-Tolerant Search Algorithms - Reliable Computation with Unreliable Information. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2013, ISBN 978-3-642-17326-4, pp. 1-198 - [j30]Ferdinando Cicalese, Ely Porat:
Guest Editorial for "Group Testing: models and applications". Algorithmica 67(3): 293-294 (2013) - [j29]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. 161(6): 750-767 (2013) - [c34]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-Bounded Target Set Selection in Social Networks. CiE 2013: 65-77 - [c33]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Information theoretic measures of distances and their econometric applications. ISIT 2013: 409-413 - [c32]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [e2]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe:
Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science 7777, Springer 2013, ISBN 978-3-642-36898-1 [contents] - [i9]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-Bounded Target Set Selection in Social Networks. CoRR abs/1303.6785 (2013) - [i8]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i7]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. CoRR abs/1309.2796 (2013) - 2012
- [j28]Ferdinando Cicalese, Martin Milanic:
Graphs of separability at most 2. Discret. Appl. Math. 160(6): 685-696 (2012) - [j27]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. Int. J. Found. Comput. Sci. 23(2): 357-374 (2012) - [j26]Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták:
A linear algorithm for string reconstruction in the reverse complement equivalence model. J. Discrete Algorithms 14: 37-54 (2012) - [j25]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Approximate Jumbled Pattern Matching in Strings. Theory Comput. Syst. 50(1): 35-51 (2012) - [j24]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
The binary identification problem for weighted trees. Theor. Comput. Sci. 459: 100-112 (2012) - [c31]Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM 2012: 149-158 - [c30]Ferdinando Cicalese:
The Multi-interval Ulam-Rényi Game. FUN 2012: 69-80 - 2011
- [j23]Ferdinando Cicalese, Martin Milanic:
Competitive evaluation of threshold functions in the priced information model. Ann. Oper. Res. 188(1): 111-132 (2011) - [j22]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. 159(11): 1070-1078 (2011) - [j21]Ferdinando Cicalese, Eduardo Sany Laber:
On the competitive ratio of evaluating priced functions. J. ACM 58(3): 9:1-9:40 (2011) - [j20]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412(50): 6879-6896 (2011) - [c29]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT 2011: 288-297 - [c28]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
Binary Identification Problems for Weighted Trees. WADS 2011: 255-266 - [p1]Ferdinando Cicalese, Daniele Mundici:
Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic. Proof, Computation and Agency 2011: 115-131 - [i6]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. CoRR abs/1102.1746 (2011) - 2010
- [c27]Ferdinando Cicalese, Ugo Vaccaro:
Superselectors: Efficient Constructions and Applications. ESA (1) 2010: 207-218 - [c26]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. FUN 2010: 89-101 - [c25]Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch:
A Better Bouncer's Algorithm. FUN 2010: 113-120 - [c24]Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) 2010: 527-539 - [c23]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On Greedy Algorithms for Decision Trees. ISAAC (2) 2010: 206-217 - [c22]Ferdinando Cicalese, Martin Milanic:
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. IWOCA 2010: 291-302 - [c21]Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták:
Efficient Reconstruction of RC-Equivalent Strings. IWOCA 2010: 349-362 - [i5]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case. CoRR abs/1006.4136 (2010) - [i4]Ferdinando Cicalese, Ugo Vaccaro:
Superselectors: Efficient Constructions and Applications. CoRR abs/1010.1024 (2010) - [i3]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. CoRR abs/1012.1529 (2010)
2000 – 2009
- 2009
- [j19]Ferdinando Cicalese, Fredrik Manne, Qin Xin:
Faster Deterministic Communication in Radio Networks. Algorithmica 54(2): 226-242 (2009) - [j18]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro:
Two Batch Search With Lie Cost. IEEE Trans. Inf. Theory 55(4): 1433-1439 (2009) - [c20]Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Searching for Jumbled Patterns in Strings. Stringology 2009: 105-117 - [e1]Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro:
Search Methodologies, 05.07. - 10.07.2009. Dagstuhl Seminar Proceedings 09281, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i2]Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro:
09281 Abstracts Collection - Search Methodologies. Search Methodologies 2009 - [i1]Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-case Minimization. CoRR abs/0904.3503 (2009) - 2008
- [j17]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe:
Searching with lies under error cost constraints. Discret. Appl. Math. 156(9): 1444-1460 (2008) - [c19]Ferdinando Cicalese, Eduardo Sany Laber:
Function Evaluation Via Linear Programming in the Priced Information Model. ICALP (1) 2008: 173-185 - [c18]Ferdinando Cicalese, Martin Milanic:
Computing with Priced Information: When the Value Makes the Price. ISAAC 2008: 378-389 - 2007
- [j16]Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps help: Improved bounds for group testing with interval queries. Discret. Appl. Math. 155(3): 288-299 (2007) - [c17]Ferdinando Cicalese, José Augusto Amgarten Quitzau:
2-Stage Fault Tolerant Interval Group Testing. ISAAC 2007: 858-868 - [c16]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Tunstall Parse Trees Optimum under Various Criteria. ISIT 2007: 81-85 - 2006
- [j15]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. IEEE Trans. Inf. Theory 52(8): 3772-3777 (2006) - [c15]Ferdinando Cicalese, Christian Deppe:
Q-Ary Ulam-Renyi Game with Constrained Lies. GTIT-C 2006: 678-694 - [c14]Ferdinando Cicalese, Fredrik Manne, Qin Xin:
Faster Centralized Communication in Radio Networks. ISAAC 2006: 339-348 - [c13]Ferdinando Cicalese, Eduardo Sany Laber:
On the competitive ratio of evaluating priced functions. SODA 2006: 944-953 - 2005
- [j14]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe:
Searching with lies under error transition cost constraints. Electron. Notes Discret. Math. 21: 173-179 (2005) - [j13]Ferdinando Cicalese, Christian Deppe:
Q-ary Ulam-Rényi game with constrained lies. Electron. Notes Discret. Math. 21: 255-261 (2005) - [j12]Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro:
Optimal group testing algorithms with interval queries and their application to splice site detection. Int. J. Bioinform. Res. Appl. 1(4): 363-388 (2005) - [c12]Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries. COCOON 2005: 935-944 - [c11]Ferdinando Cicalese, Eduardo Sany Laber:
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. ESA 2005: 664-676 - [c10]Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro:
Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. International Conference on Computational Science (2) 2005: 1029-1037 - [c9]Ferdinando Cicalese, Eduardo Sany Laber:
A new strategy for querying priced information. STOC 2005: 674-683 - 2004
- [j11]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Preface. Discret. Appl. Math. 137(1): 1-2 (2004) - [j10]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
On searching strategies, parallel questions, and delayed answers. Discret. Appl. Math. 144(3): 247-262 (2004) - [j9]Ferdinando Cicalese, Ugo Vaccaro:
Bounding the average length of optimal source codes via majorization theory. IEEE Trans. Inf. Theory 50(4): 633-637 (2004) - [c8]Ferdinando Cicalese, Christian Deppe, Daniele Mundici:
Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. COCOON 2004: 82-91 - 2003
- [j8]Ferdinando Cicalese, Ugo Vaccaro:
Binary search with delayed and missing answers. Inf. Process. Lett. 85(5): 239-247 (2003) - [c7]Ferdinando Cicalese, Christian Deppe:
Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. ISAAC 2003: 527-536 - 2002
- [j7]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Least adaptive optimal search with unreliable tests. Theor. Comput. Sci. 270(1-2): 877-893 (2002) - [j6]Ferdinando Cicalese, Ugo Vaccaro:
Supermodularity and subadditivity properties of the entropy on the majorization lattice. IEEE Trans. Inf. Theory 48(4): 933-938 (2002) - 2000
- [j5]Ferdinando Cicalese, Daniele Mundici:
Perfect Two-Fault Tolerant Search with Minimum Adaptiveness. Adv. Appl. Math. 25(1): 65-101 (2000) - [j4]Ferdinando Cicalese, Ugo Vaccaro:
An improved heuristic for "Ulam-Rényi game". Inf. Process. Lett. 73(3-4): 119-124 (2000) - [j3]Ferdinando Cicalese, Ugo Vaccaro:
Optimal Strategies Against a Liar. Theor. Comput. Sci. 230(1-2): 167-193 (2000) - [c6]Ferdinando Cicalese, Daniele Mundici:
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. COCOON 2000: 159-169 - [c5]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Optimal Approximation of Uniform Distributions with a Biased Coin. ICALP Satellite Workshops 2000: 23-38 - [c4]Ferdinando Cicalese, Ugo Vaccaro:
coping with Delays and Time-Outs in Binary Search Procedures. ISAAC 2000: 96-107 - [c3]Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici:
Least Adaptive Optimal Search with Unreliable Tests. SWAT 2000: 549-562
1990 – 1999
- 1999
- [c2]Ferdinando Cicalese, Daniele Mundici:
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. ESA 1999: 257-266 - [c1]Ferdinando Cicalese, Antonio Di Nola, Vincenzo Loia:
A Fuzzy Evolutionary Framework for Adaptive Agents. SAC 1999: 233-237 - 1998
- [j2]Ferdinando Cicalese, Vincenzo Loia:
A fuzzy evolutionary approach to the classification problem. J. Intell. Fuzzy Syst. 6(1): 117-129 (1998) - 1996
- [j1]Antonio Gisolfi, Ferdinando Cicalese:
Classifying through a fuzzy algebraic structure. Fuzzy Sets Syst. 78(3): 317-331 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
