Sfoglia per Autore  

Opzioni
Mostrati risultati da 1 a 20 di 33
Titolo Data di pubblicazione Autori Rivista Serie Titolo libro
Matching on the Line Admits no o(√log n)-Competitive Algorithm 2023 Peserico E.Scquizzato M. ACM TRANSACTIONS ON ALGORITHMS - -
Online Parallel Paging with Optimal Makespan 2022 Peserico E.Scquizzato M. + - - Annual ACM Symposium on Parallelism in Algorithms and Architectures
Equivalence classes and conditional hardness in massively parallel computations 2022 Scquizzato M. + DISTRIBUTED COMPUTING - -
Matching on the line admits no o(√log n)-competitive algorithm 2021 Peserico E.Scquizzato M. - LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS Leibniz International Proceedings in Informatics, LIPIcs
Tight bounds for parallel paging and green paging 2021 Peserico E.Scquizzato M. + - - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
On the distributed complexity of large-scale graph computations 2021 Scquizzato M. + ACM TRANSACTIONS ON PARALLEL COMPUTING - -
Message lower bounds via efficient network synchronization 2020 Scquizzato, Michele + THEORETICAL COMPUTER SCIENCE - -
Green Paging and Parallel Paging 2020 Peserico E.Scquizzato M. + - - Annual ACM Symposium on Parallelism in Algorithms and Architectures
Equivalence classes and conditional hardness in massively parallel computations 2020 Scquizzato M. + - LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS Leibniz International Proceedings in Informatics, LIPIcs
A time- and message-optimal distributed algorithm for minimum spanning trees 2020 Scquizzato M. + ACM TRANSACTIONS ON ALGORITHMS - -
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line 2019 Scquizzato, Michele + ALGORITHMICA - -
A Lower Bound Technique for Communication in BSP 2018 Bilardi, GianfrancoScquizzato, MicheleSilvestri, Francesco ACM TRANSACTIONS ON PARALLEL COMPUTING - -
On the distributed complexity of large-scale graph computations 2018 Scquizzato, Michele + - - Annual ACM Symposium on Parallelism in Algorithms and Architectures
Fast distributed algorithms for connectivity and MST in Large Graphs 2018 Scquizzato, Michele + ACM TRANSACTIONS ON PARALLEL COMPUTING - -
The Distributed Minimum Spanning Tree Problem 2018 Michele Scquizzato + BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE - -
A time- and message-optimal distributed algorithm for minimum spanning trees 2017 Scquizzato, Michele + - - Proceedings of the Annual ACM Symposium on Theory of Computing
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules 2017 Scquizzato, Michele + ALGORITHMICA - -
Fast distributed algorithms for connectivity and MST in large graphs 2016 Scquizzato, Michele + - - Annual ACM Symposium on Parallelism in Algorithms and Architectures
Message lower bounds via efficient network synchronization 2016 Scquizzato, Michele + - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Chasing convex bodies and functions 2016 Scquizzato, Michele + - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Mostrati risultati da 1 a 20 di 33
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile