Follow
Cyril Gavoille
Cyril Gavoille
Professeur d'informatique, Université de Bordeaux
Verified email at labri.fr
Title
Cited by
Cited by
Year
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Journal of Algorithms 53 (1), 85-112, 2004
4402004
Routing in trees
P Fraigniaud, C Gavoille
Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001
2182001
Nearest common ancestors: a survey and a new distributed algorithm
S Alstrup, C Gavoille, H Kaplan, T Rauhe
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
2112002
Compact and localized distributed data structures
C Gavoille, D Peleg
Distributed Computing 16, 111-120, 2003
1612003
Space-efficiency for routing schemes of stretch factor three
C Gavoille, M Gengler
Journal of Parallel and Distributed Computing 61 (5), 679-687, 2001
1422001
Compact routing schemes with low stretch factor
T Eilam, C Gavoille, D Peleg
Proceedings of the seventeenth annual ACM symposium on Principles of …, 1998
1421998
Routing in distributed networks: Overview and open problems
C Gavoille
ACM SIGACT News 32 (1), 36-52, 2001
1412001
Routing in networks with low doubling dimension
I Abraham, C Gavoille, AV Goldberg, D Malkhi
26th IEEE International Conference on Distributed Computing Systems (ICDCS …, 2006
1302006
Memory requirement for routing in distributed networks
C Gavoille, S Pérennès
Proceedings of the fifteenth annual ACM symposium on Principles of …, 1996
1291996
Approximate distance labeling schemes
C Gavoille, M Katz, NA Katz, C Paul, D Peleg
Algorithms—ESA 2001: 9th Annual European Symposium Århus, Denmark, August …, 2001
1202001
Compact name-independent routing with minimum stretch
I Abraham, C Gavoille, D Malkhi, N Nisan, M Thorup
Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004
1132004
A survey on interval routing
C Gavoille
Theoretical Computer Science 245 (2), 217-253, 2000
1132000
Object location using path separators
I Abraham, C Gavoille
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
1052006
Tree-decompositions with bags of small diameter
Y Dourisboure, C Gavoille
Discrete Mathematics 307 (16), 2008-2029, 2007
1002007
Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces
N Bonichon, C Gavoille, N Hanusse, D Ilcinkas
Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010
962010
Eclecticism shrinks even small worlds
P Fraigniaud, C Gavoille, C Paul
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
962004
Planar graphs, via well-orderly maps and trees
N Bonichon, C Gavoille, N Hanusse, D Poulalhon, G Schaeffer
Graphs and Combinatorics 22, 185-202, 2006
862006
Distance labeling in hyperbolic graphs
C Gavoille, O Ly
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005
842005
Compact name-independent routing with minimum stretch
I Abraham, C Gavoille, D Malkhi, N Nisan, M Thorup
ACM Transactions on Algorithms (TALG) 4 (3), 1-12, 2008
742008
A space lower bound for routing in trees
P Fraigniaud, C Gavoille
STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science …, 2002
692002
The system can't perform the operation now. Try again later.
Articles 1–20