default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Nolin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Fabian Frei
, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Brief Announcement: Content-Oblivious Leader Election on Rings. PODC 2024: 549-552- [c15]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. SODA 2024: 4083-4123 - [c14]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. DISC 2024: 24:1-24:22 - [c13]Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Content-Oblivious Leader Election on Rings. DISC 2024: 26:1-26:20 - [i15]Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Content-Oblivious Leader Election on Rings. CoRR abs/2405.03646 (2024) - [i14]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring: Cluster Graphs. CoRR abs/2405.07725 (2024) - [i13]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs. CoRR abs/2408.11041 (2024) - 2023
- [j1]Magnús M. Halldórsson, Alexandre Nolin:
Superfast coloring in CONGEST via efficient color sampling. Theor. Comput. Sci. 948: 113711 (2023) - [c12]Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Coloring of Hypergraphs. SIROCCO 2023: 89-111 - [c11]Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The Communication Complexity of Functions with Large Outputs. SIROCCO 2023: 427-458 - [c10]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. SPAA 2023: 455-465 - [c9]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Fast Coloring Despite Congested Relays. DISC 2023: 19:1-19:24 - [e1]Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu:
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023. ACM 2023 [contents] - [i12]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. CoRR abs/2301.06457 (2023) - [i11]Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The communication complexity of functions with large outputs. CoRR abs/2304.00391 (2023) - [i10]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. CoRR abs/2304.09844 (2023) - [i9]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Fast Coloring Despite Congested Relays. CoRR abs/2308.01359 (2023) - [i8]Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The communication complexity of functions with large outputs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c8]Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Overcoming Congestion in Distributed Coloring. PODC 2022: 26-36 - [c7]Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan:
Near-optimal distributed degree+1 coloring. STOC 2022: 450-463 - [c6]Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. DISC 2022: 26:1-26:24 - [i7]Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Overcoming Congestion in Distributed Coloring. CoRR abs/2205.14478 (2022) - [i6]Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. CoRR abs/2208.08119 (2022) - 2021
- [c5]Magnús M. Halldórsson, Alexandre Nolin:
Superfast Coloring in CONGEST via Efficient Color Sampling. SIROCCO 2021: 68-83 - [i5]Magnús M. Halldórsson, Alexandre Nolin:
Superfast Coloring in CONGEST via Efficient Color Sampling. CoRR abs/2102.04546 (2021) - [i4]Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Ultrafast Distributed Coloring of High Degree Graphs. CoRR abs/2105.04700 (2021) - [i3]Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan:
Near-Optimal Distributed Degree+1 Coloring. CoRR abs/2112.00604 (2021) - 2020
- [b1]Alexandre Nolin:
Communication complexity : large output functions, partition bounds, and quantum nonlocality. (Complexité de la communication : fonctions à grande sortie, bornes partitions et non-localité quantique). University of Paris, France, 2020 - [c4]Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Testing of Distance-k Colorings. SIROCCO 2020: 275-290 - [c3]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. DISC 2020: 39:1-39:17 - [i2]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. CoRR abs/2008.04303 (2020)
2010 – 2019
- 2016
- [c2]Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno:
Robust Bell Inequalities from Communication Complexity. TQC 2016: 5:1-5:24 - [i1]Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno:
Robust Bell inequalities from communication complexity. CoRR abs/1606.09514 (2016) - 2015
- [c1]Luca Castelli Aleardi, Alexandre Nolin, Maks Ovsjanikov:
Efficient and Practical Tree Preconditioning for Solving Laplacian Systems. SEA 2015: 219-231
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
