InforLorV4, Hal, Corpus, bibRecord, 006A29

Determining Plurality

Identifieur interne : 006A29 ( Hal/Corpus ); précédent : 006A28; suivant : 006A30

Determining Plurality

Auteurs : Laurent Alonso ; Edward M. Reingold

Source :

ACM Transactions on Algorithms [ 1549-6325 ] ; 2008.

RBID : Hal:inria-00169184

Abstract

Given a set of $n$ elements, each of which is colored one of $c$ colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We prove that $(c-1)(n-c)/2$ color comparisons are necessary in the worst case to determine the plurality color and give an algorithm requiring $(0.775 c + 5.9)n + O(c^2)$ color comparisons for $c \geq 9$.

Url:

https://hal.inria.fr/inria-00169184

DOI: 10.1145/1367064.1367066

Links to Exploration step

Hal:inria-00169184

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="id">Determining Plurality</title>
<author><name sortKey="Alonso, Laurent" sort="Alonso, Laurent" uniqKey="Alonso L" first="Laurent" last="Alonso">Laurent Alonso</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-3174" status="OLD"><idno type="RNSR">200618296R</idno>
<orgName>Geometry and Lighting</orgName>
<orgName type="acronym">ALICE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/alice</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><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"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Reingold, Edward M" sort="Reingold, Edward M" uniqKey="Reingold E" first="Edward M." last="Reingold">Edward M. Reingold</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-6327" status="VALID"><orgName>Department of Computer Science [IIT]</orgName>
<orgName type="acronym">IIT CS</orgName>
<desc><address><addrLine>10 West 31st Street ; Stuart Building 235 ; Chicago ; IL 60616</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.cs.iit.edu/</ref>
</desc>
<listRelation><relation active="#struct-300736" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300736" type="direct"><org type="institution" xml:id="struct-300736" status="VALID"><orgName>Illinois Institute of Technology</orgName>
<desc><address><country key="US"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00169184</idno>
<idno type="halId">inria-00169184</idno>
<idno type="halUri">https://hal.inria.fr/inria-00169184</idno>
<idno type="url">https://hal.inria.fr/inria-00169184</idno>
<idno type="doi">10.1145/1367064.1367066</idno>
<date when="2008">2008</date>
<idno type="wicri:Area/Hal/Corpus">006A29</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="id">Determining Plurality</title>
<author><name sortKey="Alonso, Laurent" sort="Alonso, Laurent" uniqKey="Alonso L" first="Laurent" last="Alonso">Laurent Alonso</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-3174" status="OLD"><idno type="RNSR">200618296R</idno>
<orgName>Geometry and Lighting</orgName>
<orgName type="acronym">ALICE</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/alice</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><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"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Reingold, Edward M" sort="Reingold, Edward M" uniqKey="Reingold E" first="Edward M." last="Reingold">Edward M. Reingold</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-6327" status="VALID"><orgName>Department of Computer Science [IIT]</orgName>
<orgName type="acronym">IIT CS</orgName>
<desc><address><addrLine>10 West 31st Street ; Stuart Building 235 ; Chicago ; IL 60616</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.cs.iit.edu/</ref>
</desc>
<listRelation><relation active="#struct-300736" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300736" type="direct"><org type="institution" xml:id="struct-300736" status="VALID"><orgName>Illinois Institute of Technology</orgName>
<desc><address><country key="US"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1145/1367064.1367066</idno>
<series><title level="j">ACM Transactions on Algorithms</title>
<idno type="ISSN">1549-6325</idno>
<imprint><date type="datePub">2008</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Given a set of $n$ elements, each of which is colored one of $c$ colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We prove that $(c-1)(n-c)/2$ color comparisons are necessary in the worst case to determine the plurality color and give an algorithm requiring $(0.775 c + 5.9)n + O(c^2)$ color comparisons for $c \geq 9$.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="id">Determining Plurality</title>
<author role="aut"><persName><forename type="first">Laurent</forename>
<surname>Alonso</surname>
</persName>
<email>alonso@loria.fr</email>
<idno type="halauthor">52502</idno>
<affiliation ref="#struct-3174"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Edward M.</forename>
<surname>Reingold</surname>
</persName>
<email></email>
<idno type="halauthor">204429</idno>
<orgName ref="#struct-365767"></orgName>
<affiliation ref="#struct-6327"></affiliation>
</author>
<editor role="depositor"><persName><forename>Laurent</forename>
<surname>Alonso</surname>
</persName>
<email>alonso@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2007-09-02 09:04:28</date>
<date type="whenModified">2016-05-18 09:01:09</date>
<date type="whenReleased">2007-09-02 09:04:28</date>
<date type="whenProduced">2008</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="120438"><persName><forename>Laurent</forename>
<surname>Alonso</surname>
</persName>
<email>alonso@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00169184</idno>
<idno type="halUri">https://hal.inria.fr/inria-00169184</idno>
<idno type="halBibtex">alonso:inria-00169184</idno>
<idno type="halRefHtml">ACM Transactions on Algorithms, Association for Computing Machinery, 2008, 4 (3), pp.26:1,26:19. <10.1145/1367064.1367066></idno>
<idno type="halRef">ACM Transactions on Algorithms, Association for Computing Machinery, 2008, 4 (3), pp.26:1,26:19. <10.1145/1367064.1367066></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-ACGI" p="LORIA">Algorithmique, calcul, image et géométrie</idno>
<idno type="stamp" n="INRIA2">INRIA 2</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</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="id">Determining Plurality</title>
<author role="aut"><persName><forename type="first">Laurent</forename>
<surname>Alonso</surname>
</persName>
<email>alonso@loria.fr</email>
<idno type="halAuthorId">52502</idno>
<affiliation ref="#struct-3174"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Edward M.</forename>
<surname>Reingold</surname>
</persName>
<idno type="halAuthorId">204429</idno>
<orgName ref="#struct-365767"></orgName>
<affiliation ref="#struct-6327"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">9521</idno>
<idno type="issn">1549-6325</idno>
<title level="j">ACM Transactions on Algorithms</title>
<imprint><publisher>Association for Computing Machinery</publisher>
<biblScope unit="volume">4</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="pp">26:1,26:19</biblScope>
<date type="datePub">2008</date>
</imprint>
</monogr>
<idno type="doi">10.1145/1367064.1367066</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="acm" n="F"></classCode>
<classCode scheme="acm" n="G"></classCode>
<classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Given a set of $n$ elements, each of which is colored one of $c$ colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We prove that $(c-1)(n-c)/2$ color comparisons are necessary in the worst case to determine the plurality color and give an algorithm requiring $(0.775 c + 5.9)n + O(c^2)$ color comparisons for $c \geq 9$.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006A29 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 006A29 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:inria-00169184
   |texte=   Determining Plurality
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Determining Plurality

Determining Plurality

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri