Searching Trees: An Essay
Identifieur interne : 000E52 ( Main/Curation ); précédent : 000E51; suivant : 000E53Searching Trees: An Essay
Auteurs : Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.
Url:
DOI: 10.1007/978-3-642-02017-9_9
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001541
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001429
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000399
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :000F26
Links to Exploration step
ISTEX:588E6C9D703A87D58C4FDF09DAE1CE57A2B3FF66Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Searching Trees: An Essay</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><country>Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:588E6C9D703A87D58C4FDF09DAE1CE57A2B3FF66</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02017-9_9</idno><idno type="url">https://api.istex.fr/document/588E6C9D703A87D58C4FDF09DAE1CE57A2B3FF66/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001541</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001541</idno><idno type="wicri:Area/Istex/Curation">001429</idno><idno type="wicri:Area/Istex/Checkpoint">000399</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000399</idno><idno type="wicri:doubleKey">0302-9743:2009:Fernau H:searching:trees:an</idno><idno type="wicri:Area/Main/Merge">000F26</idno><idno type="wicri:Area/Main/Curation">000E52</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Searching Trees: An Essay</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">588E6C9D703A87D58C4FDF09DAE1CE57A2B3FF66</idno><idno type="DOI">10.1007/978-3-642-02017-9_9</idno><idno type="ChapterID">9</idno><idno type="ChapterID">Chap9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000E52 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 000E52 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Curation
|type= RBID
|clé= ISTEX:588E6C9D703A87D58C4FDF09DAE1CE57A2B3FF66
|texte= Searching Trees: An Essay
}}
| This area was generated with Dilib version V0.6.31. |  |