Corpus
PascalFrancis
Racine
Corpus
Checkpoint
PascalFrancis
Racine
PascalFrancis
Exploration
Accueil
Racine
Racine

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.

A parallel algorithm for the generation of a permutation and applications

Identifieur interne : 000C83 ( PascalFrancis/Corpus ); précédent : 000C82; suivant : 000C84

A parallel algorithm for the generation of a permutation and applications

Auteurs : L. Alonso ; R. Schott

Source :

RBID : Pascal:97-0074729

Descripteurs français

English descriptors

Abstract

Copyright (c) 1996 Elsevier Science B.V. All rights reserved. A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log2(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck or Motzkin words and words which are in bijection with trees split into patterns as defined by Dershowitz and Zaks (1989) (see Alonso, 1992).

Notice en format standard (ISO 2709)

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

pA  
A01 01  1    @0 0304-3975
A02 01      @0 TCSCDI
A03   1    @0 Theor. comput. sci.
A05       @2 159
A06       @2 1
A08 01  1  ENG  @1 A parallel algorithm for the generation of a permutation and applications
A11 01  1    @1 ALONSO (L.)
A11 02  1    @1 SCHOTT (R.)
A14 01      @1 CRIN, INRIA-Lorraine, Université de Nancy 1 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.
A20       @1 15-28
A21       @1 1996
A23 01      @0 ENG
A24 01      @0 eng
A43 01      @1 INIST @2 17243 @5 354000067098520004
A44       @0 9000 @1 © 1997 Elsevier Science B.V. All rights reserved.
A47 01  1    @0 97-0074729
A60       @1 P
A61       @0 A
A64 01  1    @0 Theoretical computer science
A66 01      @0 NLD
C01 01    ENG  @0 Copyright (c) 1996 Elsevier Science B.V. All rights reserved. A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log2(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck or Motzkin words and words which are in bijection with trees split into patterns as defined by Dershowitz and Zaks (1989) (see Alonso, 1992).
C02 01  X    @0 001D02A05
C02 02  X    @0 001D02A06
C03 01  X  FRE  @0 Algorithme parallèle @5 01
C03 01  X  ENG  @0 Parallel algorithm @5 01
C03 01  X  SPA  @0 Algoritmo paralelo @5 01
C03 02  X  FRE  @0 Complexité algorithme @5 02
C03 02  X  ENG  @0 Algorithm complexity @5 02
C03 02  X  SPA  @0 Complejidad algoritmo @5 02
C03 03  X  FRE  @0 Permutation @5 03
C03 03  X  ENG  @0 Permutation @5 03
C03 03  X  SPA  @0 Permutación @5 03
C03 04  X  FRE  @0 Arbre graphe @5 04
C03 04  X  ENG  @0 Tree(graph) @5 04
C03 04  X  SPA  @0 Arbol grafo @5 04
N21       @1 041

Format Inist (serveur)

NO : PASCAL 97-0074729 Elsevier
ET : A parallel algorithm for the generation of a permutation and applications
AU : ALONSO (L.); SCHOTT (R.)
AF : CRIN, INRIA-Lorraine, Université de Nancy 1/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut.)
DT : Publication en série; Niveau analytique
SO : Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 1996; Vol. 159; No. 1; Pp. 15-28; Abs. anglais
LA : Anglais
EA : Copyright (c) 1996 Elsevier Science B.V. All rights reserved. A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log2(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck or Motzkin words and words which are in bijection with trees split into patterns as defined by Dershowitz and Zaks (1989) (see Alonso, 1992).
CC : 001D02A05; 001D02A06
FD : Algorithme parallèle; Complexité algorithme; Permutation; Arbre graphe
ED : Parallel algorithm; Algorithm complexity; Permutation; Tree(graph)
SD : Algoritmo paralelo; Complejidad algoritmo; Permutación; Arbol grafo
LO : INIST-17243.354000067098520004
ID : 97-0074729

Links to Exploration step

Pascal:97-0074729

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">A parallel algorithm for the generation of a permutation and applications</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>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 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="01">
<s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">97-0074729</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 97-0074729 Elsevier</idno>
<idno type="RBID">Pascal:97-0074729</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C83</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">A parallel algorithm for the generation of a permutation and applications</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>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 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="01">
<s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint>
<date when="1996">1996</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Algorithm complexity</term>
<term>Parallel algorithm</term>
<term>Permutation</term>
<term>Tree(graph)</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Algorithme parallèle</term>
<term>Complexité algorithme</term>
<term>Permutation</term>
<term>Arbre graphe</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Copyright (c) 1996 Elsevier Science B.V. All rights reserved. A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log
<sup>2</sup>
(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck or Motzkin words and words which are in bijection with trees split into patterns as defined by Dershowitz and Zaks (1989) (see Alonso, 1992).</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0304-3975</s0>
</fA01>
<fA02 i1="01">
<s0>TCSCDI</s0>
</fA02>
<fA03 i2="1">
<s0>Theor. comput. sci.</s0>
</fA03>
<fA05>
<s2>159</s2>
</fA05>
<fA06>
<s2>1</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG">
<s1>A parallel algorithm for the generation of a permutation and applications</s1>
</fA08>
<fA11 i1="01" i2="1">
<s1>ALONSO (L.)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>SCHOTT (R.)</s1>
</fA11>
<fA14 i1="01">
<s1>CRIN, INRIA-Lorraine, Université de Nancy 1</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA20>
<s1>15-28</s1>
</fA20>
<fA21>
<s1>1996</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA24 i1="01">
<s0>eng</s0>
</fA24>
<fA43 i1="01">
<s1>INIST</s1>
<s2>17243</s2>
<s5>354000067098520004</s5>
</fA43>
<fA44>
<s0>9000</s0>
<s1>© 1997 Elsevier Science B.V. All rights reserved.</s1>
</fA44>
<fA47 i1="01" i2="1">
<s0>97-0074729</s0>
</fA47>
<fA60>
<s1>P</s1>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01">
<s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>Copyright (c) 1996 Elsevier Science B.V. All rights reserved. A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log
<sup>2</sup>
(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck or Motzkin words and words which are in bijection with trees split into patterns as defined by Dershowitz and Zaks (1989) (see Alonso, 1992).</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X">
<s0>001D02A06</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE">
<s0>Algorithme parallèle</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG">
<s0>Parallel algorithm</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA">
<s0>Algoritmo paralelo</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE">
<s0>Complexité algorithme</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Algorithm complexity</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>Complejidad algoritmo</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Permutation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Permutation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Permutación</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Arbre graphe</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Tree(graph)</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Arbol grafo</s0>
<s5>04</s5>
</fC03>
<fN21>
<s1>041</s1>
</fN21>
</pA>
</standard>
<server>
<NO>PASCAL 97-0074729 Elsevier</NO>
<ET>A parallel algorithm for the generation of a permutation and applications</ET>
<AU>ALONSO (L.); SCHOTT (R.)</AU>
<AF>CRIN, INRIA-Lorraine, Université de Nancy 1/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 1996; Vol. 159; No. 1; Pp. 15-28; Abs. anglais</SO>
<LA>Anglais</LA>
<EA>Copyright (c) 1996 Elsevier Science B.V. All rights reserved. A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log
<sup>2</sup>
(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck or Motzkin words and words which are in bijection with trees split into patterns as defined by Dershowitz and Zaks (1989) (see Alonso, 1992).</EA>
<CC>001D02A05; 001D02A06</CC>
<FD>Algorithme parallèle; Complexité algorithme; Permutation; Arbre graphe</FD>
<ED>Parallel algorithm; Algorithm complexity; Permutation; Tree(graph)</ED>
<SD>Algoritmo paralelo; Complejidad algoritmo; Permutación; Arbol grafo</SD>
<LO>INIST-17243.354000067098520004</LO>
<ID>97-0074729</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 000C83 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C83 | 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:97-0074729
   |texte=   A parallel algorithm for the generation of a permutation and applications
}}
Wicri

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