Fast and simple nested fixpoints
Identifieur interne : 002722 ( Main/Curation ); précédent : 002721; suivant : 002723Fast and simple nested fixpoints
Auteurs : Helmut Seidl [Allemagne]Source :
- Information Processing Letters [ 0020-0190 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d · ( h · ¦e¦ (d − 1))⌜ d 2⌝+1). The advantage of our proof is that it is both extremely short and extremely simple.
Url:
DOI: 10.1016/0020-0190(96)00130-5
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000947
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :000895
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000F96
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002B96
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001417
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :001575
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001212
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002D14
Links to Exploration step
ISTEX:796315C12A20C3F1BBAEF4A5CD696C3220981BE1Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Fast and simple nested fixpoints</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:796315C12A20C3F1BBAEF4A5CD696C3220981BE1</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0020-0190(96)00130-5</idno><idno type="url">https://api.istex.fr/document/796315C12A20C3F1BBAEF4A5CD696C3220981BE1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000947</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000947</idno><idno type="wicri:Area/Istex/Curation">000895</idno><idno type="wicri:Area/Istex/Checkpoint">000F96</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F96</idno><idno type="wicri:doubleKey">0020-0190:1996:Seidl H:fast:and:simple</idno><idno type="wicri:Area/Main/Merge">002B96</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:97-0050234</idno><idno type="wicri:Area/PascalFrancis/Corpus">001417</idno><idno type="wicri:Area/PascalFrancis/Curation">001575</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001212</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001212</idno><idno type="wicri:doubleKey">0020-0190:1996:Seidl H:fast:and:simple</idno><idno type="wicri:Area/Main/Merge">002D14</idno><idno type="wicri:Area/Main/Curation">002722</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Fast and simple nested fixpoints</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV — Informatik, Universität Trier, D-54286 Trier</wicri:regionArea><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>D-54286 Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></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="1996">1996</date><biblScope unit="volume">59</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="303">303</biblScope><biblScope unit="page" to="308">308</biblScope></imprint><idno type="ISSN">0020-0190</idno></series><idno type="istex">796315C12A20C3F1BBAEF4A5CD696C3220981BE1</idno><idno type="DOI">10.1016/0020-0190(96)00130-5</idno><idno type="PII">0020-0190(96)00130-5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term><term>Computational complexity</term><term>Equation system</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term><term>Complexité calcul</term><term>Système équation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d · ( h · ¦e¦ (d − 1))⌜ d 2⌝+1). The advantage of our proof is that it is both extremely short and extremely simple.</div></front></TEI><double idat="0020-0190:1996:Seidl H:fast:and:simple"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Fast and simple nested fixpoints</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">97-0050234</idno><date when="1996">1996</date><idno type="stanalyst">PASCAL 97-0050234 INIST</idno><idno type="RBID">Pascal:97-0050234</idno><idno type="wicri:Area/PascalFrancis/Corpus">001417</idno><idno type="wicri:Area/PascalFrancis/Curation">001575</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001212</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001212</idno><idno type="wicri:doubleKey">0020-0190:1996:Seidl H:fast:and:simple</idno><idno type="wicri:Area/Main/Merge">002D14</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Fast and simple nested fixpoints</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Information processing letters</title><title level="j" type="abbreviated">Inf. process. lett.</title><idno type="ISSN">0020-0190</idno><imprint><date when="1996">1996</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Information processing letters</title><title level="j" type="abbreviated">Inf. process. lett.</title><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term><term>Computational complexity</term><term>Equation system</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Complexité calcul</term><term>Système équation</term><term>Algorithme</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d.(h.|e|/(d - 1))<sup>[d/2]+1</sup>). The advantage of our proof is that it is both extremely short and extremely simple.</div></front></TEI></INIST><ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Fast and simple nested fixpoints</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:796315C12A20C3F1BBAEF4A5CD696C3220981BE1</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0020-0190(96)00130-5</idno><idno type="url">https://api.istex.fr/document/796315C12A20C3F1BBAEF4A5CD696C3220981BE1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000947</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000947</idno><idno type="wicri:Area/Istex/Curation">000895</idno><idno type="wicri:Area/Istex/Checkpoint">000F96</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F96</idno><idno type="wicri:doubleKey">0020-0190:1996:Seidl H:fast:and:simple</idno><idno type="wicri:Area/Main/Merge">002B96</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Fast and simple nested fixpoints</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV — Informatik, Universität Trier, D-54286 Trier</wicri:regionArea><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>D-54286 Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></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="1996">1996</date><biblScope unit="volume">59</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="303">303</biblScope><biblScope unit="page" to="308">308</biblScope></imprint><idno type="ISSN">0020-0190</idno></series><idno type="istex">796315C12A20C3F1BBAEF4A5CD696C3220981BE1</idno><idno type="DOI">10.1016/0020-0190(96)00130-5</idno><idno type="PII">0020-0190(96)00130-5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d · ( h · ¦e¦ (d − 1))⌜ d 2⌝+1). The advantage of our proof is that it is both extremely short and extremely simple.</div></front></TEI></ISTEX></double></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 002722 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002722 | 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:796315C12A20C3F1BBAEF4A5CD696C3220981BE1
|texte= Fast and simple nested fixpoints
}}
| This area was generated with Dilib version V0.6.31. |  |