Obserwuj
Michele Scquizzato
Michele Scquizzato
Zweryfikowany adres z math.unipd.it - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Toward optimal bounds in the congested clique: Graph connectivity and MST
JW Hegeman, G Pandurangan, SV Pemmaraju, VB Sardeshmukh, ...
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
1002015
A time- and message-optimal distributed algorithm for minimum spanning trees
G Pandurangan, P Robinson, M Scquizzato
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
552017
Fast distributed algorithms for connectivity and MST in large graphs
G Pandurangan, P Robinson, M Scquizzato
ACM Transactions on Parallel Computing (TOPC) 5 (1), 4, 2018
432018
On the Distributed Complexity of Large-Scale Graph Computations
G Pandurangan, P Robinson, M Scquizzato
Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and …, 2018
382018
A -Competitive Deterministic Algorithm for Online Matching on a Line
A Antoniadis, N Barcelo, M Nugent, K Pruhs, M Scquizzato
International Workshop on Approximation and Online Algorithms, 11-22, 2014
342014
Chasing convex bodies and functions
A Antoniadis, N Barcelo, M Nugent, K Pruhs, K Schewior, M Scquizzato
LATIN 2016: Theoretical Informatics, 68-81, 2016
282016
Network-oblivious algorithms
G Bilardi, A Pietracaprina, G Pucci, M Scquizzato, F Silvestri
Journal of the ACM (JACM) 63 (1), 1-36, 2016
242016
Communication lower bounds for distributed-memory computations
M Scquizzato, F Silvestri
International Symposium on Theoretical Aspects of Computer Science, 627-638, 2014
232014
Tight bounds for distributed graph computations
G Pandurangan, P Robinson, M Scquizzato
CoRR, abs/1602.08481, 2016
172016
A Lower Bound Technique for Communication on BSP with Application to the FFT
G Bilardi, M Scquizzato, F Silvestri
European Conference on Parallel Processing, 676-687, 2012
172012
Energy-efficient circuit design
A Antoniadis, N Barcelo, M Nugent, K Pruhs, M Scquizzato
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
132014
The distributed minimum spanning tree problem
G Pandurangan, P Robinson, M Scquizzato
Bulletin of EATCS 2 (125), 2018
122018
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
A Antoniadis, N Barcelo, M Consuegra, P Kling, M Nugent, K Pruhs, ...
Algorithmica 79 (2), 568-597, 2017
122017
Message lower bounds via efficient network synchronization
G Pandurangan, D Peleg, M Scquizzato
Theoretical Computer Science, 2020
112020
On the complexity of speed scaling
N Barcelo, P Kling, M Nugent, K Pruhs, M Scquizzato
International Symposium on Mathematical Foundations of Computer Science, 75-89, 2015
92015
Equivalence classes and conditional hardness in massively parallel computations
D Nanongkai, M Scquizzato
Distributed Computing 35 (2), 165-183, 2022
82022
A -Competitive Deterministic Algorithm for Online Matching on a Line
A Antoniadis, N Barcelo, M Nugent, K Pruhs, M Scquizzato
Algorithmica 81 (7), 2917-2933, 2019
82019
Tight bounds for parallel paging and green paging
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
72021
Green paging and parallel paging
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
72020
Matching on the line admits no o (√ log n)-competitive algorithm
E Peserico, M Scquizzato
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
62021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20