Michele Scquizzato

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 26

Top Topics

Minimum Spanning Tree

Top Venues

ACM Trans. Parallel Comput.

Publications

Enoch Peserico, Michele Scquizzato
Matching on the Line Admits no o(√log n)-Competitive Algorithm. ACM Trans. Algorithms 19 (3) (2023)
Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato
Online Parallel Paging with Optimal Makespan. SPAA (2022)
Danupon Nanongkai, Michele Scquizzato
Equivalence classes and conditional hardness in massively parallel computations. Distributed Comput. 35 (2) (2022)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. 8 (2) (2021)
Enoch Peserico, Michele Scquizzato
Matching on the Line Admits No o(√log n)-Competitive Algorithm. ICALP (2021)
Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato
Tight Bounds for Parallel Paging and Green Paging. SODA (2021)
Danupon Nanongkai, Michele Scquizzato
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. CoRR (2020)
Gopal Pandurangan, David Peleg, Michele Scquizzato
Message lower bounds via efficient network synchronization. Theor. Comput. Sci. 810 (2020)
Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato
Green Paging and Parallel Paging. SPAA (2020)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16 (1) (2020)
Enoch Peserico, Michele Scquizzato
Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm. CoRR (2020)
Danupon Nanongkai, Michele Scquizzato
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. OPODIS (2019)
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. Algorithmica 81 (7) (2019)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication in BSP. ACM Trans. Parallel Comput. 4 (3) (2018)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
On the Distributed Complexity of Large-Scale Graph Computations. SPAA (2018)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Trans. Parallel Comput. 5 (1) (2018)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 (2018)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication in BSP. CoRR (2017)
Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. Algorithmica 79 (2) (2017)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
A time- and message-optimal distributed algorithm for minimum spanning trees. STOC (2017)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. SPAA (2016)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. J. ACM 63 (1) (2016)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. CoRR (2016)
Gopal Pandurangan, David Peleg, Michele Scquizzato
Message Lower Bounds via Efficient Network Synchronization. SIROCCO (2016)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Tight Bounds for Distributed Graph Computations. CoRR (2016)
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato
Chasing Convex Bodies and Functions. LATIN (2016)
Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato
On the Complexity of Speed Scaling. MFCS (2) (2015)
James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, Michele Scquizzato
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. PODC (2015)
Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
The power of heterogeneity in Near-Threshold Computing. IGSC (2015)
Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
Almost All Functions Require Exponential Energy. MFCS (2) (2015)
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRR (2015)
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. IGCC (2014)
Michele Scquizzato, Francesco Silvestri
Communication Lower Bounds for Distributed-Memory Computations. STACS (2014)
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. WAOA (2014)
Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. STACS (2014)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. CoRR (2014)
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
Energy-efficient circuit design. ITCS (2014)
Michele Scquizzato, Francesco Silvestri
Communication Lower Bounds for Distributed-Memory Computations. CoRR (2013)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par (2012)
Paolo Bertasi, Alberto Pettarin, Michele Scquizzato, Francesco Silvestri
A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. TGC (2010)