default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCyril Gavoille
- > Home > Persons > Cyril Gavoille
Publications
- 2021
[c79]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1- 2011
- [e4]Cyril Gavoille, Pierre Fraigniaud:
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011. ACM 2011, ISBN 978-1-4503-0719-2 [contents] - 2009
- [j41]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21(6): 395-403 (2009) - [j36]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability. Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) - 2008
- [c54]Pierre Fraigniaud, Cyril Gavoille:
Polylogarithmic network navigability using compact metrics with small stretch. SPAA 2008: 62-69 - 2007
- [c52]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - [c49]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA 2007: 1-7 - 2006
- [j26]Pierre Fraigniaud, Cyril Gavoille:
Header-size lower bounds for end-to-end communication in memoryless networks. Comput. Networks 50(10): 1630-1638 (2006) - [j25]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
:
Eclecticism shrinks even small worlds. Distributed Comput. 18(4): 279-291 (2006) - 2004
- [c34]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. PODC 2004: 169-178 - 2003
- [c26]Pierre Fraigniaud, Cyril Gavoille:
Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC 2003: 211-223 - 2002
- [j13]Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Knödel graphs. Discret. Math. 250(1-3): 41-62 (2002) - [c23]Pierre Fraigniaud, Cyril Gavoille:
A Space Lower Bound for Routing in Trees. STACS 2002: 65-75 - 2001
- [j12]Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity. Distributed Comput. 14(4): 217-229 (2001) - [c20]Pierre Fraigniaud, Cyril Gavoille:
Routing in Trees. ICALP 2001: 757-772 - 2000
- [c17]Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson:
On Recognizing Cayley Graphs. ESA 2000: 76-87 - [c16]Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC 2000: 11-20 - 1999
- [c13]Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG 1999: 215-227 - 1998
- [j3]Pierre Fraigniaud, Cyril Gavoille:
Interval Routing Schemes. Algorithmica 21(2): 155-182 (1998) - [c11]Pierre Fraigniaud, Cyril Gavoille:
A Theoretical Model for Routing Complexity. SIROCCO 1998: 98-113 - 1997
- [j1]Pierre Fraigniaud, Cyril Gavoille:
Universal Routing Schemes. Distributed Comput. 10(2): 65-78 (1997) - 1996
- [c5]Pierre Fraigniaud, Cyril Gavoille:
Local Memory Requirement of Universal Routing Schemes. SPAA 1996: 183-188 - 1995
- [c4]Pierre Fraigniaud, Cyril Gavoille:
Memory Requirement for Universal Routing Schemes. PODC 1995: 223-230 - 1994
- [c2]Pierre Fraigniaud, Cyril Gavoille:
Optimal Interval Routing. CONPAR 1994: 785-796 - [c1]Pierre Fraigniaud, Cyril Gavoille:
A Characterization of Networks Supporting Linear Interval Routing. PODC 1994: 216-224
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-24 23:05 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:
