The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jérémie Chalopin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jérémie Chalopin, Yves Métivier
    Election and Local Computations on Edges. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:90-104 [Conf]
  2. Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
    Election, Naming and Cellular Edge Local Computations. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:242-256 [Conf]
  3. Jérémie Chalopin, Yves Métivier
    A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:212-223 [Conf]
  4. Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
    Mobile Agent Algorithms Versus Message Passing Algorithms. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:187-201 [Conf]
  5. Jérémie Chalopin
    Election in the Qualitative World. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:85-99 [Conf]
  6. Jérémie Chalopin
    Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:82-91 [Conf]
  7. Jérémie Chalopin, Shantanu Das, Nicola Santoro
    Groupings and Pairings in Anonymous Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:105-119 [Conf]
  8. Jérémie Chalopin, Daniël Paulusma
    Graph Labelings Derived from Models in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:301-312 [Conf]
  9. Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
    Local Computation in Graphs: The Case of Cellular Edge Local Computations. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:85, n:, pp:105-109 [Journal]
  10. Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
    Local Computations in Graphs: The Case of Cellular Edge Local Computations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:1, pp:85-114 [Journal]
  11. Jérémie Chalopin, Hing Leung
    On factorization forests of finite height. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:489-499 [Journal]
  12. Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
    Planar graphs are in 1-STRING. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:609-617 [Conf]
  13. Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
    About the Termination Detection in the Asynchronous Message Passing Model. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:200-211 [Conf]
  14. Jérémie Chalopin, Shantanu Das, Nicola Santoro
    Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:108-122 [Conf]

  15. How Simple Robots Benefit from Looking Back. [Citation Graph (, )][DBLP]


  16. Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. [Citation Graph (, )][DBLP]


  17. Labelled (Hyper)Graphs, Negotiations and the Naming Problem. [Citation Graph (, )][DBLP]


  18. Rendezvous of Mobile Agents without Agreement on Local Orientation. [Citation Graph (, )][DBLP]


  19. Every planar graph is the intersection graph of segments in the plane: extended abstract. [Citation Graph (, )][DBLP]


  20. Local Terminations and Distributed Computability in Anonymous Networks. [Citation Graph (, )][DBLP]


  21. Rendezvous of Mobile Agents in Directed Graphs. [Citation Graph (, )][DBLP]


  22. Playing With Population Protocols [Citation Graph (, )][DBLP]


  23. Population Protocols that Correspond to Symmetric Games [Citation Graph (, )][DBLP]


  24. Cop and robber games when the robber can hide and ride [Citation Graph (, )][DBLP]


  25. Planar Graphs Have 1-string Representations. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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