Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Glacet
Person information
- affiliation: University of Bordeaux, Talence, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Christian Glacet:
Algorithmes de routage : de la réduction des coûts de communication à la dynamique. (Routing algorithms : from communication cost reduction to network dynamics). University of Bordeaux, France, 2013
Journal Articles
- 2019
- [j4]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
:
Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Comput. 132: 299-309 (2019) - 2017
- [j3]Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluís Fàbrega, Pere Vilà, Miguel Camelo, Pieter Audenaert, Didier Colle, Piet Demeester:
Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Netw. 31(4): 108-118 (2017) - [j2]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms 13(3): 31:1-31:41 (2017) - 2016
- [j1]Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The impact of dynamic events on the number of errors in networks. Theor. Comput. Sci. 627: 1-12 (2016)
Conference and Workshop Papers
- 2018
- [c7]Luca Bedogni, Marco Fiore, Christian Glacet:
Temporal Reachability in Vehicular Networks. INFOCOM 2018: 81-89 - 2016
- [c6]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. SODA 2016: 600-609 - 2015
- [c5]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
Brief Announcement: Routing the Internet with Very Few Entries. PODC 2015: 33-35 - [c4]Christian Glacet, Marco Fiore, Marco Gramaglia:
Temporal connectivity of vehicular networks: The power of store-carry-and-forward. VNC 2015: 52-59 - 2014
- [c3]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS 2014: 120-134 - 2013
- [c2]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC 2013: 418-432 - 2011
- [c1]Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011: 378-391
Informal and Other Publications
- 2015
- [i1]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. CoRR abs/1505.04308 (2015)
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-04-25 01:32 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:
