Cyril Gavoille
Cyril Gavoille
Professeur d'informatique, Université de Bordeaux
Verified email at
TitleCited byYear
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Journal of Algorithms 53 (1), 85-112, 2004
Routing in trees
P Fraigniaud, C Gavoille
International Colloquium on Automata, Languages, and Programming, 757-772, 2001
Compact and localized distributed data structures
C Gavoille, D Peleg
Distributed Computing 16 (2-3), 111-120, 2003
Routing in distributed networks: Overview and open problems
C Gavoille
ACM SIGACT News 32 (1), 36-52, 2001
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
A survey on interval routing
C Gavoille
Theoretical Computer Science 245 (2), 217-253, 2000
Memory requirement for routing in distributed networks
C Gavoille, S Pérennès
Annual ACM Symposium on Principles of Distributed Computing: Proceedings of …, 1996
Space-efficiency for routing schemes of stretch factor three
C Gavoille, M Gengler
Journal of Parallel and Distributed Computing 61 (5), 679-687, 2001
Nearest common ancestors: a survey and a new distributed algorithm
S Alstrup, C Gavoille, H Kaplan, T Rauhe, T Rauhe
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
Approximate distance labeling schemes
C Gavoille, M Katz, NA Katz, C Paul, D Peleg
European Symposium on Algorithms, 476-487, 2001
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
Nearest common ancestors: A survey and a new algorithm for a distributed environment
S Alstrup, C Gavoille, H Kaplan, T Rauhe
Theory of Computing Systems 37 (3), 441-456, 2004
Eclecticism shrinks even small worlds
P Fraigniaud, C Gavoille, C Paul
Distributed Computing 18 (4), 279-291, 2006
Object location using path separators
I Abraham, C Gavoille
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces
N Bonichon, C Gavoille, N Hanusse, D Ilcinkas
International Workshop on Graph-Theoretic Concepts in Computer Science, 266-278, 2010
Tree-decompositions with bags of small diameter
Y Dourisboure, C Gavoille
Discrete Mathematics 307 (16), 2008-2029, 2007
Compact routing schemes with low stretch factor
T Eilam, C Gavoille, D Peleg
PODC, 11-20, 1998
Distance labeling in hyperbolic graphs
C Gavoille, O Ly
International Symposium on Algorithms and Computation, 1071-1079, 2005
Compact name-independent routing with minimum stretch
I Abraham, C Gavoille, D Malkhi, N Nisan, M Thorup
ACM Transactions on Algorithms (TALG) 4 (3), 37, 2008
Memory requirement for universal routing schemes
P Fraigniaud, C Gavoille
PODC 95, 223-230, 1995
The system can't perform the operation now. Try again later.
Articles 1–20