Anna Bernasconi received the Laurea degree in Physics from the University of Pavia in 1992, and the Ph.D. in Computer Science from the University of Pisa in 1998. Her dissertation “Mathematical techniques for the analysis of Boolean functions” received the Doctoral Dissertation Thesis Award 1998 from the Italian Chapter of the European Association for Theoretical Computer Science (EATCS). She is currently an Associate Professor with the Department of Computer Science of the University of Pisa, where she teaches fundamental courses in the Computer Science Program (Algorithms and Data Structures, Cryptography). Her research interests include algorithms and complexity, Boolean function complexity, and logic synthesis for emerging technologies. Recently, she got interested in quantum computing, and in particular in quantum Machine Learning techniques and in the synthesis of quantum logic circuits.
Relevant Publications
A. Bernasconi, C. Godsil, S. Severini Quantum networks on cubelike graphs Physical Review A 78 (5), 2008
A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53(4): 583-608, 2013
A. Bernasconi, V. Ciriani, G. Trucco, T. Villa
Using Flexibility in P-Circuits by Boolean Relations. IEEE Trans. Computers 64(12): 3605-3618, 2015
A. Bernasconi, V. Ciriani, G. Trucco, T. Villa
Boolean Minimization of Projected Sums of Products via Boolean Relations. IEEE Trans. Computers 68(9): 1269-1282, 2019
A. Bernasconi, S. Cimato, V. Ciriani, M. C. Molteni
Multiplicative Complexity of Autosymmetric Functions: Theory and Applications to Security 58th Design Automation Conference (DAC), 2020