Ferdinando Cicalese
Ferdinando Cicalese
Associate Professor of Computer Science, University of Verona
Verified email at dia.unisa.it - Homepage
TitleCited byYear
Algorithms for jumbled pattern matching in strings
P Burcsi, F Cicalese, G Fici, Z Lipták
International Journal of Foundations of Computer Science 23 (02), 357-374, 2012
662012
Searching for Jumbled Patterns in Strings.
F Cicalese, G Fici, Z Lipták
Stringology, 105-117, 2009
492009
Latency-bounded target set selection in social networks
F Cicalese, G Cordasco, L Gargano, M Milanič, U Vaccaro
Theoretical Computer Science 535, 1-15, 2014
482014
Fault-tolerant search algorithms
F Cicalese
Springer, 2013
462013
On approximate jumbled pattern matching in strings
P Burcsi, F Cicalese, G Fici, Z Lipták
Theory of Computing Systems 50 (1), 35-51, 2012
462012
Supermodularity and subadditivity properties of the entropy on the majorization lattice
F Cicalese, U Vaccaro
IEEE Transactions on Information Theory 48 (4), 933-938, 2002
432002
On table arrangements, scrabble freaks, and jumbled pattern matching
P Burcsi, F Cicalese, G Fici, Z Lipták
International Conference on Fun with Algorithms, 89-101, 2010
412010
Faster centralized communication in radio networks
F Cicalese, F Manne, Q Xin
International Symposium on Algorithms and Computation, 339-348, 2006
412006
Least adaptive optimal search with unreliable tests
F Cicalese, D Mundici, U Vaccaro
Theoretical Computer Science 270 (1-2), 877-893, 2002
402002
Optimal strategies against a liar
F Cicalese, U Vaccaro
Theoretical Computer Science 230 (1-2), 167-193, 2000
402000
Optimal coding with one asymmetric error: below the sphere packing bound
F Cicalese, D Mundici
International Computing and Combinatorics Conference, 159-169, 2000
362000
Optimal binary search with two unreliable tests and minimum adaptiveness
F Cicalese, D Mundici
European Symposium on Algorithms, 257-266, 1999
331999
Rota-Metropolis cubic logic and Ulam-Rényi games
F Cicalese, D Mundici, U Vaccaro
Algebraic Combinatorics and Computer Science, 197-244, 2001
322001
Graphs of separability at most 2
F Cicalese, M Milanič
Discrete Applied Mathematics 160 (6), 685-696, 2012
302012
Perfect two-fault tolerant search with minimum adaptiveness
F Cicalese, D Mundici
Advances in Applied Mathematics 25 (1), 65-101, 2000
292000
Recent developments of feedback coding and its relations with many-valued logic
F Cicalese, D Mundici
Proof, Computation and Agency, 115-131, 2011
262011
Optimal group testing algorithms with interval queries and their application to splice site detection
F Cicalese, P Damaschke, U Vaccaro
International journal of bioinformatics research and applications 1 (4), 363-388, 2005
252005
Spread of influence in weighted networks under time and budget constraints
F Cicalese, G Cordasco, L Gargano, M Milanič, J Peters, U Vaccaro
Theoretical Computer Science 586, 40-58, 2015
242015
The binary identification problem for weighted trees
F Cicalese, T Jacobs, E Laber, C Valentim
Theoretical Computer Science 459, 100-112, 2012
222012
On the complexity of searching in trees and partially ordered structures
F Cicalese, T Jacobs, E Laber, M Molinaro
Theoretical computer science 412 (50), 6879-6896, 2011
222011
The system can't perform the operation now. Try again later.
Articles 1–20