I am an Associate Professor of Computer Science at the University of Padova.

I received my Ph.D. from the University of Padova in 2013, advised by Gianfranco Bilardi. Then, I was a post-doctoral researcher at the University of Pittsburgh (2013-2014), working with Kirk Pruhs, at the University of Houston (2014-2017), working with Gopal Pandurangan, and at KTH Royal Institute of Technology (2017-2018), working with Danupon Nanongkai.

I am interested in the design and analysis of algorithms.

Prospective students: I am currently looking for highly motivated students with a strong background in theoretical computer science or mathematics.

Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
The Singular Optimality of Distributed Computation in LOCAL [link] [pdf] [arXiv]
In Proceedings of the 28th International Conference on Principles of Distributed Systems (OPODIS 2024)

Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato
Online Parallel Paging with Optimal Makespan [link] [pdf]
In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2022)
Best Paper Finalist

Enoch Peserico and Michele Scquizzato
Matching on the Line Admits no o(√log n)-Competitive Algorithm [link] [pdf] [arXiv] [slides] [video]
In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato
Tight Bounds for Parallel Paging and Green Paging [link] [pdf] [video by M. Bender]
In Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)
Contributed presentation at the 6th Highlights of Algorithms (HALG 2021)

Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato
Brief Announcement: Green Paging and Parallel Paging [link] [pdf] [video]
In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020)

Danupon Nanongkai and Michele Scquizzato
Equivalence Classes and Conditional Hardness in Massively Parallel Computations [link] [pdf] [arXiv]
In Proceedings of the 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
On the Distributed Complexity of Large-Scale Graph Computations [link] [pdf] [arXiv]
In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2018)
Invited to the special issue of ACM Transactions on Parallel Computing for SPAA 2018

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees [link] [pdf] [arXiv] [poster]
In Proceedings of the 49th Annual ACM Symposium on the Theory of Computing (STOC 2017)
Contributed presentation at the 3rd Highlights of Algorithms (HALG 2018)

Gopal Pandurangan, David Peleg, and Michele Scquizzato
Message Lower Bounds via Efficient Network Synchronization [link] [pdf]
In Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016)
Invited to the special issue of Theoretical Computer Science for SIROCCO 2016

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
Fast Distributed Algorithms for Connectivity and MST in Large Graphs [link] [pdf] [arXiv]
In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016)
Invited to the special issue of ACM Transactions on Parallel Computing for SPAA 2016

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, and Michele Scquizzato
Chasing Convex Bodies and Functions [link] [pdf]
In Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN 2016)

Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
The Power of Heterogeneity in Near-Threshold Computing [link] [pdf]
In Proceedings of the 6th International Green and Sustainable Computing Conference (IGSC 2015)

James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, and Michele Scquizzato
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST [link] [pdf]
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC 2015)

Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Almost All Functions Require Exponential Energy [link] [pdf]
In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015)

Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
On the Complexity of Speed Scaling [link] [pdf]
In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015)

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Complexity-Theoretic Obstacles to Achieving Energy Savings with Near-Threshold Computing [link] [pdf]
In Proceedings of the 5th International Green Computing Conference (IGCC 2014)

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line [link] [pdf]
In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA 2014)

Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules [link] [pdf]
In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014)

Michele Scquizzato and Francesco Silvestri
Communication Lower Bounds for Distributed-Memory Computations [link] [pdf] [arXiv]
In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Preliminarily presented at the 5th Workshop on Massive Data Algorithmics (MASSIVE 2013)

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Energy-Efficient Circuit Design [link] [pdf]
In Proceedings of the 5th conference on Innovations in Theoretical Computer Science (ITCS 2014)

Gianfranco Bilardi, Michele Scquizzato, and Francesco Silvestri
A Lower Bound Technique for Communication on BSP with Application to the FFT [link] [pdf]
In Proceedings of the 18th International European Conference on Parallel and Distributed Computing (Euro-Par 2012)

Paolo Bertasi, Alberto Pettarin, Michele Scquizzato, and Francesco Silvestri
A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments [link]
In Proceedings of the 5th Symposium on Trustworthy Global Computing (TGC 2010)

Enoch Peserico and Michele Scquizzato
Matching on the Line Admits no o(√log n)-Competitive Algorithm [link] [pdf]
ACM Transactions on Algorithms 19(3), Article 28, 2023

Danupon Nanongkai and Michele Scquizzato
Equivalence Classes and Conditional Hardness in Massively Parallel Computations [link] [pdf]
Distributed Computing 35(2):165-183, 2022

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
On the Distributed Complexity of Large-Scale Graph Computations [link] [pdf]
ACM Transactions on Parallel Computing 8(2), Article 7, 2021

Gopal Pandurangan, David Peleg, and Michele Scquizzato
Message Lower Bounds via Efficient Network Synchronization [link] [pdf]
Theoretical Computer Science 810:82-95, 2020

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees [link] [pdf]
ACM Transactions on Algorithms 16(1), Article 13, 2020

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line [link] [pdf]
Algorithmica 81(7):2917-2933, 2019

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
Fast Distributed Algorithms for Connectivity and MST in Large Graphs [link] [pdf]
ACM Transactions on Parallel Computing 5(1), Article 4, 2018

Gianfranco Bilardi, Michele Scquizzato, and Francesco Silvestri
A Lower Bound Technique for Communication in BSP [link] [arXiv]
ACM Transactions on Parallel Computing 4(3), Article 14, 2018

Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules [link] [pdf]
Algorithmica 79(2):568-597, 2017

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, and Francesco Silvestri
Network-Oblivious Algorithms [link] [pdf]
Journal of the ACM 63(1), Article 3, 2016

Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
The Distributed Minimum Spanning Tree Problem [link] [pdf]
Bulletin of the EATCS 125:52-80, 2018

Program Committees: ICDCN 2025, SPAA 2024, ICTCS 2022, Euro-Par 2020, IPDPS 2020, IPDPS 2019, ICDCN 2019, Euro-Par 2017, ICDCN 2016, IPDPS 2015

At University of Padova:
Selected Topics in Algorithms: Spring 2025, Spring 2024
Advanced Algorithms: Spring 2025, Spring 2024, Spring 2023, Spring 2022, Spring 2021, Spring 2020
Algorithms and Data Structures (with P. Baldan): Fall 2024, Fall 2023, Fall 2022, Fall 2021, Spring 2021, Spring 2020, Spring 2019

At University of Houston:
COSC 3320: Algorithms and Data Structures: Spring 2017, Spring 2016, Summer 2015
COSC 6326: Distributed Algorithms (with G. Pandurangan): Spring 2017