Alexandre Nolin

According to our database, Alexandre Nolin authored at least 23 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Faster Distributed Δ-Coloring via a Reduction to MIS.

Yann Bourreau, Sebastian Brandt, Alexandre Nolin

CoRR, August, 2025

Optimal Deterministic Rendezvous in Labeled Lines.

Yann Bourreau, Ananth Narayanan, Alexandre Nolin

CoRR, May, 2025

Faster Distributed Δ-Coloring via Ruling Subgraphs.

Yann Bourreau, Sebastian Brandt, Alexandre Nolin

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Decentralized Distributed Graph Coloring: Cluster Graphs.

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

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

Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines.

Yann Bourreau, Ananth Narayanan, Alexandre Nolin

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

2024

Content-Oblivious Leader Election on Rings.

Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin

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

Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs.

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

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

A Distributed Palette Sparsification Theorem.

Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin

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

Brief Announcement: Content-Oblivious Leader Election on Rings.

Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin

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

2023

Superfast coloring in CONGEST via efficient color sampling.

Magnús M. Halldórsson, Alexandre Nolin

Theor. Comput. Sci., February, 2023

The communication complexity of functions with large outputs.

Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin

Electron. Colloquium Comput. Complex., 2023

Fast Coloring Despite Congested Relays.

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

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

Coloring Fast with Broadcasts.

Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Distributed Coloring of Hypergraphs.

Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin

Proceedings of the Structural Information and Communication Complexity, 2023

2022

Fast Distributed Vertex Splitting with Applications.

Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin

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

Near-optimal distributed degree+1 coloring.

Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan

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

Overcoming Congestion in Distributed Coloring.

Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan

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

2021

Ultrafast Distributed Coloring of High Degree Graphs.

Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan

CoRR, 2021

2020

Communication complexity : large output functions, partition bounds, and quantum nonlocality. (Complexité de la communication : fonctions à grande sortie, bornes partitions et non-localité quantique).

Alexandre Nolin

PhD thesis, 2020

Coloring Fast Without Learning Your Neighbors' Colors.

Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin

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

Distributed Testing of Distance-k Colorings.

Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin

Proceedings of the Structural Information and Communication Complexity, 2020

2018

Robust Bell inequalities from communication complexity.

Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno

Quantum, 2018

2015

Efficient and Practical Tree Preconditioning for Solving Laplacian Systems.

Luca Castelli Aleardi, Alexandre Nolin, Maks Ovsjanikov

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015