| Time vs. information tradeoffs for leader election in anonymous trees C Glacet, A Miller, A Pelc ACM Transactions on Algorithms (TALG) 13 (3), 1-41, 2017 | 39 | 2017 |
| Temporal connectivity of vehicular networks: The power of store-carry-and-forward C Glacet, M Fiore, M Gramaglia 2015 IEEE Vehicular Networking Conference (VNC), 52-59, 2015 | 38 | 2015 |
| Temporal reachability in vehicular networks L Bedogni, M Fiore, C Glacet IEEE INFOCOM 2018-IEEE Conference on Computer Communications, 81-89, 2018 | 30 | 2018 |
| Disconnected components detection and rooted shortest-path tree maintenance in networks G Christian, H Nicolas, I David, J Colette Stabilization, Safety, and Security of Distributed Systems: 16th …, 2014 | 15 | 2014 |
| On the communication complexity of distributed name-independent routing schemes C Gavoille, C Glacet, N Hanusse, D Ilcinkas International Symposium on Distributed Computing, 418-432, 2013 | 13 | 2013 |
| Routing at large scale: Advances and challenges for complex networks S Sahhaf, W Tavernier, D Papadimitriou, D Careglio, A Kumar, C Glacet, ... IEEE network 31 (4), 108-118, 2017 | 10 | 2017 |
| Disconnected components detection and rooted shortest-path tree maintenance in networks C Glacet, N Hanusse, D Ilcinkas, C Johnen Journal of Parallel and Distributed Computing 132, 299-309, 2019 | 6 | 2019 |
| Brief announcement: Routing the internet with very few entries C Gavoille, C Glacet, N Hanusse, D Ilcinkas Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 5 | 2015 |
| The impact of edge deletions on the number of errors in networks C Glacet, N Hanusse, D Ilcinkas International Conference On Principles Of Distributed Systems, 378-391, 2011 | 4 | 2011 |
| Disconnected components detection and rooted shortest-path tree maintenance in networks-extended version C Glacet, N Hanusse, D Ilcinkas, C Johnen LaBRI, CNRS UMR 5800, 2016 | 3 | 2016 |
| The impact of dynamic events on the number of errors in networks C Glacet, N Hanusse, D Ilcinkas Theoretical Computer Science 627, 1-12, 2016 | 1 | 2016 |
| Vers un routage compact distribué C Glacet, V Lucas 14èmes Rencontres Francophones sur les Aspects Algorithmiques des …, 2012 | 1 | 2012 |
| Compromis temps-information pour l'élection de leader dans des arbres anonymes C Glacet, A Miller, A Pelc ALGOTEL 2016-18èmes Rencontres Francophones sur les Aspects Algorithmiques …, 2016 | | 2016 |
| Routing the Internet with fifteen entries C Gavoille, C Glacet, N Hanusse, D Ilcinkas ALGOTEL 2015—17èmes Rencontres Francophones sur les Aspects Algorithmiques …, 2015 | | 2015 |
| Router dans Internet avec quinze entrees C Gavoille, C Glacet, N Hanusse, D Ilcinkas ALGOTEL 2015—17èmes Rencontres Francophones sur les Aspects Algorithmiques …, 2015 | | 2015 |
| Impact de la dynamique sur la fiabilité d'informations de routage C Glacet, N Hanusse, D Ilcinkas ALGOTEL 2014--16èmes Rencontres Francophones sur les Aspects Algorithmiques …, 2014 | | 2014 |
| Algorithmes de routage: de la réduction des coûts de communication à la dynamique C Glacet Université Sciences et Technologies-Bordeaux I, 2013 | | 2013 |
| Algorithmes de routage C GLACET université de Bordeaux, 2013 | | 2013 |
| Algorithme distribue de routage compact en temps optimal C Gavoille, C Glacet, N Hanusse, D Ilcinkas 15èmes Rencontres Francophones sur les Aspects Algorithmiques des …, 2013 | | 2013 |
| Vers un routage compact distribué G Christian, V Lucas 14 èmes Rencontres Francophones sur les Aspects Algorithmiques des …, 2012 | | 2012 |
nicolas hanusseResearch Director of Computer Science, CNRS, Bordeaux University, LaBRIVerified email at labri.fr
