Mattia D'Emidio

• Big Data: Models and Algorithms — 2017 – to date
  Models, Algorithms, Technologies for Big Data Processing and Storage. Massively Parallel Processing Frameworks.
  M.Sc. Computer Engineering, Computer Science, Math. Engineering, Doctoral Program in ICT (University of L'Aquila) • Taught in: English.
• Algorithm Engineering — 2017 – to date
  Advanced Algorithms. Experimental Algorithmics. Massive Graph Mining.
  M.Sc. Computer Engineering, Doctoral Program in ICT (University of L'Aquila) • Taught in: English.
• Distributed Systems — 2019 – 2021
  Distributed Algorithms (Series of Seminars)
  M.Sc. Computer Science (University of L'Aquila) • Taught in: English.
• Approximation Algorithms and Algorithm Engineering — 2015 – 2016
  Approximation Algorithms and Algorithm Engineering
  Doctoral Program in Computer Science (GSSI) • Taught in: English.
• Large Graph Mining and Algorithm Engineering — 2016 – 2018
  Large Graph Mining and Algorithm Engineering
  Doctoral Program in Computer Science (GSSI) • Taught in: English.
• Design and Analysis of Algorithms — 2015 – 2018
  Foundations of Design and Analysis of Algorithms
  Doctoral Program in Computer Science (GSSI) • Taught in: English.
• Computing Architectures — 2013 – 2014
  Computing Architectures
  B.Sc. Computer Science (University of L'Aquila) • Taught in: Italian.

• Umer Arshad — 2023 – to date
  Doctoral Program in Information and Communication Technologies. University of L'Aquila.
  Topic: Development of modern strategies for cloud and high-performance computing integration (collaboration w/ CINECA).
• D'Ascenzo Andrea — 2020 – 2024
  Doctoral Program in Information and Communication Technologies. University of L'Aquila.
  Now Post-Doctoral Researcher @ LUISS.
• Imran Khan — 2016 – 2020
  Doctoral Program in Computer Science. Gran Sasso Science Institute (GSSI).
  Now Senior Engineer at Zalando (Germany).
• Feliciano Colella — 2015 – 2018
  Doctoral Program in Computer Science. Gran Sasso Science Institute (GSSI).
  Co-Advised w/ Prof. Guido Proietti. Now Senior Data Analyst at Square Enix (UK).

• Algorithms for Massive Graph Processing

  Design and analyze scalable algorithms for billion-edge graphs with prototype validation.

  • Field / Main Theme: Algorithms for large-scale graphs
  • Type: Research (novel contributions)
  • Focus: Theoretical with applied/experimental validation
  • Expected Duration: 6–9 months
  • Target Students: M.Sc. in Computer Engineering / Computer Science
  • Prerequisites: Basics of algorithms & complexity, graph theory, strong C++/Java (Python for prototyping)
  • Application Domain (Impact): Social network analysis, web search & recommendation, bioinformatics networks, infrastructure routing

Misc — 2012 – to date
Over the years, I have been giving (more or less regularly) seminars within the following graduate courses:

• Computer Architectures — University of Perugia
• Operating Systems — University of L'Aquila
• Computer Networks — University of L'Aquila
• Algorithms and Networking — University of Perugia
• Distributed Systems — University of L'Aquila
• Advanced Algorithms — University of Perugia
• “Algoritmi a Colazione” Series — University of Rome Tor Vergata

Covering a variety of topics, e.g.:

• Dynamic Graph Algorithms; Distributed Algorithms
• Code Tuning & Hardware-Friendly Programming; Cache-Friendly Programming
• Distance Oracles; Concurrent Programming
• Dynamic Algorithms for Transport Systems; Route Planning in Road Networks
• Intel Architectures; Point-to-Point Routing in Modern Networks
• Fault-Tolerant Approximate Shortest-Path Trees
• Shortest Path Algorithms for Large-Scale Fully Dynamic Complex Networks