<?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-01184783</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-18T01:19:58+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Analysis of the total costs for variants of the Union-Find algorithm</title>
            <author role="aut">
              <persName>
                <forename type="first">Markus</forename>
                <surname>Kuba</surname>
              </persName>
              <idno type="halauthorid">930904-0</idno>
              <affiliation ref="#struct-13325"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alois</forename>
                <surname>Panholzer</surname>
              </persName>
              <idno type="halauthorid">807814-0</idno>
              <affiliation ref="#struct-13325"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Coordination</forename>
                <surname>Episciences Iam</surname>
              </persName>
              <email type="md5">ca50c40eb57b3ef14743f7aab97e8e68</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-08-17 16:59:32</date>
              <date type="whenModified">2026-01-09 13:32:03</date>
              <date type="whenReleased">2015-08-24 10:04:12</date>
              <date type="whenProduced">2007</date>
              <date type="whenEndEmbargoed">2015-08-17</date>
              <ref type="file" target="https://inria.hal.science/hal-01184783v1/document">
                <date notBefore="2015-08-17"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://inria.hal.science/hal-01184783v1/file/dmAH0119.pdf" id="file-1184783-1269595">
                <date notBefore="2015-08-17"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="201264">
                <persName>
                  <forename>Coordination</forename>
                  <surname>Episciences Iam</surname>
                </persName>
                <email type="md5">ca50c40eb57b3ef14743f7aab97e8e68</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01184783</idno>
            <idno type="halUri">https://inria.hal.science/hal-01184783</idno>
            <idno type="halBibtex">kuba:hal-01184783</idno>
            <idno type="halRefHtml">&lt;i&gt;2007 Conference on Analysis of Algorithms, AofA 07&lt;/i&gt;, 2007, Juan les Pins, France. pp.283-294, &lt;a target="_blank" href="https://dx.doi.org/10.46298/dmtcs.3535"&gt;&amp;#x27E8;10.46298/dmtcs.3535&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.283-294, &amp;#x27E8;10.46298/dmtcs.3535&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1184783-1269595"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DMTCS">DMTCS</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>
          </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">Analysis of the total costs for variants of the Union-Find algorithm</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Markus</forename>
                    <surname>Kuba</surname>
                  </persName>
                  <idno type="halauthorid">930904-0</idno>
                  <affiliation ref="#struct-13325"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alois</forename>
                    <surname>Panholzer</surname>
                  </persName>
                  <idno type="halauthorid">807814-0</idno>
                  <affiliation ref="#struct-13325"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">649</idno>
                <idno type="issn">1462-7264</idno>
                <idno type="eissn">1365-8050</idno>
                <title level="j">Discrete Mathematics and Theoretical Computer Science</title>
                <meeting>
                  <title>2007 Conference on Analysis of Algorithms, AofA 07</title>
                  <date type="start">2007</date>
                  <settlement>Juan les Pins</settlement>
                  <country key="FR">France</country>
                </meeting>
                <editor>Jacquet, Philippe</editor>
                <imprint>
                  <publisher>Discrete Mathematics and Theoretical Computer Science</publisher>
                  <publisher>DMTCS</publisher>
                  <biblScope unit="serie">DMTCS Proceedings</biblScope>
                  <biblScope unit="volume">DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)</biblScope>
                  <biblScope unit="pp">283-294</biblScope>
                  <date type="datePub">2007-01-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.46298/dmtcs.3535</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">limiting distribution</term>
                <term xml:lang="en">average-case analysis</term>
                <term xml:lang="en">Union-Find algorithm</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</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 study the average behavior of variants of the UNION-FIND algorithm to maintain partitions of a finite set under the random spanning tree model. By applying the method of moments we can characterize the limiting distribution of the total costs of the algorithms "Quick Find Weighted'' and "Quick Find Biased'' extending the analysis of Knuth and Schönhage, Yao, and Chassaing and Marchand.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-13325" status="VALID">
          <orgName>Institut für Diskrete Mathematik und Geometrie [Wien]</orgName>
          <desc>
            <address>
              <addrLine>Forschungsgruppe Differentialgeometrie und Geometrische Strukturen Technische Universität Wien Wiedner Hauptstraße 8-10/104 A-1040 Wien, Austria</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">http://dmg.tuwien.ac.at</ref>
          </desc>
          <listRelation>
            <relation active="#struct-19098" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-19098" status="VALID">
          <idno type="IdRef">030036496</idno>
          <idno type="ROR">https://ror.org/04d836q62</idno>
          <orgName>Vienna University of Technology = Technischen Universität Wien</orgName>
          <orgName type="acronym">TU Wien</orgName>
          <desc>
            <address>
              <addrLine>Karlsplatz 13, 1040 Vienna</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">https://www.tuwien.at/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>