Alkida Balliu

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 76

Top Topics

Distributed Computing

Pareto Optimality

Symmetry Breaking

Top Venues

Distributed Comput.

Publications

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. PODC (2024)
Alkida Balliu, Thomas Boudier, Sebastian Brandt, Dennis Olivetti
Tight Lower Bounds in the Supported LOCAL Model. PODC (2024)
Alkida Balliu, Thomas Boudier, Sebastian Brandt, Dennis Olivetti
Tight Lower Bounds in the Supported LOCAL Model. CoRR (2024)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. CoRR (2024)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela
Brief Announcement: Local Advice and Local Decompression. PODC (2024)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela
Local Advice and Local Decompression. CoRR (2024)
Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto
Shared Randomness Helps with Local Distributed Problems. CoRR (2024)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
Locally checkable problems in rooted trees. Distributed Comput. 36 (3) (2023)
Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti
Node and edge averaged complexities of local graph problems. Distributed Comput. 36 (4) (2023)
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto
Sinkless Orientation Made Simple. SOSA (2023)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. SODA (2023)
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. CoRR (2023)
Dan Alistarh, Alkida Balliu, Dimitrios Los, Sean Ovens
A Brief Summary of PODC 2022. SIGACT News 54 (1) (2023)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. DISC (2023)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. CoRR (2023)
Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Optimal Deterministic Massively Parallel Connectivity on Forests. SODA (2023)
Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Optimal Deterministic Massively Parallel Connectivity on Forests. CoRR (2022)
Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti
On Pareto optimality in social distance games. Artif. Intell. 312 (2022)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Distributed ∆-coloring plays hide-and-seek. STOC (2022)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti
Distributed Lower Bounds for Ruling Sets. SIAM J. Comput. 51 (1) (2022)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela
Efficient Classification of Local Problems in Regular Trees. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
Exponential Speedup over Locality in MPC with Optimal Memory. DISC (2022)
Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela
Local Mending. SIROCCO (2022)
Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti
Node and Edge Averaged Complexities of Local Graph Problems. CoRR (2022)
Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti
Node and Edge Averaged Complexities of Local Graph Problems. PODC (2022)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Distributed Edge Coloring in Time Polylogarithmic in Δ. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela
Efficient Classification of Locally Checkable Problems in Regular Trees. DISC (2022)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Distributed Edge Coloring in Time Polylogarithmic in Δ. PODC (2022)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. PODC (2021)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
Locally Checkable Problems in Rooted Trees. PODC (2021)
Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela
Locally Checkable Labelings with Small Messages. CoRR (2021)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Distributed Δ-Coloring Plays Hide-and-Seek. CoRR (2021)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
Locally Checkable Problems in Rooted Trees. CoRR (2021)
Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela
Local Mending. CoRR (2021)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela
Almost global problems in the LOCAL model. Distributed Comput. 34 (4) (2021)
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
Lower Bounds for Maximal Matchings and Maximal Independent Sets. J. ACM 68 (5) (2021)
Alkida Balliu, Fabian Kuhn, Dennis Olivetti
Improved Distributed Fractional Coloring Algorithms. OPODIS (2021)
Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela
Locally Checkable Labelings with Small Messages. DISC (2021)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. CoRR (2021)
Alkida Balliu, Fabian Kuhn, Dennis Olivetti
Improved Distributed Fractional Coloring Algorithms. CoRR (2021)
Alkida Balliu, Fabian Kuhn, Dennis Olivetti
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. CoRR (2020)
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC (2020)
Alkida Balliu, Fabian Kuhn, Dennis Olivetti
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. PODC (2020)
Mirza Ahad Baig, Alkida Balliu, Peter Davies, Michal Dory
PODC 2020 Review. SIGACT News 51 (4) (2020)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela
How much does randomness help with locally checkable problems? PODC (2020)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti
Distributed Lower Bounds for Ruling Sets. FOCS (2020)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti
Distributed Lower Bounds for Ruling Sets. CoRR (2020)
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela
Classification of Distributed Binary Labeling Problems. DISC (2020)
Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela
Locality of not-so-weak coloring. CoRR (2019)
Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela
Hardness of Minimal Symmetry Breaking in Distributed Computing. PODC (2019)
Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti
On Non-Cooperativeness in Social Distance Games. J. Artif. Intell. Res. 66 (2019)
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela
Classification of distributed binary labeling problems. CoRR (2019)
Alkida Balliu, Pierre Fraigniaud
Certification of Compact Low-Stretch Routing Schemes. Comput. J. 62 (5) (2019)
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
Lower bounds for maximal matchings and maximal independent sets. CoRR (2019)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. PODC (2019)
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
Lower Bounds for Maximal Matchings and Maximal Independent Sets. FOCS (2019)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela
How much does randomness help with locally checkable problems? CoRR (2019)
Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela
Locality of Not-so-Weak Coloring. SIROCCO (2019)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
What can be verified locally? J. Comput. Syst. Sci. 97 (2018)
Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela
New classes of distributed time complexity. STOC (2018)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela
Almost Global Problems in the LOCAL Model. DISC (2018)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
The distributed complexity of locally checkable problems on paths is decidable. CoRR (2018)
Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela
Hardness of minimal symmetry breaking in distributed computing. CoRR (2018)
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela
Almost Global Problems in the LOCAL Model. CoRR (2018)
Alkida Balliu, Pierre Fraigniaud
Certification of Compact Low-Stretch Routing Schemes. CoRR (2017)
Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela
New Classes of Distributed Time Complexity. CoRR (2017)
Alkida Balliu, Michele Flammini, Dennis Olivetti
On Pareto Optimality in Social Distance Games. AAAI (2017)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
What Can Be Verified Locally?. STACS (2017)
Alkida Balliu, Pierre Fraigniaud
Certification of Compact Low-Stretch Routing Schemes. DISC (2017)
Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti
Nash Stability in Social Distance Games. AAAI (2017)
Alkida Balliu, Pierre Fraigniaud, Zvi Lotker, Dennis Olivetti
Sparsifying Congested Cliques and Core-Periphery Networks. SIROCCO (2016)
Alkida Balliu, Dennis Olivetti, Özalp Babaoglu, Moreno Marzolla, Alina Sîrbu
A Big Data analyzer for large trace logs. Computing 98 (12) (2016)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
Local Distributed Verification. CoRR (2016)
Alkida Balliu, Dennis Olivetti, Özalp Babaoglu, Moreno Marzolla, Alina Sîrbu
A Big Data Analyzer for Large Trace Logs. CoRR (2015)
Alkida Balliu, Dennis Olivetti, Özalp Babaoglu, Moreno Marzolla, Alina Sîrbu
BiDAl: Big Data Analyzer for Cluster Traces. CoRR (2014)
Alkida Balliu, Dennis Olivetti, Özalp Babaoglu, Moreno Marzolla, Alina Sîrbu
BiDAl: Big Data Analyzer for Cluster Traces. GI-Jahrestagung (2014)