|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Graph labelings derived from models in distributed computing: A complete complexity classification. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie |
Asymetric Pavlovian Populations |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou |
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou |
Black Hole Search with Finite Automata Scattered in a Synchronous Torus |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès |
Cop and Robber Games When the Robber Can Hide and Ride. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie |
Computing with Pavlovian Populations. |
OPODIS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou |
Tight Bounds for Scattered Black Hole Search in a Ring. |
SIROCCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou |
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem |
Planar Graphs Have 1-string Representations. |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès |
Cop and robber games when the robber can hide and ride |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
On the power of synchronization between two adjacent processes. |
Distributed Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro |
Network Exploration by Silent and Oblivious Robots. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das |
Rendezvous of Mobile Agents without Agreement on Local Orientation. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Adrian Kosowski |
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Peter Widmayer |
Rendezvous of Mobile Agents in Directed Graphs. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
How Simple Robots Benefit from Looking Back. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler |
Population Protocols that Correspond to Symmetric Games |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniel Gonçalves |
Every planar graph is the intersection graph of segments in the plane: extended abstract. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
planar graphs, intersection graphs |
| 1 | Jérémie Chalopin |
Election and rendezvous with incomparable labels. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Pascal Ochem |
Dejean's conjecture and letter frequency. |
ITA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler |
Playing With Population Protocols |
CSP |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier |
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. |
ICGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Emmanuel Godard, Yves Métivier |
Local Terminations and Distributed Computability in Anonymous Networks. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Pascal Ochem |
Dejean's conjecture and letter frequency. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem |
Planar graphs are in 1-STRING. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Nicola Santoro |
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel |
About the Termination Detection in the Asynchronous Message Passing Model. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka |
Local Computations in Graphs: The Case of Cellular Edge Local Computations. |
Fundam. Inform. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Graph Labelings Derived from Models in Distributed Computing. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy |
Mobile Agent Algorithms Versus Message Passing Algorithms. |
OPODIS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin |
Election in the Qualitative World. |
SIROCCO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Nicola Santoro |
Groupings and Pairings in Anonymous Networks. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka |
Local Computation in Graphs: The Case of Cellular Edge Local Computations. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin |
Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Hing Leung |
On factorization forests of finite height. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka |
Election, Naming and Cellular Edge Local Computations. |
ICGT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
Election and Local Computations on Edges. |
FoSSaCS |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")