Curriculum vitae

M.Sc. student in Computer Science

emailorciddblpgithublinkedin

• Sep 2021 – Mar 2027Udine, Italy

  Scuola Superiore Universitaria di Toppo Wassermann

  Second-level master’s degree

  • GPA: 30/30.
  • The School for Advanced Studies of the University of Udine is a higher learning institution based on merit.
  • Relevant courses: Algorithms for massive data, Lambda calculus, Constraint programming, Graph isomorphism theory.
• Oct 2024 – Dec 2026Udine, Italy

  University of Udine

  M.Sc. in Computer Science

  • GPA: 29.8/30.
  • Relevant courses: Computability theory, Complexity theory, Automated reasoning, Formal verification, Distributed systems and algorithms, Operations research.
• Sep 2021 – Oct 2024Udine, Italy

  University of Udine

  B.Sc. in Computer Science

  • GPA: 29.3/30. Graduated with 110/110 cum laude.
  • Research thesis: Co-lexicographically Ordering Automata: the Hasse Automaton (supervisor: prof. Alberto Policriti).

• May 2024 – Dec 2024Remote

  AI Safety Research Fellowship

  Apart Research

  My team focused on integrating formal methods with large language models. We designed an MVP for a new cybersecurity benchmark and developed a provably correct sandbox for evaluating attacks on security protocols. Our research work, CryptoFormalEval, was presented at the System-2 Reasoning Workshop at NeurIPS 2024.

• Jul 2023 – Oct 2023Udine, Italy

  Predecessor function in lambda calculus

  Short thesis for the Scuola Superiore (supervisor: prof. Fabio Alessi)

  A survey of the solutions to the predecessor problem in lambda calculus, describing various perspectives on the problem and comparing them through a simple metric on the normal forms of lambda terms.

• Jul 2022 – Oct 2022Udine, Italy

  Longest common prefix sketch and application to the Lempel–Ziv compression algorithm

  Research project at the Scuola Superiore (supervisor: prof. Nicola Prezza)

  Originating from the Algorithms for Massive Data course, the project looked for a space-efficient representation of strings that approximates the longest common prefix between them. The result is a sketch that, with high probability, computes this measure approximately. It was implemented and tested on real datasets as a support structure for the Lempel–Ziv 77 compression algorithm.

• Oct 22–25, 2024Remote

  Quantum Code Challenge

  CRS4, DLAB

  A hackathon hosted on the qBraid platform, with algorithmic challenges on quantum computing, quadratic optimization and quantum machine learning. My team ranked first among 15 participating teams.

• 2022 – nowUdine, Italy

  Competitive programming trainer

  University of Udine

  I teach competitive programming classes for university students, providing exercises and materials, and organized a training contest used to select the SWERC teams.

• cp-algorithms contributor

  cp-algorithms.com

  I contributed to cp-algorithms.com, a comprehensive resource for competitive programmers, with an article on the Hungarian algorithm. I plan to write more articles on the data structures I am studying.

• Apr 2024Lisbon, Portugal

  First Ascent by Bending Spoons

  Selected student

  One of the 20 Italian students selected for a four-day retreat in Lisbon to meet industry experts from Bending Spoons and attend talks on software engineering.

• 2019 – 2020Volterra, Italy

  International Olympiad in Informatics training program

  Selected student

  • Selected for the Italian training program for the International Olympiad in Informatics.
  • Attended competitive programming lessons, mainly on algorithms and data structures, and took part in the selection competitions for the Italian team.
  • Qualified for the CEOI (Central European Olympiad in Informatics) and the RMI (Romanian Masters in Informatics) 2020.