| 2008 |
|---|
| 20 | | Olivier Bournez,
Jérémie Chalopin,
Johanne Cohen,
Xavier Koegler:
Playing With Population Protocols.
CSP 2008: 1-14 |
| 19 | EE | Jérémie Chalopin,
Emmanuel Godard,
Yves Métivier:
Local Terminations and Distributed Computability in Anonymous Networks.
DISC 2008: 47-62 |
| 18 | EE | Jérémie Chalopin,
Antoni Mazurkiewicz,
Yves Métivier:
Labelled (Hyper)Graphs, Negotiations and the Naming Problem.
ICGT 2008: 54-68 |
| 17 | EE | Jérémie Chalopin:
Election and rendezvous with incomparable labels.
Theor. Comput. Sci. 399(1-2): 54-70 (2008) |
| 2007 |
|---|
| 16 | EE | Jérémie Chalopin,
Shantanu Das,
Nicola Santoro:
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.
DISC 2007: 108-122 |
| 15 | EE | Jérémie Chalopin,
Daniel Gonçalves,
Pascal Ochem:
Planar graphs are in 1-STRING.
SODA 2007: 609-617 |
| 14 | EE | Jérémie Chalopin,
Emmanuel Godard,
Yves Métivier,
Gerard Tel:
About the Termination Detection in the Asynchronous Message Passing Model.
SOFSEM (1) 2007: 200-211 |
| 13 | EE | Jérémie Chalopin,
Pascal Ochem:
Dejean's conjecture and letter frequency.
Electronic Notes in Discrete Mathematics 28: 501-505 (2007) |
| 12 | EE | Jérémie Chalopin,
Yves Métivier:
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm.
Fundam. Inform. 80(1-3): 221-246 (2007) |
| 2006 |
|---|
| 11 | EE | Jérémie Chalopin,
Shantanu Das,
Nicola Santoro:
Groupings and Pairings in Anonymous Networks.
DISC 2006: 105-119 |
| 10 | EE | Jérémie Chalopin,
Emmanuel Godard,
Yves Métivier,
Rodrigue Ossamy:
Mobile Agent Algorithms Versus Message Passing Algorithms.
OPODIS 2006: 187-201 |
| 9 | EE | Jérémie Chalopin:
Election in the Qualitative World.
SIROCCO 2006: 85-99 |
| 8 | EE | Jérémie Chalopin,
Daniël Paulusma:
Graph Labelings Derived from Models in Distributed Computing.
WG 2006: 301-312 |
| 7 | EE | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Local Computations in Graphs: The Case of Cellular Edge Local Computations.
Fundam. Inform. 74(1): 85-114 (2006) |
| 2005 |
|---|
| 6 | EE | Jérémie Chalopin,
Yves Métivier:
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs.
MFCS 2005: 212-223 |
| 5 | EE | Jérémie Chalopin:
Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem.
SOFSEM 2005: 82-91 |
| 4 | | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Local Computation in Graphs: The Case of Cellular Edge Local Computations.
Bulletin of the EATCS 85: 105-109 (2005) |
| 2004 |
|---|
| 3 | EE | Jérémie Chalopin,
Yves Métivier:
Election and Local Computations on Edges.
FoSSaCS 2004: 90-104 |
| 2 | EE | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Election, Naming and Cellular Edge Local Computations.
ICGT 2004: 242-256 |
| 1 | EE | Jérémie Chalopin,
Hing Leung:
On factorization forests of finite height.
Theor. Comput. Sci. 310(1-3): 489-499 (2004) |
