InforLorV4, PascalFrancis, Corpus, bibRecord, 000C09

Uniform generation of a Schröder tree

Identifieur interne : 000C09 ( PascalFrancis/Corpus ); précédent : 000C08; suivant : 000C10

Uniform generation of a Schröder tree

Auteurs : L. Alonso ; J. L. Remy ; R. Schott

Source :

Information processing letters [ 0020-0190 ] ; 1997.

RBID : Pascal:98-0137331

Descripteurs français

Pascal (Inist)
- Algorithme, Théorie graphe, Arbre graphe, Espace probabilité.

English descriptors

KwdEn :
- Algorithms, Graph theory, Probability space, Tree(graph).

Abstract

We present a simple O(n) algorithm that generates uniformly a Schröder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0020-0190`
A02	`01`			`@0 IFPLAT`
A03		`1`		`@0 Inf. process. lett.`
A05				`@2 64`
A06				`@2 6`
A08	`01`	`1`	`ENG`	`@1 Uniform generation of a Schröder tree`
A11	`01`	`1`		`@1 ALONSO (L.)`
A11	`02`	`1`		`@1 REMY (J. L.)`
A11	`03`	`1`		`@1 SCHOTT (R.)`
A14	`01`			`@1 INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A14	`02`			`@1 CRIN-CNRS, Université de Nancy 1 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 2 aut. @Z 3 aut.`
A20				`@1 305-308`
A21				`@1 1997`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 15156 @5 354000078673520070`
A44				`@0 0000 @1 © 1998 INIST-CNRS. All rights reserved.`
A45				`@0 11 ref.`
A47	`01`	`1`		`@0 98-0137331`
A60				`@1 P`
A61				`@0 A`
A64		`1`		`@0 Information processing letters`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	`@0 We present a simple O(n) algorithm that generates uniformly a Schröder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved.`
C02	`01`	`X`		`@0 001D02A05`
C02	`02`	`X`		`@0 001D02A06`
C03	`01`	`1`	`FRE`	`@0 Algorithme @3 P @5 01`
C03	`01`	`1`	`ENG`	`@0 Algorithms @3 P @5 01`
C03	`02`	`1`	`FRE`	`@0 Théorie graphe @5 51`
C03	`02`	`1`	`ENG`	`@0 Graph theory @5 51`
C03	`03`	`X`	`FRE`	`@0 Arbre graphe @5 52`
C03	`03`	`X`	`ENG`	`@0 Tree(graph) @5 52`
C03	`03`	`X`	`SPA`	`@0 Arbol grafo @5 52`
C03	`04`	`X`	`FRE`	`@0 Espace probabilité @5 53`
C03	`04`	`X`	`ENG`	`@0 Probability space @5 53`
C03	`04`	`X`	`SPA`	`@0 Espacio probabilidad @5 53`
N21				`@1 089`

Format Inist (serveur)

NO :	PASCAL 98-0137331 INIST
ET :	Uniform generation of a Schröder tree
AU :	ALONSO (L.); REMY (J. L.); SCHOTT (R.)
AF :	INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); CRIN-CNRS, Université de Nancy 1/54506 Vandœuvre-lès-Nancy/France (2 aut., 3 aut.)
DT :	Publication en série; Niveau analytique
SO :	Information processing letters; ISSN 0020-0190; Coden IFPLAT; Pays-Bas; Da. 1997; Vol. 64; No. 6; Pp. 305-308; Bibl. 11 ref.
LA :	Anglais
EA :	We present a simple O(n) algorithm that generates uniformly a Schröder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved.
CC :	001D02A05; 001D02A06
FD :	Algorithme; Théorie graphe; Arbre graphe; Espace probabilité
ED :	Algorithms; Graph theory; Tree(graph); Probability space
SD :	Arbol grafo; Espacio probabilidad
LO :	INIST-15156.354000078673520070
ID :	98-0137331

Links to Exploration step

Pascal:98-0137331

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Uniform generation of a Schröder tree</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</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><inist:fA14 i1="01"><s1>INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation><inist:fA14 i1="02"><s1>CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">98-0137331</idno>
<date when="1997">1997</date>
<idno type="stanalyst">PASCAL 98-0137331 INIST</idno>
<idno type="RBID">Pascal:98-0137331</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C09</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Uniform generation of a Schröder tree</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</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><inist:fA14 i1="01"><s1>INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation><inist:fA14 i1="02"><s1>CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</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="1997">1997</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>Graph theory</term>
<term>Probability space</term>
<term>Tree(graph)</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term>
<term>Théorie graphe</term>
<term>Arbre graphe</term>
<term>Espace probabilité</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present a simple O(n) algorithm that generates uniformly a Schröder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0020-0190</s0>
</fA01>
<fA02 i1="01"><s0>IFPLAT</s0>
</fA02>
<fA03 i2="1"><s0>Inf. process. lett.</s0>
</fA03>
<fA05><s2>64</s2>
</fA05>
<fA06><s2>6</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Uniform generation of a Schröder tree</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>INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>CRIN-CNRS, Université de Nancy 1</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>305-308</s1>
</fA20>
<fA21><s1>1997</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15156</s2>
<s5>354000078673520070</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1998 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>11 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>98-0137331</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Information processing letters</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We present a simple O(n) algorithm that generates uniformly a Schröder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A06</s0>
</fC02>
<fC03 i1="01" i2="1" l="FRE"><s0>Algorithme</s0>
<s3>P</s3>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="1" l="ENG"><s0>Algorithms</s0>
<s3>P</s3>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="1" l="FRE"><s0>Théorie graphe</s0>
<s5>51</s5>
</fC03>
<fC03 i1="02" i2="1" l="ENG"><s0>Graph theory</s0>
<s5>51</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Arbre graphe</s0>
<s5>52</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Tree(graph)</s0>
<s5>52</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Arbol grafo</s0>
<s5>52</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Espace probabilité</s0>
<s5>53</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Probability space</s0>
<s5>53</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Espacio probabilidad</s0>
<s5>53</s5>
</fC03>
<fN21><s1>089</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 98-0137331 INIST</NO>
<ET>Uniform generation of a Schröder tree</ET>
<AU>ALONSO (L.); REMY (J. L.); SCHOTT (R.)</AU>
<AF>INRIA-Lorraine, CRIN-CNRS, Université de Nancy 1/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); CRIN-CNRS, Université de Nancy 1/54506 Vandœuvre-lès-Nancy/France (2 aut., 3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Information processing letters; ISSN 0020-0190; Coden IFPLAT; Pays-Bas; Da. 1997; Vol. 64; No. 6; Pp. 305-308; Bibl. 11 ref.</SO>
<LA>Anglais</LA>
<EA>We present a simple O(n) algorithm that generates uniformly a Schröder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved.</EA>
<CC>001D02A05; 001D02A06</CC>
<FD>Algorithme; Théorie graphe; Arbre graphe; Espace probabilité</FD>
<ED>Algorithms; Graph theory; Tree(graph); Probability space</ED>
<SD>Arbol grafo; Espacio probabilidad</SD>
<LO>INIST-15156.354000078673520070</LO>
<ID>98-0137331</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C09 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C09 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:98-0137331
   |texte=   Uniform generation of a Schröder tree
}}

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

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Uniform generation of a Schröder tree

Uniform generation of a Schröder tree

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri