Michele Scquizzato

Dr. Michele Scquizzato

University of Padova

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 November 2019 in ACM Transactions on Algorithms
Verified
Journal Article
Open access
GPGopal Pandurangan
Gopal Pandurangan
PRPeter Robinson
Peter Robinson
MSMichele Scquizzato
Michele Scquizzato
This article presents a randomized (Las Vegas) distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in Õ( D + √ n ) time and exchanges Õ( m ) messages (both with high probability), where n is the number of nodes of the network, D is the hop-diameter, and m is the number of edges. This is the first distributed MST algorithm that matches simultaneously the time lower bound of Ω ˜ ( D + √ n ) [10] and the message lower bound of Ω ( m ) [31], which both apply to randomized Monte Carlo algorithms. The prior time and message lower bounds are derived using two completely different graph constructions; the existing lower-bound construction that shows one lower bound does not work for the other. To complement our algorithm, we present a new lower-bound graph construction for which any distributed MST algorithm requires both Ω ˜ ( D + √ n ) rounds and Ω ( m ) messages.

20 January 2022 in Distributed Computing
Verified
Journal Article
Open access
PDF file
DNDanupon Nanongkai
Danupon Nanongkai
MSMichele Scquizzato
Michele Scquizzato
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., $$\textsf {P}\ne \textsf {NP}$$ P ≠ NP ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by $$\textsf {MPC}(o(\log N))$$ MPC ( o ( log N ) ) , and the standard space complexity classes $$\textsf {L}$$ L and $$\textsf {NL}$$ NL , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows. Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the $$\textsf {L}\nsubseteq \textsf {MPC}(o(\log N))$$ L ⊈ MPC ( o ( log N ) ) conjecture: these two assumptions are equivalent, and refuting either of them would lead to $$o(\log N)$$ o ( log N ) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles. Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely $$\textsf {NL}\nsubseteq \textsf {MPC}(o(\log N))$$ NL ⊈ MPC ( o ( log N ) ) . Refuting this conjecture would lead to $$o(\log N)$$ o ( log N ) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow.

22 March 2019 in Algorithmica
Verified
Journal Article
Closed access
PDF file
AAAntonios Antoniadis
Antonios Antoniadis
NBNeal Barcelo
Neal Barcelo
MNMichael Nugent
Michael Nugent
KPKirk Pruhs
Kirk Pruhs
MSMichele Scquizzato
Michele Scquizzato

1 March 2020 in Theoretical Computer Science
Verified
Journal Article
Closed access
GPGopal Pandurangan
Gopal Pandurangan
DPDavid Peleg
David Peleg
MSMichele Scquizzato
Michele Scquizzato

14 July 2023 in ACM Transactions on Algorithms
Verified
Journal Article
Open access
EPEnoch Peserico
Enoch Peserico
MSMichele Scquizzato
Michele Scquizzato
We present a simple proof that no randomized online matching algorithm for the line can be \((\sqrt {\log _2(n+1)}/15)\) -competitive against an oblivious adversary for any n = 2 i - 1 : i ∈ ℕ. This is the first super-constant lower bound for the problem, and disproves as a corollary a recent conjecture on the topology-parametrized competitiveness achievable on generic spaces.

1 December 2015
Verified
Conference Paper
Closed access
NBNeal Barcelo
Neal Barcelo
MNMichael Nugent
Michael Nugent
KPKirk Pruhs
Kirk Pruhs
MSMichele Scquizzato
Michele Scquizzato
One potential method to attain more energy-efficient circuits with the current technology is Near-Threshold Computing. However, this energy savings comes at a cost of increased functional failure, which necessitates that circuits must be more fault-tolerant, and thus contain more gates. Thus, achieving energy savings with Near-Threshold Computing involves properly balancing the energy used per gate with the number of gates used. We consider both the setting where the supply voltages must be homogeneous and the setting where they may be heterogeneous. We show that, for small circuit error bounds, there are many natural functions that can be computed with a log factor less energy by heterogeneous circuits than is possible with homogeneous circuits, and that this result is tight for many functions. In contrast, we show that there are relations that can be computed with a log-squared factor less energy by heterogeneous circuits than is possible with homogeneous circuits.