Michele Scquizzato

ACM Trans. Algorithms, July, 2023

2022

Equivalence classes and conditional hardness in massively parallel computations.

[BibT_eX]

[DOI]

Danupon Nanongkai

Distributed Comput., 2022

Online Parallel Paging with Optimal Makespan.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

On the Distributed Complexity of Large-Scale Graph Computations.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Tight Bounds for Parallel Paging and Green Paging.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Message lower bounds via efficient network synchronization.

[BibT_eX]

[DOI]

David Peleg

Theor. Comput. Sci., 2020

A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm.

[BibT_eX]

[DOI]

Enoch Peserico

CoRR, 2020

Green Paging and Parallel Paging.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Fast Distributed Algorithms for Connectivity and MST in Large Graphs.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2018

A Lower Bound Technique for Communication in BSP.

[BibT_eX]

[DOI]

Gianfranco Bilardi

Francesco Silvestri

ACM Trans. Parallel Comput., 2018

The Distributed Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

2017

Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Network-Oblivious Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

Tight Bounds for Distributed Graph Computations.

[BibT_eX]

[DOI]

CoRR, 2016

Chasing Convex Bodies and Functions.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Almost Optimal Distributed Algorithms for Large-Scale Graph Problems.

[BibT_eX]

[DOI]

CoRR, 2015

Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Almost All Functions Require Exponential Energy.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

On the Complexity of Speed Scaling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

The power of heterogeneity in Near-Threshold Computing.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Green and Sustainable Computing Conference, 2015

2014

Communication Lower Bounds for Distributed-Memory Computations.

[BibT_eX]

[DOI]

Francesco Silvestri

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Energy-efficient circuit design.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

Complexity-theoretic obstacles to achieving energy savings with near-threshold computing.

[BibT_eX]

[DOI]

Proceedings of the International Green Computing Conference, 2014

2012

A Lower Bound Technique for Communication on BSP with Application to the FFT.

[BibT_eX]

[DOI]

Gianfranco Bilardi