default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Scquizzato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Singular Optimality of Distributed Computation in LOCAL. OPODIS 2024: 26:1-26:17- [i9]Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Singular Optimality of Distributed Computation in LOCAL. CoRR abs/2411.07011 (2024) - 2023
- [j11]Enoch Peserico, Michele Scquizzato
:
Matching on the Line Admits no o(√log n)-Competitive Algorithm. ACM Trans. Algorithms 19(3): 28:1-28:4 (2023) - 2022
- [j10]Danupon Nanongkai, Michele Scquizzato:
Equivalence classes and conditional hardness in massively parallel computations. Distributed Comput. 35(2): 165-183 (2022) - [c21]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Online Parallel Paging with Optimal Makespan. SPAA 2022: 205-216 - 2021
- [j9]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
On the Distributed Complexity of Large-Scale Graph Computations. ACM Trans. Parallel Comput. 8(2): 7:1-7:28 (2021) - [c20]Enoch Peserico, Michele Scquizzato:
Matching on the Line Admits No o(√log n)-Competitive Algorithm. ICALP 2021: 103:1-103:3 - [c19]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Tight Bounds for Parallel Paging and Green Paging. SODA 2021: 3022-3041 - 2020
- [j8]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16(1): 13:1-13:27 (2020) - [j7]Gopal Pandurangan, David Peleg, Michele Scquizzato:
Message lower bounds via efficient network synchronization. Theor. Comput. Sci. 810: 82-95 (2020) - [c18]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Green Paging and Parallel Paging. SPAA 2020: 493-495 - [i8]Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. CoRR abs/2001.02191 (2020) - [i7]Enoch Peserico, Michele Scquizzato:
Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm. CoRR abs/2012.15593 (2020)
2010 – 2019
- 2019
- [j6]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): 2917-2933 (2019) - [c17]Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. OPODIS 2019: 33:1-33:16 - 2018
- [j5]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 (2018) - [j4]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. ACM Trans. Parallel Comput. 4(3): 14:1-14:27 (2018) - [j3]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Trans. Parallel Comput. 5(1): 4:1-4:22 (2018) - [c16]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
On the Distributed Complexity of Large-Scale Graph Computations. SPAA 2018: 405-414 - 2017
- [j2]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): 568-597 (2017) - [c15]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A time- and message-optimal distributed algorithm for minimum spanning trees. STOC 2017: 743-756 - [i6]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. CoRR abs/1707.02229 (2017) - 2016
- [j1]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016) - [c14]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato:
Chasing Convex Bodies and Functions. LATIN 2016: 68-81 - [c13]Gopal Pandurangan, David Peleg, Michele Scquizzato:
Message Lower Bounds via Efficient Network Synchronization. SIROCCO 2016: 75-91 - [c12]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. SPAA 2016: 429-438 - [i5]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Tight Bounds for Distributed Graph Computations. CoRR abs/1602.08481 (2016) - [i4]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. CoRR abs/1607.06883 (2016) - 2015
- [c11]Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
The power of heterogeneity in Near-Threshold Computing. IGSC 2015: 1-4 - [c10]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
On the Complexity of Speed Scaling. MFCS (2) 2015: 75-89 - [c9]Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Almost All Functions Require Exponential Energy. MFCS (2) 2015: 90-101 - [c8]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: 91-100 - [i3]Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRR abs/1503.02353 (2015) - 2014
- [c7]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. IGCC 2014: 1-8 - [c6]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Energy-efficient circuit design. ITCS 2014: 303-312 - [c5]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: 63-74 - [c4]Michele Scquizzato, Francesco Silvestri:
Communication Lower Bounds for Distributed-Memory Computations. STACS 2014: 627-638 - [c3]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. WAOA 2014: 11-22 - [i2]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. CoRR abs/1404.3318 (2014) - 2013
- [i1]Michele Scquizzato, Francesco Silvestri:
Communication Lower Bounds for Distributed-Memory Computations. CoRR abs/1307.1805 (2013) - 2012
- [c2]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par 2012: 676-687 - 2010
- [c1]Paolo Bertasi, Alberto Pettarin, Michele Scquizzato, Francesco Silvestri:
A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. TGC 2010: 268-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
