<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00741982</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T15:49:03+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Brief Announcement: Distributed Exclusive and Perpetual Tree Searching</title>
            <author role="aut">
              <persName>
                <forename type="first">Lélia</forename>
                <surname>Blin</surname>
              </persName>
              <email type="md5">acce45e2496c18fbf7bbe2439101f92f</email>
              <email type="domain">irif.fr</email>
              <idno type="idhal" notation="string">lelia-blin</idno>
              <idno type="idhal" notation="numeric">1596</idno>
              <idno type="halauthorid" notation="string">20241-1596</idno>
              <idno type="IDREF">https://www.idref.fr/050451774</idno>
              <idno type="VIAF">https://viaf.org/viaf/74012268</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0342-9243</idno>
              <idno type="ISNI">http://isni.org/isni/0000000001406425</idno>
              <affiliation ref="#struct-300306"/>
              <affiliation ref="#struct-389034"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Janna</forename>
                <surname>Burman</surname>
              </persName>
              <email type="md5">4078e8cd79a625b248f39c3ec222e41b</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">janna-burman</idno>
              <idno type="idhal" notation="numeric">18603</idno>
              <idno type="halauthorid" notation="string">27082-18603</idno>
              <idno type="IDREF">https://www.idref.fr/224357662</idno>
              <affiliation ref="#struct-2544"/>
              <affiliation ref="#struct-56049"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Nisse</surname>
              </persName>
              <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">nicolas-nisse</idno>
              <idno type="idhal" notation="numeric">4293</idno>
              <idno type="halauthorid" notation="string">12643-4293</idno>
              <idno type="IDREF">https://www.idref.fr/119020335</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4500-5078</idno>
              <affiliation ref="#struct-2466"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Nicolas</forename>
                <surname>Nisse</surname>
              </persName>
              <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projeurop-88020"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2012-10-15 16:00:14</date>
              <date type="whenModified">2025-10-07 15:32:02</date>
              <date type="whenReleased">2012-10-16 08:41:21</date>
              <date type="whenProduced">2012-10</date>
              <date type="whenEndEmbargoed">2012-10-15</date>
              <ref type="file" target="https://inria.hal.science/hal-00741982v1/document">
                <date notBefore="2012-10-15"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00741982v1/file/disc2012-final88-2.pdf" id="file-741982-457807">
                <date notBefore="2012-10-15"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-00741982/file/disc2012-final88-2.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="120410">
                <persName>
                  <forename>Nicolas</forename>
                  <surname>Nisse</surname>
                </persName>
                <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00741982</idno>
            <idno type="halUri">https://inria.hal.science/hal-00741982</idno>
            <idno type="halBibtex">blin:hal-00741982</idno>
            <idno type="halRefHtml">&lt;i&gt;DISC 2012 - 26th International Symposium on Distributed Computing&lt;/i&gt;, Oct 2012, Salvador, Brazil. pp.403-404, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-33651-5_29"&gt;&amp;#x27E8;10.1007/978-3-642-33651-5_29&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">DISC 2012 - 26th International Symposium on Distributed Computing, Oct 2012, Salvador, Brazil. pp.403-404, &amp;#x27E8;10.1007/978-3-642-33651-5_29&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-741982-457807"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</idno>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
            <idno type="stamp" n="UNIV-LILLE3">Université de Lille Sciences humaines et sociales</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNIV-EVRY">Université d'Evry-Val d'Essonne</idno>
            <idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LRI-PARSYS" corresp="UMR8623">Laboratoire de recherche en informatique. Équipe: Systèmes Parallèles</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="TEST-NICE">test nice</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Brief Announcement: Distributed Exclusive and Perpetual Tree Searching</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lélia</forename>
                    <surname>Blin</surname>
                  </persName>
                  <email type="md5">acce45e2496c18fbf7bbe2439101f92f</email>
                  <email type="domain">irif.fr</email>
                  <idno type="idhal" notation="string">lelia-blin</idno>
                  <idno type="idhal" notation="numeric">1596</idno>
                  <idno type="halauthorid" notation="string">20241-1596</idno>
                  <idno type="IDREF">https://www.idref.fr/050451774</idno>
                  <idno type="VIAF">https://viaf.org/viaf/74012268</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0342-9243</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000001406425</idno>
                  <affiliation ref="#struct-300306"/>
                  <affiliation ref="#struct-389034"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Janna</forename>
                    <surname>Burman</surname>
                  </persName>
                  <email type="md5">4078e8cd79a625b248f39c3ec222e41b</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">janna-burman</idno>
                  <idno type="idhal" notation="numeric">18603</idno>
                  <idno type="halauthorid" notation="string">27082-18603</idno>
                  <idno type="IDREF">https://www.idref.fr/224357662</idno>
                  <affiliation ref="#struct-2544"/>
                  <affiliation ref="#struct-56049"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Nisse</surname>
                  </persName>
                  <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">nicolas-nisse</idno>
                  <idno type="idhal" notation="numeric">4293</idno>
                  <idno type="halauthorid" notation="string">12643-4293</idno>
                  <idno type="IDREF">https://www.idref.fr/119020335</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4500-5078</idno>
                  <affiliation ref="#struct-2466"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>DISC 2012 - 26th International Symposium on Distributed Computing</title>
                  <date type="start">2012-10</date>
                  <settlement>Salvador</settlement>
                  <country key="BR">Brazil</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">7611</biblScope>
                  <biblScope unit="pp">403-404</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-33651-5_29</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We tackle a practical version of the well known {\it graph searching} problem, where a team of robots aims at capturing an intruder in a graph. The robots and the intruder move along the edges of the graph. The intruder is invisible, arbitrary fast, and omniscient. It is caught whenever it stands on a node occupied by a robot, and cannot escape to a neighboring node. We study graph searching in the CORDA model of mobile computing: robots are asynchronous, and they perform cycles of {\it Look-Compute-Move} actions. Moreover, motivated by physical constraints, we consider the \emph{exclusive} property, stating that no two or more robots can occupy the same node at the same time. In addition, we assume that the network and the robots are anonymous. Finally, robots are \emph{oblivious}, i.e., each robot performs its move actions based only on its current ''vision'' of the positions of the other robots. Our objective is to characterize, for a graph $G$, the set of integers $k$ such that graph searching can be achieved by a team of $k$ robots starting from \emph{any} $k$ distinct nodes in $G$. Our main result consists in a full characterization of this set, for any asymmetric tree. Towards providing a characterization for all trees, including trees with non-trivial automorphisms, we have also provides a set of positive and negative results, including a full characterization for any line. All our positive results are based on the design of algorithms enabling \emph{perpetual} graph searching to be achieved with the desired number of robots.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-300306" status="VALID">
          <idno type="IdRef">030820529</idno>
          <idno type="ISNI">0000000121805818</idno>
          <idno type="ROR">https://ror.org/00e96v939</idno>
          <idno type="Wikidata">Q1531014</idno>
          <orgName>Université d'Évry-Val-d'Essonne</orgName>
          <orgName type="acronym">UEVE</orgName>
          <date type="start">1991-07-22</date>
          <desc>
            <address>
              <addrLine>Boulevard François Mitterrand 91025 Evry Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-evry.fr</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-389034" status="OLD">
          <orgName>Networks and Performance Analysis</orgName>
          <orgName type="acronym">NPA</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-56049" status="OLD">
          <idno type="RNSR">200318373M</idno>
          <orgName>Global parallel and distributed computing</orgName>
          <orgName type="acronym">GRAND-LARGE</orgName>
          <date type="start">2003-10-02</date>
          <date type="end">2013-12-31</date>
          <desc>
            <address>
              <addrLine>PCRI - Université de Paris-Sud, Bâtiment 650, 91405 ORSAY Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/grand-large</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2544" type="direct"/>
            <relation active="#struct-92966" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR8623" active="#struct-441569" type="indirect"/>
            <relation active="#struct-2546" type="direct"/>
            <relation active="#struct-92973" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-301700" type="indirect"/>
            <relation name="UMR8022" active="#struct-441569" type="indirect"/>
            <relation active="#struct-118511" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-2466" status="OLD">
          <idno type="RNSR">200018393X</idno>
          <orgName>Algorithms, simulation, combinatorics and optimization for telecommunications</orgName>
          <orgName type="acronym">MASCOTTE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-451999" type="direct"/>
            <relation active="#struct-13009" type="indirect"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-2546" status="OLD">
          <orgName>Laboratoire d'Informatique Fondamentale de Lille</orgName>
          <orgName type="acronym">LIFL</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment M3 59655 Villeneuve d'Ascq Cédex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lifl.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92973" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-301700" type="direct"/>
            <relation name="UMR8022" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92973" status="OLD">
          <idno type="IdRef">026404184</idno>
          <idno type="ROR">https://ror.org/0546v5182</idno>
          <orgName>Université de Lille, Sciences et Technologies</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Cité Scientifique - 59655 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301700" status="OLD">
          <idno type="IdRef">026404524</idno>
          <idno type="ISNI">0000000121517701</idno>
          <idno type="ROR">https://ror.org/025b4c754</idno>
          <orgName>Université de Lille, Sciences Humaines et Sociales</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Domaine universitaire du "Pont de Bois"Rue du Barreau BP 60149 59653 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille3.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="europeanProject" xml:id="projeurop-88020" status="VALID">
          <idno type="number">258307</idno>
          <idno type="program">FP7-ICT-2009-5</idno>
          <idno type="call">FP7-ICT-2009-5</idno>
          <orgName>EULER</orgName>
          <desc>Experimental UpdateLess Evolutive Routing</desc>
          <date type="start">2010-01-10</date>
          <date type="end">2014-06-30</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>