Software Engineer | βοΈ Distributed Systems Passionate | π§ AI Engineering Explorer
I enjoy designing robust backend systems, building distributed applications, and experimenting with data structures, algorithms, and intelligent agents. My work often blends academic curiosity with real-world problem solving.
I graduated with a Masterβs degree in Computer Science and Engineering from Politecnico di Milano, where my thesis focused on Top-k Ranking Queries. I developed algorithms to efficiently retrieve highly relevant results tailored to user preferences.
π RtreeRankingQueries (C++)
Efficient linear & directional top-K queries with an R-Tree index for advanced spatial ranking algorithms.
π‘ DS_VirtualBeamer (Java)
Fault-tolerant distributed app based on the bully election algorithm for synchronous slide sharing β perfect for remote teaching and collaborative sessions.
π± DIMA-quizTime (Flutter/Dart)
Mobile-friendly quiz creation, sharing, and playing with an intuitive UI.
π² ingswAM2021-Arbasino-Azzara-Bianco (Java)
A networked board game client/server application built in a collaborative academic project.
π API-Project-2020-MementoPattern (C)
Lightweight text editor with undo/redo capabilities using the Memento design pattern.
π minTopGraph (Python)
Graph-based algorithms and data processing toolset.
Frameworks / Concepts
- R-Tree indexing
- Distributed Systems
- Memento Pattern
- Graph Algorithms
- Fault Tolerance
- AI Agents & Orchestration
- LLM Integrations in Backend Systems
- Building AI-assisted distributed microservices
- Experimenting with multi-agent LLM frameworks


