BiDAl: Big Data Analyzer for Cluster Traces. - Alkida Balliu; Dennis Olivetti; Özalp Babaoglu; Moreno Marzolla; Alina Sîrbu (GI-Jahrestagung, 2014)

Sparsifying Congested Cliques and Core-Periphery Networks. - Alkida Balliu; Pierre Fraigniaud; Zvi Lotker; Dennis Olivetti (SIROCCO, 2016)

A Big Data analyzer for large trace logs. - Alkida Balliu; Dennis Olivetti; Özalp Babaoglu; Moreno Marzolla; Alina Sîrbu (Computing, 2016)

Local Distributed Verification. - Alkida Balliu; Gianlorenzo D'Angelo; Pierre Fraigniaud; Dennis Olivetti (CoRR, 2016)

Nash Stability in Social Distance Games. - Alkida Balliu; Michele Flammini; Giovanna Melideo; Dennis Olivetti (AAAI, 2017)

On Pareto Optimality in Social Distance Games. - Alkida Balliu; Michele Flammini; Dennis Olivetti (AAAI, 2017)

New classes of distributed time complexity. - Alkida Balliu; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Dennis Olivetti; Jukka Suomela (STOC, 2018)

What can be verified locally? - Alkida Balliu; Gianlorenzo D'Angelo; Pierre Fraigniaud; Dennis Olivetti (J. Comput. Syst. Sci., 2018)

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (PODC, 2019)

Hardness of Minimal Symmetry Breaking in Distributed Computing. - Alkida Balliu; Juho Hirvonen; Dennis Olivetti; Jukka Suomela (PODC, 2019)

Locality of Not-so-Weak Coloring. - Alkida Balliu; Juho Hirvonen; Christoph Lenzen 001; Dennis Olivetti; Jukka Suomela (SIROCCO, 2019)

Certification of Compact Low-Stretch Routing Schemes. - Alkida Balliu; Pierre Fraigniaud (Comput. J., 2019)

On Non-Cooperativeness in Social Distance Games. - Alkida Balliu; Michele Flammini; Giovanna Melideo; Dennis Olivetti (J. Artif. Intell. Res., 2019)

Brief Announcement: Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (PODC, 2020)

How much does randomness help with locally checkable problems? - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jukka Suomela (PODC, 2020)

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. - Alkida Balliu; Fabian Kuhn; Dennis Olivetti (PODC, 2020)

Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2020)

PODC 2020 Review. - Mirza Ahad Baig; Alkida Balliu; Peter Davies 001; Michal Dory (SIGACT News, 2020)

Improved Distributed Fractional Coloring Algorithms. - Alkida Balliu; Fabian Kuhn; Dennis Olivetti (OPODIS, 2021)

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (PODC, 2021)

Locally Checkable Problems in Rooted Trees. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (PODC, 2021)

Locally Checkable Labelings with Small Messages. - Alkida Balliu; Keren Censor-Hillel; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2021)

Distributed Δ-Coloring Plays Hide-and-Seek. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (CoRR, 2021)

Almost global problems in the LOCAL model. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jukka Suomela (Distributed Comput., 2021)

Lower Bounds for Maximal Matchings and Maximal Independent Sets. - Alkida Balliu; Sebastian Brandt 002; Juho Hirvonen; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (J. ACM, 2021)

Distributed Edge Coloring in Time Polylogarithmic in Δ. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (PODC, 2022)

Local Mending. - Alkida Balliu; Juho Hirvonen; Darya Melnyk; Dennis Olivetti; Joel Rybicki; Jukka Suomela (SIROCCO, 2022)

Distributed ∆-coloring plays hide-and-seek. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (STOC, 2022)

Efficient Classification of Locally Checkable Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (DISC, 2022)

Exponential Speedup over Locality in MPC with Optimal Memory. - Alkida Balliu; Sebastian Brandt 002; Manuela Fischer; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (DISC, 2022)

On Pareto optimality in social distance games. - Alkida Balliu; Michele Flammini; Giovanna Melideo; Dennis Olivetti (Artif. Intell., 2022)

Efficient Classification of Local Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (CoRR, 2022)

Distributed Lower Bounds for Ruling Sets. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti (SIAM J. Comput., 2022)

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (SODA, 2023)

Optimal Deterministic Massively Parallel Connectivity on Forests. - Alkida Balliu; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (SODA, 2023)

Sinkless Orientation Made Simple. - Alkida Balliu; Janne H. Korhonen; Fabian Kuhn; Henrik Lievonen; Dennis Olivetti; Shreyas Pai; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jan Studený; Jukka Suomela; Jara Uitto (SOSA, 2023)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Gustav Schmid (DISC, 2023)

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. - Alkida Balliu; Filippo Brunelli; Pierluigi Crescenzi; Dennis Olivetti; Laurent Viennot (CoRR, 2023)

A Brief Summary of PODC 2022. - Dan Alistarh; Alkida Balliu; Dimitrios Los; Sean Ovens (SIGACT News, 2023)

Locally checkable problems in rooted trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (Distributed Comput., 2023)

Node and edge averaged complexities of local graph problems. - Alkida Balliu; Mohsen Ghaffari 001; Fabian Kuhn; Dennis Olivetti (Distributed Comput., 2023)

Brief Announcement: Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (PODC, 2024)

Completing the Node-Averaged Complexity Landscape of LCLs on Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Gustav Schmid (PODC, 2024)

Tight Lower Bounds in the Supported LOCAL Model. - Alkida Balliu; Thomas Boudier; Sebastian Brandt 002; Dennis Olivetti (PODC, 2024)

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. - Alkida Balliu; Pierre Fraigniaud; Patrick Lambein-Monette; Dennis Olivetti; Mikaël Rabie (DISC, 2024)

Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (CoRR, 2024)

Towards Fully Automatic Distributed Lower Bounds. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Joonatan Saarhelo (CoRR, 2024)

Shared Randomness Helps with Local Distributed Problems. - Alkida Balliu; Mohsen Ghaffari 001; Fabian Kuhn; Augusto Modanese; Dennis Olivetti; Mikaël Rabie; Jukka Suomela; Jara Uitto (ICALP, 2025)

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost. - Alkida Balliu; Pierre Fraigniaud; Dennis Olivetti; Mikaël Rabie (PODC, 2025)

Distributed Quantum Advantage for Local Problems. - Alkida Balliu; Sebastian Brandt 002; Xavier Coiteux-Roy; Francesco D'Amore 001; Massimo Equi; François Le Gall; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Marc-Olivier Renou; Jukka Suomela; Lucas Tendick; et al. (STOC, 2025)

Distributed Quantum Advantage in Locally Checkable Labeling Problems. - Alkida Balliu; Filippo Casagrande; Francesco D'Amore 001; Massimo Equi; Barbara Keller; Henrik Lievonen; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs. - Alkida Balliu; Corinna Coupette; Antonio Cruciani; Francesco D'Amore 001; Massimo Equi; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Jukka Suomela (CoRR, 2025)

Distributed Algorithms for Potential Problems. - Alkida Balliu; Thomas Boudier; Francesco D'Amore 001; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)