<?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-01241088</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-19T08:05:24+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification</title>
            <author role="aut">
              <persName>
                <forename type="first">Liah</forename>
                <surname>Kor</surname>
              </persName>
              <idno type="halauthorid">541890-0</idno>
              <affiliation ref="#struct-81094"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Amos</forename>
                <surname>Korman</surname>
              </persName>
              <email type="md5">514f7ace10ba409b25abadaaf6f87334</email>
              <email type="domain">irif.fr</email>
              <idno type="idhal" notation="numeric">949231</idno>
              <idno type="halauthorid" notation="string">211855-949231</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8652-9228</idno>
              <idno type="IDREF">https://www.idref.fr/220099707</idno>
              <affiliation ref="#struct-34120"/>
              <affiliation ref="#struct-1033"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">David</forename>
                <surname>Peleg</surname>
              </persName>
              <idno type="halauthorid">144495-0</idno>
              <affiliation ref="#struct-366895"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Amos</forename>
                <surname>Korman</surname>
              </persName>
              <email type="md5">514f7ace10ba409b25abadaaf6f87334</email>
              <email type="domain">irif.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-12-09 21:48:52</date>
              <date type="whenModified">2025-02-26 15:24:03</date>
              <date type="whenReleased">2015-12-15 17:02:47</date>
              <date type="whenProduced">2013</date>
              <date type="whenEndEmbargoed">2015-12-09</date>
              <ref type="file" target="https://inria.hal.science/hal-01241088v1/document">
                <date notBefore="2015-12-09"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01241088v1/file/ToCS-accepted.pdf" id="file-1241088-1321221">
                <date notBefore="2015-12-09"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1512.04832"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="188919">
                <persName>
                  <forename>Amos</forename>
                  <surname>Korman</surname>
                </persName>
                <email type="md5">514f7ace10ba409b25abadaaf6f87334</email>
                <email type="domain">irif.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01241088</idno>
            <idno type="halUri">https://inria.hal.science/hal-01241088</idno>
            <idno type="halBibtex">kor:hal-01241088</idno>
            <idno type="halRefHtml">&lt;i&gt;Theory of Computing Systems&lt;/i&gt;, 2013, &lt;a target="_blank" href="https://dx.doi.org/10.1007/s00224-013-9479-7"&gt;&amp;#x27E8;10.1007/s00224-013-9479-7&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Theory of Computing Systems, 2013, &amp;#x27E8;10.1007/s00224-013-9479-7&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1241088-1321221"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PARIS7" corresp="UNIV-PARIS">Université Denis Diderot - Paris VII</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="INRIA-ROCQ">INRIA Paris - Rocquencourt</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="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="INRIA-ISRAEL">COPUBLICATION INRIA ISRAEL</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Liah</forename>
                    <surname>Kor</surname>
                  </persName>
                  <idno type="halauthorid">541890-0</idno>
                  <affiliation ref="#struct-81094"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Amos</forename>
                    <surname>Korman</surname>
                  </persName>
                  <email type="md5">514f7ace10ba409b25abadaaf6f87334</email>
                  <email type="domain">irif.fr</email>
                  <idno type="idhal" notation="numeric">949231</idno>
                  <idno type="halauthorid" notation="string">211855-949231</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8652-9228</idno>
                  <idno type="IDREF">https://www.idref.fr/220099707</idno>
                  <affiliation ref="#struct-34120"/>
                  <affiliation ref="#struct-1033"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">David</forename>
                    <surname>Peleg</surname>
                  </persName>
                  <idno type="halauthorid">144495-0</idno>
                  <affiliation ref="#struct-366895"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">19610</idno>
                <idno type="issn">1432-4350</idno>
                <idno type="eissn">1433-0490</idno>
                <title level="j">Theory of Computing Systems</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1512.04832</idno>
              <idno type="doi">10.1007/s00224-013-9479-7</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Distributed algorithms</term>
                <term xml:lang="en">distributed verification</term>
                <term xml:lang="en">labeling schemes</term>
                <term xml:lang="en">minimum-weight spanning tree</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously O(m) messages and O(√ n+D) time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G's diameter. On the other hand, we show that any MST verification algorithm must send Ω(m) messages and incur Ω(√ n + D) time in worst case. Our upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of Ω(m) messages and Ω(√ n+D) time hold, but at the moment there is no known distributed algorithm that constructs an MST and achieves simultaneously O(m) messages and O(√ n + D) time. Specifically, the best known time-optimal algorithm (using O(√ n + D) time) requires O(m + n 3/2) messages, and the best known message-optimal algorithm (using O(m) messages) requires O(n) time. On the other hand, our lower bound results indicate that the verification of an MST is not significantly easier than its construction.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-81094" status="VALID">
          <orgName>Department of Computer Science and Applied Mathematics [Rehovot]</orgName>
          <desc>
            <address>
              <addrLine>Faculty of Mathematics and Computer Science The Weizmann Institute of Science POB 26, Rehovot 76100, ISRAEL</addrLine>
              <country key="IL"/>
            </address>
            <ref type="url">http://www.wisdom.weizmann.ac.il/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-366895" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-34120" status="OLD">
          <idno type="RNSR">200718314F</idno>
          <orgName>Networks, Graphs and Algorithms</orgName>
          <orgName type="acronym">GANG</orgName>
          <date type="start">2007-07-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/gang</ref>
          </desc>
          <listRelation>
            <relation active="#struct-1033" type="direct"/>
            <relation active="#struct-300301" type="indirect"/>
            <relation name="UMR7089" active="#struct-441569" type="indirect"/>
            <relation active="#struct-86790" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1033" status="OLD">
          <orgName>Laboratoire d'informatique Algorithmique : Fondements et Applications</orgName>
          <orgName type="acronym">LIAFA</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <addrLine>Université Paris Diderot, Bât. Sophie Germain, case postale 7014, 75205 Paris cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.liafa.jussieu.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300301" type="direct"/>
            <relation name="UMR7089" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-366895" status="VALID">
          <orgName>Weizmann Institute of Science [Rehovot, Israël]</orgName>
          <desc>
            <address>
              <addrLine>234 Herzl Street, Rehovot 7610001</addrLine>
              <country key="IL"/>
            </address>
            <ref type="url">http://www.weizmann.ac.il</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300301" status="OLD">
          <idno type="IdRef">027542084</idno>
          <idno type="ISNI">0000000121514068</idno>
          <idno type="ROR">https://ror.org/02n7qrg46</idno>
          <orgName>Université Paris Diderot - Paris 7</orgName>
          <orgName type="acronym">UPD7</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>5 rue Thomas-Mann - 75205 Paris cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris-diderot.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="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </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>
      </listOrg>
    </back>
  </text>
</TEI>