( en | de | ru )

 

Disambiguation of "Chalopin, Jérémie"

Author of the publication

copydeleteadd this publication to your clipboard
On the power of synchronization between two adjacent processes.

, and . Distributed Comput., 23 (3): 177-196 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jérémie Decock

Jérémie Guiochet

Jérémie Allard

Jérémie Gaidamour

Jérémie Segouat

 

Other publications of authors with the same name

Proof of two Maurer's conjectures on basis graphs of matroids, , and . CoRR, (2012)Constructing a Map of an Anonymous Graph: Applications of Universal Sequences., , and . OPODIS, volume 6490 of Lecture Notes in Computer Science, page 119-134. Springer, (2010)Mobile Agent Algorithms Versus Message Passing Algorithms., , , and . OPODIS, volume 4305 of Lecture Notes in Computer Science, page 187-201. Springer, (2006)About the Termination Detection in the Asynchronous Message Passing Model., , , and . SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, page 200-211. Springer, (2007)Sample Compression Schemes for Balls in Graphs., , , , and . MFCS, volume 241 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Isometric Path Complexity of Graphs., , , and . MFCS, volume 272 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Rendezvous of Mobile Agents without Agreement on Local Orientation., and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 515-526. Springer, (2010)Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents., , , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 139-153. Springer, (2019)Packing Bipartite Graphs with Covers of Complete Bipartite Graphs., and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 276-287. Springer, (2010)Maximal Exploration of Trees with Energy-Constrained Agents., , , , and . CoRR, (2018)