<?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-01180864</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-20T05:45:02+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On the Uncontended Complexity of Anonymous Consensus</title>
            <author role="aut">
              <persName>
                <forename type="first">Claire</forename>
                <surname>Capdevielle</surname>
              </persName>
              <idno type="halauthorid">928592-0</idno>
              <orgName ref="#struct-259761"/>
              <affiliation ref="#struct-259761"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Colette</forename>
                <surname>Johnen</surname>
              </persName>
              <email type="md5">8e8cce29b03d158d7b778de886268fff</email>
              <email type="domain">labri.fr</email>
              <idno type="idhal" notation="string">colette-johnen</idno>
              <idno type="idhal" notation="numeric">11010</idno>
              <idno type="halauthorid" notation="string">18446-11010</idno>
              <idno type="ARXIV">https://arxiv.org/a/johnen_c_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7170-4521</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=g_YgoOgAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/032681763</idno>
              <orgName ref="#struct-259761"/>
              <affiliation ref="#struct-259761"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Petr</forename>
                <surname>Kuznetsov</surname>
              </persName>
              <email type="md5">e7d9a2f6ea3d265f10fff360381efb17</email>
              <email type="domain">telecom-paris.fr</email>
              <idno type="idhal" notation="string">pkouznet</idno>
              <idno type="idhal" notation="numeric">745310</idno>
              <idno type="halauthorid" notation="string">27059-745310</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1148-1228</idno>
              <idno type="IDREF">https://www.idref.fr/235483184</idno>
              <orgName ref="#struct-333113"/>
              <affiliation ref="#struct-333113"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alessia</forename>
                <surname>Milani</surname>
              </persName>
              <idno type="halauthorid">106649-0</idno>
              <orgName ref="#struct-259761"/>
              <affiliation ref="#struct-259761"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Alessia</forename>
                <surname>Milani</surname>
              </persName>
              <email type="md5">ddb6d6b12d06c4f8268da58ee119b3a7</email>
              <email type="domain">lis-lab.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-07-28 12:19:22</date>
              <date type="whenWritten">2015-05-10</date>
              <date type="whenModified">2025-06-12 15:14:40</date>
              <date type="whenReleased">2015-07-30 09:42:13</date>
              <date type="whenProduced">2015-07-28</date>
              <date type="whenEndEmbargoed">2015-07-28</date>
              <ref type="file" target="https://hal.science/hal-01180864v1/document">
                <date notBefore="2015-07-28"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01180864v1/file/Anonymous-Consensus-TECH-REP.pdf" id="file-1180864-1265472">
                <date notBefore="2015-07-28"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="192826">
                <persName>
                  <forename>Alessia</forename>
                  <surname>Milani</surname>
                </persName>
                <email type="md5">ddb6d6b12d06c4f8268da58ee119b3a7</email>
                <email type="domain">lis-lab.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01180864</idno>
            <idno type="halUri">https://hal.science/hal-01180864</idno>
            <idno type="halBibtex">capdevielle:hal-01180864</idno>
            <idno type="halRefHtml">[Research Report] University of Bordeaux LaBRI, UMR 5800, F-33400 Talence, France Telecom ParisTech. 2015</idno>
            <idno type="halRef">[Research Report] University of Bordeaux LaBRI, UMR 5800, F-33400 Talence, France Telecom ParisTech. 2015</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1180864-1265472"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENST">Ecole Nationale Supérieure des Télécommunications</idno>
            <idno type="stamp" n="TELECOM-PARISTECH" corresp="PARISTECH">Télécom Paris</idno>
            <idno type="stamp" n="PARISTECH">ParisTech</idno>
            <idno type="stamp" n="LARA">LARA</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="TELECOM-PARISTECH-SACLAY" corresp="PARISTECH">TELECOM-PARISTECH-SACLAY</idno>
            <idno type="stamp" n="LTCI" corresp="TELECOM-PARISTECH">Laboratoire Traitement et Communication de l'Information</idno>
            <idno type="stamp" n="INFRES" corresp="TELECOM-PARISTECH">Département Informatique et Réseaux</idno>
            <idno type="stamp" n="ACES" corresp="TELECOM-PARISTECH">Equipe Autonomic and Critical Embedded Systems</idno>
            <idno type="stamp" n="INSTITUT-MINES-TELECOM">Institut Mines Telecom</idno>
            <idno type="stamp" n="UNIVERSITE-BORDEAUX">Université de Bordeaux</idno>
          </seriesStmt>
          <notesStmt>
            <note type="report" n="6">Research Report</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">On the Uncontended Complexity of Anonymous Consensus</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Claire</forename>
                    <surname>Capdevielle</surname>
                  </persName>
                  <idno type="halauthorid">928592-0</idno>
                  <orgName ref="#struct-259761"/>
                  <affiliation ref="#struct-259761"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Colette</forename>
                    <surname>Johnen</surname>
                  </persName>
                  <email type="md5">8e8cce29b03d158d7b778de886268fff</email>
                  <email type="domain">labri.fr</email>
                  <idno type="idhal" notation="string">colette-johnen</idno>
                  <idno type="idhal" notation="numeric">11010</idno>
                  <idno type="halauthorid" notation="string">18446-11010</idno>
                  <idno type="ARXIV">https://arxiv.org/a/johnen_c_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7170-4521</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=g_YgoOgAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/032681763</idno>
                  <orgName ref="#struct-259761"/>
                  <affiliation ref="#struct-259761"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Petr</forename>
                    <surname>Kuznetsov</surname>
                  </persName>
                  <email type="md5">e7d9a2f6ea3d265f10fff360381efb17</email>
                  <email type="domain">telecom-paris.fr</email>
                  <idno type="idhal" notation="string">pkouznet</idno>
                  <idno type="idhal" notation="numeric">745310</idno>
                  <idno type="halauthorid" notation="string">27059-745310</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1148-1228</idno>
                  <idno type="IDREF">https://www.idref.fr/235483184</idno>
                  <orgName ref="#struct-333113"/>
                  <affiliation ref="#struct-333113"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alessia</forename>
                    <surname>Milani</surname>
                  </persName>
                  <idno type="halauthorid">106649-0</idno>
                  <orgName ref="#struct-259761"/>
                  <affiliation ref="#struct-259761"/>
                </author>
              </analytic>
              <monogr>
                <imprint>
                  <date type="datePub">2015-07-28</date>
                </imprint>
                <authority type="institution">University of Bordeaux  LaBRI, UMR 5800, F-33400 Talence, France , Telecom ParisTech</authority>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">consensus</term>
                <term xml:lang="en">anonymity</term>
                <term xml:lang="en">space complexity</term>
                <term xml:lang="en">solo-write complexity</term>
                <term xml:lang="en">lower bound</term>
                <term xml:lang="en">optimal anonymous distributed consensus algorithms</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halOldTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halTreeTypology" n="REPORT.RESREPORT">Reports - Research report</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Consensus is one of the central distributed abstractions. By enablinga collection of processes to agree on one of the values they propose,consensus can be used to implement any generic replicated service in aconsistent and fault-tolerant way.In this paper, we study \emph{uncontended} complexity of anonymous consensusalgorithms, counting the number of memory locations used and the number ofmemory updates performed in operations that encounter no contention. We assume that contention-free operations on a consensus object perform ``fast'' reads and writes, and resort to moreexpensive synchronization primitives, such as CAS, only whencontention is detected.We call such concurrent implementations \emph{interval-solo-fast} andderive the first nontrivial tight bounds on space complexity ofanonymous interval-solo-fast consensus.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-259761" status="VALID">
          <idno type="IdRef">175206562</idno>
          <idno type="ROR">https://ror.org/057qpr032</idno>
          <orgName>Université de Bordeaux</orgName>
          <orgName type="acronym">UB</orgName>
          <desc>
            <address>
              <addrLine>35, place Pey Berland - 33076 Bordeaux</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-bordeaux.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-333113" status="INCOMING">
          <orgName>Institut TELECOM / Télécom ParisTech</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>