On the study data structures: Binary tournaments with repeated keys
Identifieur interne : 002E05 ( Istex/Corpus ); précédent : 002E04; suivant : 002E06On the study data structures: Binary tournaments with repeated keys
Auteurs : P. Lescanne ; J. M. SteyaertSource :
- 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 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><mods:affiliation>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France</mods:affiliation></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><mods:affiliation>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France</mods:affiliation></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></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><mods:affiliation>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France</mods:affiliation></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><mods:affiliation>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France</mods:affiliation></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><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>P. Lescanne</name><affiliations><json:string>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France</json:string></affiliations></json:item><json:item><name>J. M. Steyaert</name><affiliations><json:string>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-QGJBTF9V-C</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>6.998</score><pdfWordCount>3750</pdfWordCount><pdfCharCount>18857</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>12</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>104</abstractWordCount><abstractCharCount>683</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>On the study data structures: Binary tournaments with repeated keys</title><chapterId><json:string>38</json:string><json:string>Chap38</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1983</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>D. Barstow</name></json:item><json:item><name>W. Brauer</name></json:item><json:item><name>P. Brinch Hansen</name></json:item><json:item><name>D. Gries</name></json:item><json:item><name>D. Luckham</name></json:item><json:item><name>C. Moler</name></json:item><json:item><name>A. Pnueli</name></json:item><json:item><name>G. Seegmüller</name></json:item><json:item><name>J. Stoer</name></json:item><json:item><name>N. Wirth</name></json:item></editor></serie><host><title>Automata, Languages and Programming</title><language><json:string>unknown</json:string></language><copyrightDate>1983</copyrightDate><doi><json:string>10.1007/BFb0036892</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-40038-7</json:string></eisbn><bookId><json:string>3540123172</json:string></bookId><isbn><json:string>978-3-540-12317-0</json:string></isbn><volume>154</volume><pages><first>466</first><last>477</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Josep Diaz</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Techniques</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-QGJBTF9V-C</json:string></ark><publicationDate>1983</publicationDate><copyrightDate>1983</copyrightDate><doi><json:string>10.1007/BFb0036930</json:string></doi><id>C255E353D866F80C6BA2468262222531AA64C676</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-QGJBTF9V-C/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-QGJBTF9V-C/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-QGJBTF9V-C/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">On the study data structures: Binary tournaments with repeated keys</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1983">1983</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the study data structures: Binary tournaments with repeated keys</title><author><persName><forename type="first">P.</forename><surname>Lescanne</surname></persName><affiliation><orgName type="department">Campus Scientifique</orgName><orgName type="institution">CRIN</orgName><address><postBox>BP 239</postBox><postCode>54506</postCode><settlement>Vandoeuvre Les Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">J.</forename><forename type="first">M.</forename><surname>Steyaert</surname></persName><affiliation><orgName type="department">Laboratoires de Mathématiques Appliquées</orgName><orgName type="institution">Ecole Polytechnique</orgName><address><postCode>91128</postCode><settlement>Palaiseau Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">C255E353D866F80C6BA2468262222531AA64C676</idno><idno type="ark">ark:/67375/HCB-QGJBTF9V-C</idno><idno type="DOI">10.1007/BFb0036930</idno></analytic><monogr><title level="m" type="main">Automata, Languages and Programming</title><title level="m" type="sub">10th Colloquium Barcelona, Spain, July 18–22, 1983</title><idno type="DOI">10.1007/BFb0036892</idno><idno type="book-id">3540123172</idno><idno type="ISBN">978-3-540-12317-0</idno><idno type="eISBN">978-3-540-40038-7</idno><idno type="chapter-id">Chap38</idno><editor><persName><forename type="first">Josep</forename><surname>Diaz</surname></persName></editor><imprint><biblScope unit="vol">154</biblScope><biblScope unit="page" from="466">466</biblScope><biblScope unit="page" to="477">477</biblScope><biblScope unit="chapter-count">60</biblScope></imprint></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><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Barstow</surname></persName></editor><editor><persName><forename type="first">W.</forename><surname>Brauer</surname></persName></editor><editor><persName><forename type="first">P.</forename><surname>Brinch Hansen</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Gries</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Luckham</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Moler</surname></persName></editor><editor><persName><forename type="first">A.</forename><surname>Pnueli</surname></persName></editor><editor><persName><forename type="first">G.</forename><surname>Seegmüller</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Stoer</surname></persName></editor><editor><persName><forename type="first">N.</forename><surname>Wirth</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>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.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16013</label><item><term type="Secondary" subtype="priority-1">Computation by Abstract Devices</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-2">Mathematical Logic and Formal Languages</term></item><label>I14010</label><item><term type="Secondary" subtype="priority-3">Programming Techniques</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-QGJBTF9V-C/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Barstow</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>W.</GivenName><FamilyName>Brauer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Brinch Hansen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Gries</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Luckham</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Moler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>A.</GivenName><FamilyName>Pnueli</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Seegmüller</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Stoer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>N.</GivenName><FamilyName>Wirth</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540123172</BookID><BookTitle>Automata, Languages and Programming</BookTitle><BookSubTitle>10th Colloquium Barcelona, Spain, July 18–22, 1983</BookSubTitle><BookVolumeNumber>154</BookVolumeNumber><BookDOI>10.1007/BFb0036892</BookDOI><BookTitleID>4222</BookTitleID><BookPrintISBN>978-3-540-12317-0</BookPrintISBN><BookElectronicISBN>978-3-540-40038-7</BookElectronicISBN><BookChapterCount>60</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1983</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14010" Priority="3" Type="Secondary">Programming Techniques</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Josep</GivenName><FamilyName>Diaz</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap38" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>38</ChapterID><ChapterDOI>10.1007/BFb0036930</ChapterDOI><ChapterSequenceNumber>38</ChapterSequenceNumber><ChapterTitle Language="En">On the study data structures: Binary tournaments with repeated keys</ChapterTitle><ChapterFirstPage>466</ChapterFirstPage><ChapterLastPage>477</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1983</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>12</Month><Day>26</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540123172</BookID><BookTitle>Automata, Languages and Programming</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Lescanne</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>J.</GivenName><GivenName>M.</GivenName><FamilyName>Steyaert</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Campus Scientifique</OrgDivision><OrgName>CRIN</OrgName><OrgAddress><Postbox>BP 239</Postbox><Postcode>54506</Postcode><City>Vandoeuvre Les Nancy</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Laboratoires de Mathématiques Appliquées</OrgDivision><OrgName>Ecole Polytechnique</OrgName><OrgAddress><Postcode>91128</Postcode><City>Palaiseau Cedex</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>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.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>On the study data structures: Binary tournaments with repeated keys</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>On the study data structures: Binary tournaments with repeated keys</title></titleInfo><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Lescanne</namePart><affiliation>Campus Scientifique, CRIN, BP 239, 54506, Vandoeuvre Les Nancy, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="given">M.</namePart><namePart type="family">Steyaert</namePart><affiliation>Laboratoires de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1983</dateIssued><copyrightDate encoding="w3cdtf">1983</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>Automata, Languages and Programming</title><subTitle>10th Colloquium Barcelona, Spain, July 18–22, 1983</subTitle></titleInfo><name type="personal"><namePart type="given">Josep</namePart><namePart type="family">Diaz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1983</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic></subject><identifier type="DOI">10.1007/BFb0036892</identifier><identifier type="ISBN">978-3-540-12317-0</identifier><identifier type="eISBN">978-3-540-40038-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">4222</identifier><identifier type="BookID">3540123172</identifier><identifier type="BookChapterCount">60</identifier><identifier type="BookVolumeNumber">154</identifier><part><date>1983</date><detail type="volume"><number>154</number><caption>vol.</caption></detail><extent unit="pages"><start>466</start><end>477</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1983</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Barstow</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">W.</namePart><namePart type="family">Brauer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Brinch Hansen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Gries</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Luckham</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Moler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Pnueli</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Seegmüller</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Stoer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="family">Wirth</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1983</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1983</recordOrigin></recordInfo></relatedItem><identifier type="istex">C255E353D866F80C6BA2468262222531AA64C676</identifier><identifier type="ark">ark:/67375/HCB-QGJBTF9V-C</identifier><identifier type="DOI">10.1007/BFb0036930</identifier><identifier type="ChapterID">38</identifier><identifier type="ChapterID">Chap38</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1983</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1983</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-QGJBTF9V-C/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E05 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002E05 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|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. |  |