The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre Fraigniaud: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
    The Reduced Automata Technique for Graph Exploration Space Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:1-26 [Conf]
  2. Michel Cosnard, Pierre Fraigniaud
    A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1990, pp:875-886 [Conf]
  3. Pierre Fraigniaud, Cyril Gavoille
    Optimal Interval Routing. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1994, pp:785-796 [Conf]
  4. Lali Barrière, Pierre Fraigniaud, Lata Narayanan
    Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:19-27 [Conf]
  5. Pierre Fraigniaud
    Fault-Tolerant Gossiping on Hypercube Multicomputers. [Citation Graph (0, 0)][DBLP]
    EDMCC, 1991, pp:463-472 [Conf]
  6. Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson
    On Recognizing Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:76-87 [Conf]
  7. Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
    Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:184-195 [Conf]
  8. Pierre Fraigniaud
    Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:440-451 [Conf]
  9. Pierre Fraigniaud
    Greedy Routing in Tree-Decomposed Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:791-802 [Conf]
  10. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
    A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:376-386 [Conf]
  11. Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy
    Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:1163-1172 [Conf]
  12. Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann
    Topic Introduction. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:884- [Conf]
  13. Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis
    Topic 12: Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:799- [Conf]
  14. Pierre Fraigniaud, Joseph G. Peters
    Structured communication in torus networks. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:584-593 [Conf]
  15. Pierre Fraigniaud
    Navigability of Small World Networks. [Citation Graph (0, 0)][DBLP]
    HiPC, 2006, pp:1- [Conf]
  16. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
    Label-Guided Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:335-346 [Conf]
  17. Pierre Fraigniaud, Cyril Gavoille
    Routing in Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:757-772 [Conf]
  18. Thierry Chich, Pierre Fraigniaud
    An extended comparison of slotted and unslotted deflection routing. [Citation Graph (0, 0)][DBLP]
    ICCCN, 1997, pp:92-97 [Conf]
  19. Eric Fleury, Pierre Fraigniaud
    Multicasting in Meshes. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:151-158 [Conf]
  20. Pierre Fraigniaud, Ching-Tien Ho
    Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1991, pp:225-229 [Conf]
  21. Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
    HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:42- [Conf]
  22. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
    Broadcasting and Multicasting in Cut-through Routed Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:734-738 [Conf]
  23. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
    Labeling Schemes for Tree Representation. [Citation Graph (0, 0)][DBLP]
    IWDC, 2005, pp:13-24 [Conf]
  24. Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
    Collective Tree Exploration. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:141-151 [Conf]
  25. Pierre Fraigniaud, Nicolas Nisse
    Connected Treewidth and Connected Graph Searching. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:479-490 [Conf]
  26. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
    Nondeterministic Graph Searching: From Pathwidth to Treewidth. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:364-375 [Conf]
  27. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
    Tree Exploration with an Oracle. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:24-37 [Conf]
  28. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
    Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:451-462 [Conf]
  29. J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
    Reducing Packet-Loss by Taking Long-Range Dependences into Account. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2004, pp:1096-1107 [Conf]
  30. Pierre Fraigniaud, Christian Laforest
    Disjoint Spanning Trees of Small Depth. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:105-112 [Conf]
  31. Pierre Fraigniaud, Philippe Gauron
    Brief announcement: an overview of the content-addressable network D2B. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:151- [Conf]
  32. Pierre Fraigniaud, Cyril Gavoille
    A Characterization of Networks Supporting Linear Interval Routing. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:216-224 [Conf]
  33. Pierre Fraigniaud, Cyril Gavoille
    Memory Requirement for Universal Routing Schemes. [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:223-230 [Conf]
  34. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
    Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:11-20 [Conf]
  35. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
    Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:169-178 [Conf]
  36. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
    Oracle size: a new measure of difficulty for communication tasks. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:179-187 [Conf]
  37. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in unknown anonymous networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:101-111 [Conf]
  38. Pierre Fraigniaud, Cyril Gavoille
    A Theoretical Model for Routing Complexity. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:98-113 [Conf]
  39. Pierre Fraigniaud, Sandrine Vial
    Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:240-252 [Conf]
  40. Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
    Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:17-32 [Conf]
  41. Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
    Distributed Chasing of Network Intruders. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:70-84 [Conf]
  42. Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
    Space Lower Bounds for Graph Exploration via Reduced Automata. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:140-154 [Conf]
  43. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
    Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:781-790 [Conf]
  44. Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana
    Scheduling Calls for Multicasting in Tree-Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:881-882 [Conf]
  45. Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
    Tree exploration with little memory. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:588-597 [Conf]
  46. Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
    Capture of an intruder by mobile agents. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:200-209 [Conf]
  47. Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
    Can we elect if we cannot compare? [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:324-332 [Conf]
  48. Dominique Barth, Pierre Fraigniaud
    Approximation Algorithms for Structured Communication Problems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:180-188 [Conf]
  49. Pierre Fraigniaud, Cyril Gavoille
    Local Memory Requirement of Universal Routing Schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:183-188 [Conf]
  50. Pierre Fraigniaud, Cyril Gavoille
    A Space Lower Bound for Routing in Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:65-75 [Conf]
  51. Pierre Fraigniaud, David Ilcinkas
    Digraphs Exploration with Little Memory. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:246-257 [Conf]
  52. Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc
    Efficient Routing in Networks with Long Range Contacts. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:270-284 [Conf]
  53. Pierre Fraigniaud, Cyril Gavoille
    Lower Bounds for Oblivious Single-Packet End-to-End Communication. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:211-223 [Conf]
  54. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
    Brief Announcement: On Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:551-553 [Conf]
  55. Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
    Searching Is Not Jumping. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:34-45 [Conf]
  56. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
    Recognizing Bipartite Incident-Graphs of Circulant Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:215-227 [Conf]
  57. Pierre Fraigniaud, Nicolas Nisse
    Monotony Properties of Connected Visible Graph Searching. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:229-240 [Conf]
  58. Pierre Fraigniaud, Cyril Gavoille
    Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:155-182 [Journal]
  59. Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
    Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:69-96 [Journal]
  60. Pierre Fraigniaud, Cyril Gavoille
    Header-size lower bounds for end-to-end communication in memoryless networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2006, v:50, n:10, pp:1630-1638 [Journal]
  61. Pierre Fraigniaud
    A note on line broadcast in digraphs under the edge-disjoint paths mode. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:320-323 [Journal]
  62. Pierre Fraigniaud, Emmanuel Lazard
    Methods and problems of communication in usual networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:79-133 [Journal]
  63. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
    Interval routing schemes allow broadcasting with linear message-complexity. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:4, pp:217-229 [Journal]
  64. Pierre Fraigniaud, Cyril Gavoille
    Universal Routing Schemes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1997, v:10, n:2, pp:65-78 [Journal]
  65. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
    Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:279-291 [Journal]
  66. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in an unknown anonymous network with a leader. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:3, pp:163-183 [Journal]
  67. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
    Recognizing Knödel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:41-62 [Journal]
  68. Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
    An algorithmic model for heterogeneous hyper-clusters: rationale and experience. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:195-215 [Journal]
  69. Pierre Fraigniaud, Claudine Peyrat
    Broadcasting in a Hypercube when Some Calls Fail. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:3, pp:115-119 [Journal]
  70. Pierre Fraigniaud
    Hierarchical Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:303-305 [Journal]
  71. Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc
    Finding a Target Subnetwork in Sparse Networks with Random Faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:6, pp:297-303 [Journal]
  72. Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
    Tree exploration with little memory. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:51, n:1, pp:38-63 [Journal]
  73. Eric Fleury, Pierre Fraigniaud
    Strategies for Path-Based Multicasting in Wormhole-Routed Meshes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:53, n:1, pp:26-62 [Journal]
  74. Pierre Fraigniaud
    Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:16, n:1, pp:15-26 [Journal]
  75. Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
    Efficient trigger-broadcasting in heterogeneous clusters. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:5, pp:628-642 [Journal]
  76. Pierre Fraigniaud, Sandrine Vial
    Approximation Algorithms for Broadcasting and Gossiping. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:43, n:1, pp:47-55 [Journal]
  77. Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana
    Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:6, pp:641-665 [Journal]
  78. Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:5/6, pp:335-335 [Journal]
  79. Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard
    Oriented hypercubes. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:2, pp:98-106 [Journal]
  80. Pierre Fraigniaud, Christian Laforest
    Minimum gossip bus networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:239-251 [Journal]
  81. Pierre Fraigniaud, Joseph G. Peters
    Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:3, pp:150-162 [Journal]
  82. Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
    Collective tree exploration. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:3, pp:166-177 [Journal]
  83. Michel Cosnard, Pierre Fraigniaud
    Finding the roots of a polynomial on an MIMD multicomputer. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:15, n:1-3, pp:75-85 [Journal]
  84. Pierre Fraigniaud, Serge Miguet, Yves Robert
    Scattering on a ring of processors. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:13, n:3, pp:377-383 [Journal]
  85. Henri-Pierre Charles, Pierre Fraigniaud
    Scheduling a Scattering-Gathering Sequence on Hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:29-42 [Journal]
  86. Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
    Open Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:507-524 [Journal]
  87. Pierre Fraigniaud, Sandrine Vial
    Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:9-20 [Journal]
  88. Jean-Claude Bermond, Pierre Fraigniaud
    Broadcasting and Gossiping in de Bruijn Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:212-225 [Journal]
  89. Pierre Fraigniaud
    Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:11, pp:1410-1419 [Journal]
  90. Pierre Fraigniaud
    On XRAM and PRAM Models, and on Data-Movement-Intensive Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:194, n:1-2, pp:225-237 [Journal]
  91. Pierre Fraigniaud, Philippe Gauron
    D2B: A de Bruijn based content-addressable network. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:1, pp:65-79 [Journal]
  92. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
    Graph exploration by a finite automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:331-344 [Journal]
  93. Thierry Chich, Pierre Fraigniaud, Johanne Cohen
    Unslotted deflection routing: a practical and efficient protocol for multihop optical networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2001, v:9, n:1, pp:47-59 [Journal]
  94. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
    Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:8, pp:788-802 [Journal]
  95. Michel Cosnard, Pierre Fraigniaud
    Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:6, pp:639-648 [Journal]
  96. Eric Fleury, Pierre Fraigniaud
    A General Theory for Deadlock Avoidance in Wormhole-Routed Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:7, pp:626-638 [Journal]
  97. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
    Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. [Citation Graph (0, 0)][DBLP]
    Wireless Communications and Mobile Computing, 2003, v:3, n:2, pp:141-153 [Journal]
  98. Pierre Fraigniaud
    Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:2-11 [Conf]
  99. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
    Distributed Computing with Advice: Information Sensitivity of Graph Coloring. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:231-242 [Conf]
  100. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
    Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:1-7 [Conf]
  101. Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
    Local MST computation with short advice. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:154-160 [Conf]
  102. Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
    Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:2, pp:143-162 [Journal]

  103. Networks Become Navigable as Nodes Move and Forget. [Citation Graph (, )][DBLP]


  104. Online Computation with Advice. [Citation Graph (, )][DBLP]


  105. Informative Labeling Schemes. [Citation Graph (, )][DBLP]


  106. Provenance for database transformations. [Citation Graph (, )][DBLP]


  107. The Inframetric Model for the Internet. [Citation Graph (, )][DBLP]


  108. Forget him and keep on moving. [Citation Graph (, )][DBLP]


  109. The effect of power-law degrees on the navigability of small worlds: [extended abstract]. [Citation Graph (, )][DBLP]


  110. Parsimonious flooding in dynamic graphs. [Citation Graph (, )][DBLP]


  111. Distributed computational complexities: are you volvo-addicted or nascar-obsessed? [Citation Graph (, )][DBLP]


  112. Recovering the Long-Range Links in Augmented Graphs. [Citation Graph (, )][DBLP]


  113. Sub-linear Universal Spatial Gossip Protocols. [Citation Graph (, )][DBLP]


  114. Compact Ancestry Labeling Schemes for XML Trees. [Citation Graph (, )][DBLP]


  115. Polylogarithmic network navigability using compact metrics with small stretch. [Citation Graph (, )][DBLP]


  116. On randomized representations of graphs using short labels. [Citation Graph (, )][DBLP]


  117. On the bit communication complexity of randomized rumor spreading. [Citation Graph (, )][DBLP]


  118. Delays induce an exponential memory gap for rendezvous in trees. [Citation Graph (, )][DBLP]


  119. On the searchability of small-world networks with arbitrary underlying structure. [Citation Graph (, )][DBLP]


  120. An optimal ancestry scheme and small universal posets. [Citation Graph (, )][DBLP]


  121. On the Additive Constant of the k-Server Work Function Algorithm. [Citation Graph (, )][DBLP]


  122. Deterministic Rendezvous in Trees with Little Memory. [Citation Graph (, )][DBLP]


  123. Nondeterministic Graph Searching: From Pathwidth to Treewidth. [Citation Graph (, )][DBLP]


  124. Labeling Schemes for Tree Representation. [Citation Graph (, )][DBLP]


  125. Networks become navigable as nodes move and forget [Citation Graph (, )][DBLP]


  126. On the Additive Constant of the k-server Work Function Algorithm [Citation Graph (, )][DBLP]


  127. Compact Ancestry Labeling Schemes for Trees of Small Depth [Citation Graph (, )][DBLP]


  128. An Optimal Labeling Scheme for Ancestry Queries [Citation Graph (, )][DBLP]


  129. Impact of memory size on graph exploration capability. [Citation Graph (, )][DBLP]


  130. Special Issue DISC 2005. [Citation Graph (, )][DBLP]


  131. Distributed computing with advice: information sensitivity of graph coloring. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002