A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. - Paolo Bertasi; Alberto Pettarin; Michele Scquizzato; Francesco Silvestri 001 (TGC, 2010)

A Lower Bound Technique for Communication on BSP with Application to the FFT. - Gianfranco Bilardi; Michele Scquizzato; Francesco Silvestri 001 (Euro-Par, 2012)

Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (IGCC, 2014)

Energy-efficient circuit design. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (ITCS, 2014)

Communication Lower Bounds for Distributed-Memory Computations. - Michele Scquizzato; Francesco Silvestri 001 (STACS, 2014)

The power of heterogeneity in Near-Threshold Computing. - Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (IGSC, 2015)

On the Complexity of Speed Scaling. - Neal Barcelo; Peter Kling; Michael Nugent; Kirk Pruhs; Michele Scquizzato (MFCS (2), 2015)

Almost All Functions Require Exponential Energy. - Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (MFCS (2), 2015)

Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. - James W. Hegeman; Gopal Pandurangan; Sriram V. Pemmaraju; Vivek B. Sardeshmukh; Michele Scquizzato (PODC, 2015)

Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (CoRR, 2015)

Chasing Convex Bodies and Functions. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Kevin Schewior; Michele Scquizzato (LATIN, 2016)

Tight Bounds for Distributed Graph Computations. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (CoRR, 2016)

Network-Oblivious Algorithms. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Michele Scquizzato; Francesco Silvestri 001 (J. ACM, 2016)

Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. - Antonios Antoniadis 001; Neal Barcelo; Mario E. Consuegra; Peter Kling; Michael Nugent; Kirk Pruhs; Michele Scquizzato (Algorithmica, 2017)

The Distributed Minimum Spanning Tree Problem. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (Bull. EATCS, 2018)

A Lower Bound Technique for Communication in BSP. - Gianfranco Bilardi; Michele Scquizzato; Francesco Silvestri 001 (ACM Trans. Parallel Comput., 2018)

Fast Distributed Algorithms for Connectivity and MST in Large Graphs. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (ACM Trans. Parallel Comput., 2018)

A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (Algorithmica, 2019)

Green Paging and Parallel Paging. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SPAA, 2020)

Matching on the line admits no $o( sqrt{ log n})$-competitive algorithm. - Enoch Peserico; Michele Scquizzato (CoRR, 2020)

A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (ACM Trans. Algorithms, 2020)

Message lower bounds via efficient network synchronization. - Gopal Pandurangan; David Peleg; Michele Scquizzato (Theor. Comput. Sci., 2020)

Tight Bounds for Parallel Paging and Green Paging. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SODA, 2021)

On the Distributed Complexity of Large-Scale Graph Computations. - Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (ACM Trans. Parallel Comput., 2021)

Online Parallel Paging with Optimal Makespan. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SPAA, 2022)

Equivalence classes and conditional hardness in massively parallel computations. - Danupon Nanongkai; Michele Scquizzato (Distributed Comput., 2022)

Matching on the Line Admits no o(√log n)-Competitive Algorithm. - Enoch Peserico; Michele Scquizzato (ACM Trans. Algorithms, 2023)

The Singular Optimality of Distributed Computation in LOCAL. - Fabien Dufoulon; Gopal Pandurangan; Peter Robinson 002; Michele Scquizzato (OPODIS, 2024)