On the study data structures: Binary tournaments with repeated keys
Identifieur interne : 002D68 ( Istex/Curation ); précédent : 002D67; suivant : 002D69On the study data structures: Binary tournaments with repeated keys
Auteurs : P. Lescanne [France] ; J. M. Steyaert [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper we develop a systematic way of analyzing tree like data structures and recursive algorithms on them; the method is shown on binary tournaments with repeated Keys extending previous applications to term trees. Tournaments are studied both as a combinatorial and as a computational object; the main line of our approach consists in showing strong correspondences between recursive definition of combinatorial parameters and of procedures on one hand and equations over generating power series on the other hand; we can then conclude by deriving closed formulae or asymtotic estimates for the average values of various quantities and running times of procedures.
Url:
DOI: 10.1007/BFb0036930
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002E05
Links to Exploration step
ISTEX:C255E353D866F80C6BA2468262222531AA64C676Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the study data structures: Binary tournaments with repeated keys</title><author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">P. Lescanne</name><affiliation wicri:level="1"><mods:affiliation>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy</wicri:regionArea></affiliation></author><author><name sortKey="Steyaert, J M" sort="Steyaert, J M" uniqKey="Steyaert J" first="J. M." last="Steyaert">J. M. Steyaert</name><affiliation wicri:level="1"><mods:affiliation>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C255E353D866F80C6BA2468262222531AA64C676</idno><date when="1983" year="1983">1983</date><idno type="doi">10.1007/BFb0036930</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-QGJBTF9V-C/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E05</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E05</idno><idno type="wicri:Area/Istex/Curation">002D68</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the study data structures: Binary tournaments with repeated keys</title><author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">P. Lescanne</name><affiliation wicri:level="1"><mods:affiliation>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy</wicri:regionArea></affiliation></author><author><name sortKey="Steyaert, J M" sort="Steyaert, J M" uniqKey="Steyaert J" first="J. M." last="Steyaert">J. M. Steyaert</name><affiliation wicri:level="1"><mods:affiliation>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we develop a systematic way of analyzing tree like data structures and recursive algorithms on them; the method is shown on binary tournaments with repeated Keys extending previous applications to term trees. Tournaments are studied both as a combinatorial and as a computational object; the main line of our approach consists in showing strong correspondences between recursive definition of combinatorial parameters and of procedures on one hand and equations over generating power series on the other hand; we can then conclude by deriving closed formulae or asymtotic estimates for the average values of various quantities and running times of procedures.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002D68 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 002D68 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:C255E353D866F80C6BA2468262222531AA64C676
|texte= On the study data structures: Binary tournaments with repeated keys
}}
| This area was generated with Dilib version V0.6.33. |  |