Alkida Balliu

Orcid: 0000-0001-5293-8365

Affiliations:

Gran Sasso Science Institute, L'Aquila, Italy

According to our database¹, Alkida Balliu authored at least 47 papers between 2014 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Shared Randomness Helps with Local Distributed Problems.

[BibT_eX]

[DOI]

CoRR, 2024

Local Advice and Local Decompression.

[BibT_eX]

[DOI]

CoRR, 2024

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs.

[BibT_eX]

[DOI]

Alkida Balliu

Pierre Fraigniaud

Patrick Lambein-Monette

Dennis Olivetti

Mikaël Rabie

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Tight Lower Bounds in the Supported LOCAL Model.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Completing the Node-Averaged Complexity Landscape of LCLs on Trees.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Brief Announcement: Local Advice and Local Decompression.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Node and edge averaged complexities of local graph problems.

[BibT_eX]

[DOI]

Distributed Comput., December, 2023

Locally checkable problems in rooted trees.

[BibT_eX]

[DOI]

Aleksandr Tereshchenko

Distributed Comput., September, 2023

A Brief Summary of PODC 2022.

[BibT_eX]

[DOI]

SIGACT News, March, 2023

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

On the Node-Averaged Complexity of Locally Checkable Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Sinkless Orientation Made Simple.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Optimal Deterministic Massively Parallel Connectivity on Forests.

[BibT_eX]

[DOI]

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

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs.

[BibT_eX]

[DOI]

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

2022

Distributed Lower Bounds for Ruling Sets.

[BibT_eX]

[DOI]

Alkida Balliu

Sebastian Brandt

Dennis Olivetti

SIAM J. Comput., 2022

Efficient Classification of Local Problems in Regular Trees.

[BibT_eX]

[DOI]

CoRR, 2022

On Pareto optimality in social distance games.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Exponential Speedup over Locality in MPC with Optimal Memory.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Efficient Classification of Locally Checkable Problems in Regular Trees.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Distributed ∆-coloring plays hide-and-seek.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Local Mending.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2022

Distributed Edge Coloring in Time Polylogarithmic in Δ.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Lower Bounds for Maximal Matchings and Maximal Independent Sets.

[BibT_eX]

[DOI]

J. ACM, 2021

Almost global problems in the LOCAL model.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Distributed Δ-Coloring Plays Hide-and-Seek.

[BibT_eX]

[DOI]

CoRR, 2021

Locally Checkable Labelings with Small Messages.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Locally Checkable Problems in Rooted Trees.

[BibT_eX]

[DOI]

Aleksandr Tereshchenko

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Improved Distributed Fractional Coloring Algorithms.

[BibT_eX]

[DOI]

Alkida Balliu

Fabian Kuhn

Dennis Olivetti

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

PODC 2020 Review.

[BibT_eX]

[DOI]

SIGACT News, 2020

Classification of Distributed Binary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta.

[BibT_eX]

[DOI]

Alkida Balliu

Fabian Kuhn

Dennis Olivetti

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

How much does randomness help with locally checkable problems?

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

On Non-Cooperativeness in Social Distance Games.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Certification of Compact Low-Stretch Routing Schemes.

[BibT_eX]

[DOI]

Alkida Balliu

Pierre Fraigniaud

Comput. J., 2019

Locality of Not-so-Weak Coloring.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Hardness of Minimal Symmetry Breaking in Distributed Computing.

[BibT_eX]

[DOI]

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

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable.

[BibT_eX]

[DOI]

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

2018

What can be verified locally?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

New classes of distributed time complexity.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

On Pareto Optimality in Social Distance Games.

[BibT_eX]

[DOI]

Alkida Balliu

Michele Flammini

Dennis Olivetti

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Nash Stability in Social Distance Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Local Distributed Verification.

[BibT_eX]

[DOI]

CoRR, 2016

A Big Data analyzer for large trace logs.

[BibT_eX]

[DOI]

Computing, 2016

Sparsifying Congested Cliques and Core-Periphery Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

2014

BiDAl: Big Data Analyzer for Cluster Traces.

[BibT_eX]

[DOI]

Proceedings of the 44. Jahrestagung der Gesellschaft für Informatik, Big Data, 2014

Alkida Balliu

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...