Efficient and Practical Tree Preconditioning for Solving Laplacian Systems. - Luca Castelli Aleardi; Alexandre Nolin; Maks Ovsjanikov (SEA, 2015)

Robust Bell inequalities from communication complexity. - Sophie Laplante; Mathieu Laurière; Alexandre Nolin; Jérémie Roland; Gabriel Senno (Quantum, 2018)

Distributed Testing of Distance-k Colorings. - Pierre Fraigniaud; Magnús M. Halldórsson; Alexandre Nolin (SIROCCO, 2020)

Coloring Fast Without Learning Your Neighbors' Colors. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus; Alexandre Nolin (DISC, 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 (2020)

Ultrafast Distributed Coloring of High Degree Graphs. - Magnús M. Halldórsson; Alexandre Nolin; Tigran Tonoyan (CoRR, 2021)

Overcoming Congestion in Distributed Coloring. - Magnús M. Halldórsson; Alexandre Nolin; Tigran Tonoyan (PODC, 2022)

Near-optimal distributed degree+1 coloring. - Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin; Tigran Tonoyan (STOC, 2022)

Fast Distributed Vertex Splitting with Applications. - Magnús M. Halldórsson; Yannic Maus; Alexandre Nolin (DISC, 2022)

Distributed Coloring of Hypergraphs. - Duncan Adamson; Magnús M. Halldórsson; Alexandre Nolin (SIROCCO, 2023)

Coloring Fast with Broadcasts. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SPAA, 2023)

Fast Coloring Despite Congested Relays. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (DISC, 2023)

The communication complexity of functions with large outputs. - Lila Fontes; Sophie Laplante; Mathieu Laurière; Alexandre Nolin (Electron. Colloquium Comput. Complex., 2023)

Superfast coloring in CONGEST via efficient color sampling. - Magnús M. Halldórsson; Alexandre Nolin (Theor. Comput. Sci., 2023)

Brief Announcement: Content-Oblivious Leader Election on Rings. - Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin (PODC, 2024)

A Distributed Palette Sparsification Theorem. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SODA, 2024)

Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (DISC, 2024)

Content-Oblivious Leader Election on Rings. - Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin (DISC, 2024)

Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines. - Yann Bourreau; Ananth Narayanan; Alexandre Nolin (PODC, 2025)

Decentralized Distributed Graph Coloring: Cluster Graphs. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (PODC, 2025)

Faster Distributed Δ-Coloring via Ruling Subgraphs. - Yann Bourreau; Sebastian Brandt 002; Alexandre Nolin (STOC, 2025)

Optimal Deterministic Rendezvous in Labeled Lines. - Yann Bourreau; Ananth Narayanan; Alexandre Nolin (CoRR, 2025)

Faster Distributed Δ-Coloring via a Reduction to MIS. - Yann Bourreau; Sebastian Brandt 002; Alexandre Nolin (CoRR, 2025)