Alessandra Di Pierro
Recent
▪ A Type Theory for Probabilistic Lambda Calculus
Lecture Notes in Computer Science, Vol. 12065, pages 86-102 Springer, Cham, 2020.
▪ Kernel methods in Quantum Machine Learning
With R. Mengoni, Quantum Machine Intelligence, Volume 1, Issue 3–4, pp 65–71 (November 2019).
▪ Persistent homology analysis of multiqubit entanglement
With R. Mengoni, S. Mancini, L. Memarzadeh. Quantum Information and Computation, Vol.20 No.5&6, 2020.
arXiv:1907.06914 [quant-ph] (July 2019).
▪ Special Issue on Quantum Techniques in Machine Learning
Guest Editors: Alessandra Di Pierro and Stefano Mancini. Volume 16, Issue 08 (December 2018), International Journal of Quantum Information, World Scientific.
▪ Biclustering with a quantum annealer
With L. Bottarelli, M. Bicego, M. Denitto, A. Farinelli, R. Mengoni. Soft Computing, 22, 6247–6260 (2018).
▪ Homological analysis of multi-qubit entanglement
With R. Mengoni, S. Mancini, L. Memarzadeh. EPL 123 (2018) 30006 (see also arXiv:1802.04572 [quant-ph], 2018).
▪ Hamming Distance Kernelisation via Topological Quantum Computation
With R. Mengoni, R. Nagarajan and D. Windridge. In Theory and Practice of Natural Computing, Lecture Notes in Computer Science, Vol. 10687, Pages 269-280. Springer, Cham, 2017.
▪ A quantum annealing approach to biclustering
With L. Bottarelli, M. Bicego, M. Denitto, A. Farinelli. In Theory and Practice of Natural Computing, Lecture Notes in Computer Science, Vol. 10071, Pages 175-187. Springer International Publishing, 2016.
▪ Probabilistic abstract intepretation: From trace semantics to DTMC's via linear regression
With H. Wiklicky In Semantics, Logics and Calculi, Lecture Notes in Computer Science, Vol. 9560, Pages 111-139. Springer International Publishing, 2016.
▪ The dual value of probabilistic abstract interpretation
In Approximate and Probabilistic Computing: Design, Coding, Verification (Dagstuhl Seminar 15491), Schloss Dagstuhl--Leibniz-Zentrum fur Informatik, Dagstuhl Reports, 5(11):151-179, Dagstuhl, Germany, 2016. Available online.
▪ A topological quantum calculus
In Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181), Schloss Dagstuhl Leibniz-Zentrum fuer Informatik, Dagstuhl Reports, 5(4):123-141, Dagstuhl, Germany, 2015. Available online.
▪ A calculus of anyons
With F. Panarotto. In Proceedings of WoLLIC 2014, 21st Workshop on Logic, Language, Information and Computation, Valparaiso, Chile, September 2014. Lecture Notes in Computer Science Vol. 8652, Pages 152-165, Springer-Verlag, 2014.
▪ Probabilistic analysis of programs: A weak limit approach
With H. Wiklicky. In Proceedings of FOPARA 2013, 3rd Interna- tional Workshop on Foundational and Practical Aspects of Resource Anlysis, Bertinoro, Italy, August 2013. Lecture Notes in Computer Science, Vol. 8552, Pages 58-76, Springer, 2014.
▪ Semantics of probabilistic programs: A weak limit approach
With H. Wiklicky. In Proceedings of APLAS 2013, 11th Asian Symposium on on Programming Languages and Systems, Melbourne, Australia, December 2013. Lecture Notes in Computer Science Vol. 8301, Pages 241-256, Springer International Publishing, 2013.
▪ Probabilistic data flow analysis: a linear equational approach
(With H. Wiklicky) In Proceedings of GandALF 2013, Fourth International Symposium on Games, Automata, Logics and Formal Verification, Borca di Cadore, Dolomites, Italy, August 2013. Electronic Proceedings in TCS, Vol.119, Pages 150-165, 2013.
▪ Approximation and Relative Entropy
In Boris Kopf, Paquale Malacaria, and Catuscia Palamidessi Quantitative Security Analysis, Dagstuhl Seminar 12481. Dagstuhl Reports, 2(11):141-141, 2012. Available online.
