default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémie Chalopin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Laurine Bénéteau, Jérémie Chalopin
, Victor Chepoi, Yann Vaxès:
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discret. Appl. Math. 359: 55-74 (2024)- [j38]Jérémie Chalopin, Victor Chepoi:
Boundary rigidity of CAT(0) cube complexes. J. Comb. Theory B 169: 352-366 (2024) - [j37]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. Math. Program. 203(1): 369-420 (2024) - [j36]Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob:
First-order logic axiomatization of metric graph theory. Theor. Comput. Sci. 993: 114460 (2024) - [c48]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel:
Non-Clashing Teaching Maps for Balls in Graphs. COLT 2024: 840-875 - [c47]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. SIROCCO 2024: 174-191 - [c46]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. DISC 2024: 13:1-13:17 - [i31]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. CoRR abs/2402.10582 (2024) - [i30]Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. CoRR abs/2408.08775 (2024) - 2023
- [j35]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. SIAM J. Discret. Math. 37(4): 2585-2616 (2023) - [c45]Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès:
Isometric Path Complexity of Graphs. MFCS 2023: 32:1-32:14 - [i29]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel:
Non-Clashing Teaching Maps for Balls in Graphs. CoRR abs/2309.02876 (2023) - [i28]Jérémie Chalopin, Victor Chepoi:
Boundary rigidity of finite CAT(0) cube complexes. CoRR abs/2310.04223 (2023) - 2022
- [j34]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in median graphs and their cube complexes in linear time. J. Comput. Syst. Sci. 126: 80-105 (2022) - [j33]Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth:
Unlabeled sample compression schemes and corner peelings for ample and maximum classes. J. Comput. Syst. Sci. 127: 1-28 (2022) - [c44]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. MFCS 2022: 31:1-31:14 - [i27]Jérémie Chalopin, Victor Chepoi, Ugo Giocanti:
Graphs with convex balls. CoRR abs/2201.01599 (2022) - [i26]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. CoRR abs/2201.12248 (2022) - [i25]Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob:
First-order logic axiomatization of metric graph theory. CoRR abs/2203.01070 (2022) - [i24]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. CoRR abs/2206.03587 (2022) - [i23]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample compression schemes for balls in graphs. CoRR abs/2206.13254 (2022) - 2021
- [j32]Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65(3): 856-892 (2021) - [j31]Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák:
Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849: 35-46 (2021) - [j30]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868: 87-96 (2021) - 2020
- [j29]Jérémie Chalopin, Victor Chepoi:
A counterexample to Thiagarajan's conjecture on regular event structures. J. Comput. Syst. Sci. 113: 76-100 (2020) - [j28]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020) - [c43]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in Median Graphs and Their Cube Complexes in Linear Time. ICALP 2020: 10:1-10:17
2010 – 2019
- 2019
- [j27]Jérémie Chalopin, Victor Chepoi:
1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. ACM Trans. Comput. Log. 20(3): 17:1-17:49 (2019) - [c42]Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth:
Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. ICALP 2019: 34:1-34:15 - [c41]Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák:
Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO 2019: 52-65 - [c40]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO 2019: 139-153 - [i22]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in median graphs in linear time. CoRR abs/1907.10398 (2019) - 2018
- [c39]Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes 2018: 191-215 - [c38]Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG 2018: 22:1-22:15 - [i21]Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou:
Maximal Exploration of Trees with Energy-Constrained Agents. CoRR abs/1802.06636 (2018) - [i20]Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR abs/1803.06324 (2018) - [i19]Jérémie Chalopin, Victor Chepoi:
1-Safe Petri nets and special cube complexes: equivalence and applications. CoRR abs/1810.03395 (2018) - [i18]Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth:
Unlabeled sample compression schemes and corner peelings for ample and maximum classes. CoRR abs/1812.02099 (2018) - 2017
- [c37]Jérémie Chalopin, Victor Chepoi:
A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. ICALP 2017: 101:1-101:14 - [c36]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS 2017: 10:1-10:14 - 2016
- [j26]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74(1): 117-155 (2016) - [j25]Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez:
Restricted Frame Graphs and a Conjecture of Scott. Electron. J. Comb. 23(1): 1 (2016) - [j24]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Rendezvous in networks in spite of delay faults. Distributed Comput. 29(3): 187-205 (2016) - [c35]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - [c34]Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs. WG 2016: 282-294 - [i17]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR abs/1603.04234 (2016) - [i16]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. CoRR abs/1604.05915 (2016) - [i15]Jérémie Chalopin, Victor Chepoi:
A counterexample to Thiagarajan's conjecture. CoRR abs/1605.08288 (2016) - [i14]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500 (2016) - [i13]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR abs/1610.02361 (2016) - 2015
- [j23]Jérémie Chalopin, Victor Chepoi, Guyslain Naves:
Isometric Embedding of Busemann Surfaces into L1. Discret. Comput. Geom. 53(1): 16-37 (2015) - [j22]Jérémie Chalopin, Victor Chepoi, Damian Osajda:
On two conjectures of Maurer concerning basis graphs of matroids. J. Comb. Theory B 114: 1-32 (2015) - [j21]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11(4): 33:1-33:16 (2015) - [c33]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Anonymous Graph Exploration with Binoculars. DISC 2015: 107-122 - [c32]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Limit Behavior of the Multi-agent Rotor-Router System. DISC 2015: 123-139 - [i12]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Anonymous Graph Exploration with Binoculars. CoRR abs/1505.00599 (2015) - 2014
- [j20]Jérémie Chalopin, Daniël Paulusma:
Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. 168: 40-50 (2014) - [j19]Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte:
Cop and Robber Game and Hyperbolicity. SIAM J. Discret. Math. 28(4): 1987-2007 (2014) - [c31]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. ICALP (2) 2014: 411-422 - [c30]Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) 2014: 423-434 - [c29]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
What Do We Need to Know to Elect in Networks with Unknown Participants? SIROCCO 2014: 279-294 - [i11]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. CoRR abs/1402.2760 (2014) - [i10]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Lock-in Problem for Parallel Rotor-router Walks. CoRR abs/1407.3200 (2014) - 2013
- [j18]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013) - [j17]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. 161(10-11): 1287-1307 (2013) - [j16]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. 9(1-2): 5-36 (2013) - [j15]Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès:
Retracts of Products of Chordal Graphs. J. Graph Theory 73(2): 161-180 (2013) - [j14]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509: 70-85 (2013) - [c28]Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS 2013: 111-122 - [i9]Jérémie Chalopin, Victor Chepoi, Guyslain Naves:
Isometric embedding of Busemann surfaces into L1. CoRR abs/1308.3181 (2013) - [i8]Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte:
Cop and robber game and hyperbolicity. CoRR abs/1308.3987 (2013) - 2012
- [j13]Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25(4): 297-311 (2012) - [j12]Jérémie Chalopin, Yves Métivier, Thomas Morsellino:
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Informaticae 120(1): 1-27 (2012) - [c27]Jérémie Chalopin, Yves Métivier, Thomas Morsellino:
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO 2012: 207-218 - [c26]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60 - [i7]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850 (2012) - [i6]Jérémie Chalopin, Victor Chepoi, Damian Osajda:
Proof of two Maurer's conjectures on basis graphs of matroids. CoRR abs/1212.6879 (2012) - 2011
- [j11]Jérémie Chalopin, Daniël Paulusma:
Graph labelings derived from models in distributed computing: A complete complexity classification. Networks 58(3): 207-231 (2011) - [j10]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. 25(1): 333-359 (2011) - [c25]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Computing with Pavlovian Populations. OPODIS 2011: 409-420 - [c24]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO 2011: 186-197 - [c23]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 - [c22]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC 2011: 432-446 - [i5]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings. CoRR abs/1104.5076 (2011) - [i4]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. CoRR abs/1106.6037 (2011) - [i3]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Asymetric Pavlovian Populations. CoRR abs/1109.4433 (2011) - 2010
- [j9]Jérémie Chalopin, Yves Métivier:
On the power of synchronization between two adjacent processes. Distributed Comput. 23(3): 177-196 (2010) - [j8]Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem:
Planar Graphs Have 1-string Representations. Discret. Comput. Geom. 43(3): 626-647 (2010) - [c21]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239 - [c20]Jérémie Chalopin, Daniël Paulusma:
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC 2010: 276-287 - [c19]Jérémie Chalopin, Shantanu Das:
Rendezvous of Mobile Agents without Agreement on Local Orientation. ICALP (2) 2010: 515-526 - [c18]Jérémie Chalopin, Shantanu Das, Adrian Kosowski:
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010: 119-134 - [c17]Jérémie Chalopin, Shantanu Das, Peter Widmayer:
Rendezvous of Mobile Agents in Directed Graphs. DISC 2010: 282-296 - [c16]Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro:
Network Exploration by Silent and Oblivious Robots. WG 2010: 208-219 - [i2]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and robber games when the robber can hide and ride. CoRR abs/1001.4457 (2010)
2000 – 2009
- 2009
- [c15]Jérémie Chalopin, Daniel Gonçalves:
Every planar graph is the intersection graph of segments in the plane: extended abstract. STOC 2009: 631-638 - [i1]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler:
Population Protocols that Correspond to Symmetric Games. CoRR abs/0907.3126 (2009) - 2008
- [j7]Jérémie Chalopin, Pascal Ochem:
Dejean's conjecture and letter frequency. RAIRO Theor. Informatics Appl. 42(3): 477-480 (2008) - [j6]Jérémie Chalopin:
Election and rendezvous with incomparable labels. Theor. Comput. Sci. 399(1-2): 54-70 (2008) - [c14]Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier:
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT 2008: 54-68 - [c13]Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62 - [c12]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler:
Playing With Population Protocols. CSP 2008: 3-15 - 2007
- [j5]Jérémie Chalopin, Pascal Ochem:
Dejean's conjecture and letter frequency. Electron. Notes Discret. Math. 28: 501-505 (2007) - [j4]Jérémie Chalopin, Yves Métivier:
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundam. Informaticae 80(1-3): 221-246 (2007) - [c11]Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem:
Planar graphs are in 1-STRING. SODA 2007: 609-617 - [c10]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 - [c9]Jérémie Chalopin, Shantanu Das, Nicola Santoro:
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. DISC 2007: 108-122 - 2006
- [j3]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae 74(1): 85-114 (2006) - [c8]Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy:
Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS 2006: 187-201 - [c7]Jérémie Chalopin:
Election in the Qualitative World. SIROCCO 2006: 85-99 - [c6]Jérémie Chalopin, Shantanu Das, Nicola Santoro:
Groupings and Pairings in Anonymous Networks. DISC 2006: 105-119 - [c5]Jérémie Chalopin, Daniël Paulusma:
Graph Labelings Derived from Models in Distributed Computing. WG 2006: 301-312 - 2005
- [j2]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS 85: 105-109 (2005) - [c4]Jérémie Chalopin, Yves Métivier:
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS 2005: 212-223 - [c3]Jérémie Chalopin:
Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. SOFSEM 2005: 82-91 - 2004
- [j1]Jérémie Chalopin, Hing Leung:
On factorization forests of finite height. Theor. Comput. Sci. 310(1-3): 489-499 (2004) - [c2]Jérémie Chalopin, Yves Métivier:
Election and Local Computations on Edges. FoSSaCS 2004: 90-104 - [c1]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Election, Naming and Cellular Edge Local Computations. ICGT 2004: 242-256
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
