A linear-time algorithm for the generation of trees
Identifieur interne :
000C04 ( PascalFrancis/Curation );
précédent :
000C03;
suivant :
000C05
A linear-time algorithm for the generation of trees
Auteurs : L. Alonso [
France] ;
J. L. Remy [
France] ;
R. Schott [
France]
Source :
-
Algorithmica [ 0178-4617 ] ; 1997.
RBID : Pascal:97-0177880
Descripteurs français
- Pascal (Inist)
- Traitement image,
Synthèse forme,
Arbre,
Génération automatique,
Codage,
Calcul symbolique,
Démonstration théorème,
Algorithme,
Complexité calcul,
Linear time algorithm,
Random generation.
- Wicri :
English descriptors
pA |
A01 | 01 | 1 | | @0 0178-4617 |
---|
A03 | | 1 | | @0 Algorithmica |
---|
A05 | | | | @2 17 |
---|
A06 | | | | @2 2 |
---|
A08 | 01 | 1 | ENG | @1 A linear-time algorithm for the generation of trees |
---|
A11 | 01 | 1 | | @1 ALONSO (L.) |
---|
A11 | 02 | 1 | | @1 REMY (J. L.) |
---|
A11 | 03 | 1 | | @1 SCHOTT (R.) |
---|
A14 | 01 | | | @1 CRIN, INRIA-Lorraine, Université de Nancy 1 @2 545116 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
---|
A20 | | | | @1 162-182 |
---|
A21 | | | | @1 1997 |
---|
A23 | 01 | | | @0 ENG |
---|
A43 | 01 | | | @1 INIST @2 20966 @5 354000063179790050 |
---|
A44 | | | | @0 0000 @1 © 1997 INIST-CNRS. All rights reserved. |
---|
A45 | | | | @0 10 ref. |
---|
A47 | 01 | 1 | | @0 97-0177880 |
---|
A60 | | | | @1 P |
---|
A61 | | | | @0 A |
---|
A64 | 01 | 1 | | @0 Algorithmica |
---|
A66 | 01 | | | @0 USA |
---|
C02 | 01 | X | | @0 001D02C03 |
---|
C02 | 02 | X | | @0 001D02A05 |
---|
C03 | 01 | X | FRE | @0 Traitement image @5 01 |
---|
C03 | 01 | X | ENG | @0 Image processing @5 01 |
---|
C03 | 01 | X | GER | @0 Bildverarbeitung @5 01 |
---|
C03 | 01 | X | SPA | @0 Procesamiento imagen @5 01 |
---|
C03 | 02 | X | FRE | @0 Synthèse forme @5 02 |
---|
C03 | 02 | X | ENG | @0 Pattern synthesis @5 02 |
---|
C03 | 02 | X | SPA | @0 Síntesis forma @5 02 |
---|
C03 | 03 | X | FRE | @0 Arbre @5 03 |
---|
C03 | 03 | X | ENG | @0 Tree @5 03 |
---|
C03 | 03 | X | SPA | @0 Arbol @5 03 |
---|
C03 | 04 | X | FRE | @0 Génération automatique @5 04 |
---|
C03 | 04 | X | ENG | @0 Automatic generation @5 04 |
---|
C03 | 04 | X | SPA | @0 Generación automatica @5 04 |
---|
C03 | 05 | X | FRE | @0 Codage @5 05 |
---|
C03 | 05 | X | ENG | @0 Coding @5 05 |
---|
C03 | 05 | X | SPA | @0 Codificación @5 05 |
---|
C03 | 06 | X | FRE | @0 Calcul symbolique @5 06 |
---|
C03 | 06 | X | ENG | @0 Symbolic computation @5 06 |
---|
C03 | 06 | X | SPA | @0 Cálculo simbólico @5 06 |
---|
C03 | 07 | X | FRE | @0 Démonstration théorème @5 07 |
---|
C03 | 07 | X | ENG | @0 Theorem proving @5 07 |
---|
C03 | 07 | X | SPA | @0 Demostración teorema @5 07 |
---|
C03 | 08 | X | FRE | @0 Algorithme @5 08 |
---|
C03 | 08 | X | ENG | @0 Algorithm @5 08 |
---|
C03 | 08 | X | GER | @0 Algorithmus @5 08 |
---|
C03 | 08 | X | SPA | @0 Algoritmo @5 08 |
---|
C03 | 09 | X | FRE | @0 Complexité calcul @5 09 |
---|
C03 | 09 | X | ENG | @0 Computational complexity @5 09 |
---|
C03 | 09 | X | SPA | @0 Complejidad computación @5 09 |
---|
C03 | 10 | X | FRE | @0 Linear time algorithm @4 INC @5 73 |
---|
C03 | 11 | X | FRE | @0 Random generation @4 INC @5 74 |
---|
N21 | | | | @1 083 |
---|
|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000C75
Links to Exploration step
Pascal:97-0177880
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A linear-time algorithm for the generation of trees</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</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="1"><inist:fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0177880</idno>
<date when="1997">1997</date>
<idno type="stanalyst">PASCAL 97-0177880 INIST</idno>
<idno type="RBID">Pascal:97-0177880</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C75</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000C04</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A linear-time algorithm for the generation of trees</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</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="1"><inist:fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Algorithmica</title>
<title level="j" type="abbreviated">Algorithmica</title>
<idno type="ISSN">0178-4617</idno>
<imprint><date when="1997">1997</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Algorithmica</title>
<title level="j" type="abbreviated">Algorithmica</title>
<idno type="ISSN">0178-4617</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Automatic generation</term>
<term>Coding</term>
<term>Computational complexity</term>
<term>Image processing</term>
<term>Pattern synthesis</term>
<term>Symbolic computation</term>
<term>Theorem proving</term>
<term>Tree</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Traitement image</term>
<term>Synthèse forme</term>
<term>Arbre</term>
<term>Génération automatique</term>
<term>Codage</term>
<term>Calcul symbolique</term>
<term>Démonstration théorème</term>
<term>Algorithme</term>
<term>Complexité calcul</term>
<term>Linear time algorithm</term>
<term>Random generation</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Arbre</term>
<term>Codage</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0178-4617</s0>
</fA01>
<fA03 i2="1"><s0>Algorithmica</s0>
</fA03>
<fA08 i1="01" i2="1" l="ENG"><s1>A linear-time algorithm for the generation of trees</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>ALONSO (L.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>REMY (J. L.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>SCHOTT (R.)</s1>
</fA11>
<fA14 i1="01"><s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>545116 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>162-182</s1>
</fA20>
<fA21><s1>1997</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>20966</s2>
<s5>354000063179790050</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>10 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>97-0177880</s0>
</fA47>
<fA64 i1="01" i2="1"><s0>Algorithmica</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Traitement image</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Image processing</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="GER"><s0>Bildverarbeitung</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Procesamiento imagen</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Synthèse forme</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Pattern synthesis</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Síntesis forma</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Arbre</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Tree</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Arbol</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Génération automatique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Automatic generation</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Generación automatica</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Codage</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Coding</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Codificación</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Calcul symbolique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Symbolic computation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Cálculo simbólico</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="GER"><s0>Algorithmus</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Complexité calcul</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Computational complexity</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Complejidad computación</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Linear time algorithm</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Random generation</s0>
<s4>INC</s4>
<s5>74</s5>
</fC03>
<fN21><s1>083</s1>
</fN21>
</pA>
</standard>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C04 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000C04 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:97-0177880
|texte= A linear-time algorithm for the generation of trees
}}
| This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 | |