Michele Scquizzato
KTH Royal Institute of Technology
School of Computer Science and Communication
Lindstedtsvägen 3, 5th floor, room 4536
SE-100 44 Stockholm
Sweden

m...@kth.se

About Me
Since August 2017 I am a post-doctoral researcher in the Theoretical Computer Science Group at the School of Computer Science and Communication (CSC) at KTH Royal Institute of Technology, working with Danupon Nanongkai.

From August 2014 to July 2017 I was a post-doctoral researcher at the Department of Computer Science of University of Houston, working with Prof. Gopal Pandurangan. From April 2013 to July 2014 I was a post-doctoral researcher at the Department of Computer Science of University of Pittsburgh, working with Prof. Kirk Pruhs. In April 2013 I received my Ph.D. in Information Engineering from University of Padova, advised by Prof. Gianfranco Bilardi. Before that, I received a B.Sc. and a M.Sc. (both summa cum laude) in Computer Engineering from University of Padova.

I am interested in the design and analysis of algorithms.

Publications
Conference Papers
Gopal Pandurangan, Peter Robinson, and Michele Scquizzato
Tight Bounds for Distributed Graph Computations [arXiv]
Submitted

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)

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)

Journal Articles
Gianfranco Bilardi, Michele Scquizzato, and Francesco Silvestri
A Lower Bound Technique for Communication in BSP [arXiv]
ACM Transactions on Parallel Computing, to appear

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

Professional Service
Program committee member of IPDPS 2015 (algorithms track), ICDCN 2016 (distributed computing track), Euro-Par 2017 (topic 10: theory and algorithms for parallel computation and networking)

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

You are visitor number

free hit counters

(since August 2009)