معرفی
Ferdinando Cicalese is a Professor of Computer Science at the Department of Computer Science, University of Verona, Italy. He maintains an active research program and teaches graduate and undergraduate courses in computer science with a focus on algorithms and theoretical computer science.
Research Interests
Professor Cicalese's research spans several interconnected fields within theoretical computer science and its applications. His primary research interests include Combinatorial Search Theory, Information Theory, Combinatorial Optimization, and Bioinformatics. He has made significant contributions to the theory of fault-tolerant search algorithms, group testing, and compressed sensing. His work often bridges theoretical computer science with practical applications in bioinformatics and data analysis.Publications
Professor Cicalese has published influential works in his field, including the monograph "Fault-Tolerant Search Algorithms" and the edited volume "Information Theory, Combinatorics, and Search Theory" which contains 773 pages of research in the field. His publications demonstrate a consistent focus on combinatorial search methodologies and their applications across various domains.Academic Service
Professor Cicalese has been actively involved in numerous academic conferences, serving on program committees for events including ICLR 2022, NeurIPS 2021 and 2020, LATIN 2020, CPM 2015, SPIRE 2014, ICTCS 2014, FCT 2013, and several others. He has co-chaired workshops such as the ICALP2011GT workshop on group testing and related topics.Teaching and Mentoring
Professor Cicalese has supervised multiple PhD students to completion, including Christian Heup, Travis Gagie, José Augusto Amgarten Quitzau, Lars Ulveland, and Peter Husemann. He has also mentored postdoctoral researchers such as Yasmin Rios Solis and Martin Milanič. Currently, he teaches courses including Fundamental Algorithms for Bioinformatics, Computational Game Theory, and Computational Complexity at the University of Verona.۰مقاله منتشرشده
