Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
Identifieur interne : 00F787 ( Main/Merge ); précédent : 00F786; suivant : 00F788Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
Auteurs : M. Broy [Allemagne] ; M. Wirsing [Allemagne] ; J. P. Finance [France] ; A. Quéré [France] ; J. L. Remy [France]Source :
- Information Processing Letters [ 0020-0190 ] ; 1979.
English descriptors
- Teeft :
Url:
DOI: 10.1016/0020-0190(79)90111-X
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000559
- to stream Istex, to step Curation: 000555
- to stream Istex, to step Checkpoint: 003A13
Links to Exploration step
ISTEX:1910BE6AC7191407B7AD0F7D478669940DCE49F6Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title><author><name sortKey="Broy, M" sort="Broy, M" uniqKey="Broy M" first="M." last="Broy">M. Broy</name></author><author><name sortKey="Wirsing, M" sort="Wirsing, M" uniqKey="Wirsing M" first="M." last="Wirsing">M. Wirsing</name></author><author><name sortKey="Finance, J P" sort="Finance, J P" uniqKey="Finance J" first="J. P." last="Finance">J. P. Finance</name></author><author><name sortKey="Quere, A" sort="Quere, A" uniqKey="Quere A" first="A." last="Quéré">A. Quéré</name></author><author><name sortKey="Remy, J L" sort="Remy, J L" uniqKey="Remy J" first="J. L." last="Remy">J. L. Remy</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1910BE6AC7191407B7AD0F7D478669940DCE49F6</idno><date when="1979" year="1979">1979</date><idno type="doi">10.1016/0020-0190(79)90111-X</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000559</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000559</idno><idno type="wicri:Area/Istex/Curation">000555</idno><idno type="wicri:Area/Istex/Checkpoint">003A13</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003A13</idno><idno type="wicri:doubleKey">0020-0190:1979:Broy M:methodical:solution:of</idno><idno type="wicri:Area/Main/Merge">00F787</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title><author><name sortKey="Broy, M" sort="Broy, M" uniqKey="Broy M" first="M." last="Broy">M. Broy</name><affiliation wicri:level="4"><country xml:lang="fr" wicri:curation="lc">Allemagne</country><wicri:regionArea>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München</wicri:regionArea><placeName><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region><settlement type="city">Munich</settlement></placeName><orgName type="university">Université Louis-et-Maximilien de Munich</orgName></affiliation></author><author><name sortKey="Wirsing, M" sort="Wirsing, M" uniqKey="Wirsing M" first="M." last="Wirsing">M. Wirsing</name><affiliation wicri:level="4"><country xml:lang="fr" wicri:curation="lc">Allemagne</country><wicri:regionArea>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München</wicri:regionArea><placeName><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region><settlement type="city">Munich</settlement></placeName><orgName type="university">Université Louis-et-Maximilien de Munich</orgName></affiliation></author><author><name sortKey="Finance, J P" sort="Finance, J P" uniqKey="Finance J" first="J. P." last="Finance">J. P. Finance</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Quere, A" sort="Quere, A" uniqKey="Quere A" first="A." last="Quéré">A. Quéré</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Remy, J L" sort="Remy, J L" uniqKey="Remy J" first="J. L." last="Remy">J. L. Remy</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Information Processing Letters</title><title level="j" type="abbrev">IPL</title><idno type="ISSN">0020-0190</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1979">1979</date><biblScope unit="volume">8</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="224">224</biblScope><biblScope unit="page" to="229">229</biblScope></imprint><idno type="ISSN">0020-0190</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algebraic specification</term><term>Dicho</term><term>Information processing letters</term><term>International summer school</term><term>Iterative statements</term><term>Main points</term><term>Maxi</term><term>Maxi dicho</term><term>Maximum length</term><term>Mini</term><term>Problem statement</term><term>Program construction</term><term>Program development</term><term>Reste</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00F787 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00F787 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:1910BE6AC7191407B7AD0F7D478669940DCE49F6
|texte= Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
}}
| This area was generated with Dilib version V0.6.33. |  |