C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111--120, 2003. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Small Induced-Universal Graphs and Compact Implicit Graph.. - Alstrup, Rauhe (2002) (2 citations) (Correct)
Routing with Improved Communication-Space Trade-Off.. - Abraham, Gavoille.. (2004) (3 citations) (Correct)
Routing with Improved Communication-Space Trade-Off.. - Abraham, Gavoille.. (2004) (3 citations) (Correct)
ACM SIGACT News Distributed Computing Column 13 - Sergio Rajsba Um (Correct)
Compact Name-Independent Routing with Minimum Stretch - Abraham, Gavoille, al. (2004) (5 citations) Self-citation (Gavoille) (Correct)
Routing with Improved Communication-Space Trade-Off - Abraham, Gavoille, Malkhi (2004) (3 citations) Self-citation (Gavoille) (Correct)
Compact Name-Independent Routing with Minimum Stretch - Abraham, Gavoille, al. (2004) (5 citations) Self-citation (Gavoille) (Correct)
Small Diameter Bag Tree-Decompositions - Dourisbourre, Gavoille (2004) Self-citation (Gavoille) (Correct)
Optimal Distance Labeling for Interval and Circular-arc Graphs - Gavoille, Paul Self-citation (Gavoille) (Correct)
A Note on Implicit Representation of Graphs - Gavoille (2001) Self-citation (Gavoille) (Correct)
Small Universal Distance Matrices - Gavoille, Paul (2003) Self-citation (Gavoille) (Correct)
Distance Labeling Scheme and Split Decomposition - Gavoille, Paul (2001) Self-citation (Gavoille) (Correct)
A Space Lower Bound for Routing in Trees - Fraigniaud, Gavoille (2001) (4 citations) Self-citation (Gavoille) (Correct)
A Space Lower Bound for Routing in Trees - Fraigniaud, Gavoille (2002) (4 citations) Self-citation (Gavoille) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC