I'm a former phd. student at LaBRI, I used to work on distributed graph problems (mostly routing schemes). And I'm currently working at Kune.
You can find me on various communities under the alias cglacet
More about me
- Most important journals/conferences I published to: SODA, PODC, INFOCOM, TALG, DISC.
- I have an Erdos number of 3 via Avery Miller -> Jeffrey Shallit (find your distance).
- The slides I made for my last presentation Time vs. Information Tradeoffs for Leader Election in Anonymous Trees.
- My favorites computer science related topics are
- discrete mathematics/algorithms,
- computational complexity,
- design patterns and programming paradigms,
- and of course puzzle and riddles of any kind... yes this is related to computer science :D
- My native language is French but I also know English
- My native keyboard layout is azerty but I also know bépo
- My all time favorite:
- github repository is pytudes by Peter Norvig.
- riddle is the 100 Prisoners and A light Bulb.
- programming language is Python.
- proof is Mario bros is NP-hard.
- talk is How not to be ignorant (or, from the same speaker: Religions and babies).
I'm currently working using both python and react-native, this is what I'm currently spending my time on and therefore this will be the most active part of this blog for the years to come:
-
Python
- One step closer to using Python properly (try the interactive notebook version)
- My solutions to exercism.io problems
- Stackoverflow questions/answers:
- Flatten an irregular nested lists
- Implementing a Generator for Sequences of Lookahead Pairs
- Python How to force object instantiation via Context Manager?
- What can cause the simple invocation of asyncio.new_event_loop() to hang?
- Code review: currying a function (with an incredible answer)
- Is it possibe to compare values of a dictionary with an int without using dictionary comprehension?
-
ES6 / React / React native
- Create a theming tool
- Stackoverflow questions/answers:
Publications ordered by themes then descending date of publication, but first, in case you can read french, here is my phd. thesis.
-
Graph problems / Discrete algorithms
-
C. Glacet, A. Miller, A. Pelc. Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms13(3) :31:1-31:41(2017)
-
C. Glacet, N. Hanusse, D. Ilcinkas. The impact of dynamic events on the number of errors in networks. Theor. Comput. Sci.627 :1-12(2016)
-
C. Glacet, A. Miller, A. Pelc. Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. SODA2016 :600-609
-
C. Glacet, A. Miller, A. Pelc. Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. CoRR abs/1505.04308
-
C. Glacet, N. Hanusse, D. Ilcinkas, C. Johnen. Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS2014 :120-134
-
C. Glacet, N. Hanusse, D. Ilcinkas. The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS2011 :378-391
-
-
Routing
-
C. Gavoille, C. Glacet, N. Hanusse, D. Ilcinkas. Brief Announcement: Routing the Internet with Very Few Entries. PODC2015 :33-35
-
Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, et al.. Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Network31(4) :108-118(2017)
-
C. Gavoille, C. Glacet, N. Hanusse, D. Ilcinkas. On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC2013 :418-432
-
-
Vehicular networks
-
L. Bedogni, M. Fiore, C. Glacet. Temporal Reachability in Vehicular Networks. INFOCOM2018 :81-89
-
C. Glacet, M. Fiore, M. Gramaglia. Temporal connectivity of vehicular networks: The power of store-carry-and-forward. VNC2015 :52-59
-
-
In french
-
C Glacet, A Miller, A Pelc. Compromis temps-information pour l'élection de leader dans des arbres anonymes. Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications — ALGOTEL 2016 [PDF]
-
C. Glacet, N. Hanusse and D. Ilcinkas. Router sur internet avec moins de quinze entrées. Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications — ALGOTEL 2015 [PDF]
-
C. Glacet, N. Hanusse and D. Ilcinkas. Impact de la dynamique sur la fiabilité d’informations de routage. Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications — ALGOTEL 2014 [PDF]
-
C. Gavoille, C. Glacet, N. Hanusse and D. Ilcinkas. Algorithme distribué de routage compact en temps optimal. Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications — ALGOTEL 2013 [PDF]
-
C. Glacet and L. Verdonk. Vers un routage compact distribué. Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications — ALGOTEL 2012 [PDF]
-
- Nicolas Hanusse (5)
- David Ilcinkas (5)
- Andrzej Pelc (4)
- Avery Miller (4)
- Cyril Gavoille (3)
- Marco Fiore (2)
- Marco Gramaglia (1)
- Luca Bedogni (1)
- Lucas Verdonk (1)
- Colette Johnen (1)
- And many others from the Euler-fire-project (An European project on the topic of routing schemes)
- A paper with a very brief sumup is available here