InforLorV4, PascalFrancis, Corpus, bibRecord, 000723

Linear-time computation of local periods

Identifieur interne : 000723 ( PascalFrancis/Corpus ); précédent : 000722; suivant : 000724

Linear-time computation of local periods

Auteurs : Jean-Pierre Duval ; Roman Kolpakov ; Gregory Kucherov ; Thierry Lecroq ; Arnaud Lefebvre

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2003.

RBID : Pascal:04-0134445

Descripteurs français

Pascal (Inist)
- Temps linéaire, Temps calcul.

English descriptors

KwdEn :
- Computation time, Linear time.

Abstract

We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2747`
A08	`01`	`1`	`ENG`	`@1 Linear-time computation of local periods`
A09	`01`	`1`	`ENG`	`@1 MFCS 2003 : mathematical foundations of computer science 2003 : Bratislava, 25-29 August 2003`
A11	`01`	`1`		`@1 DUVAL (Jean-Pierre)`
A11	`02`	`1`		`@1 KOLPAKOV (Roman)`
A11	`03`	`1`		`@1 KUCHEROV (Gregory)`
A11	`04`	`1`		`@1 LECROQ (Thierry)`
A11	`05`	`1`		`@1 LEFEBVRE (Arnaud)`
A12	`01`	`1`		`@1 ROVAN (Branislav) @9 ed.`
A12	`02`	`1`		`@1 VOJTAS (Peter) @9 ed.`
A14	`01`			`@1 LIFAR, Université de Rouen @3 FRA @Z 1 aut.`
A14	`02`			`@1 Department of Computer Science, University of Liverpool @3 GBR @Z 2 aut.`
A14	`03`			`@1 INRIA/LORIA @2 Nancy @3 FRA @Z 3 aut.`
A14	`04`			`@1 ABISS, Université de Rouen @3 FRA @Z 4 aut. @Z 5 aut.`
A20				`@1 388-397`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-40671-9`
A43	`01`			`@1 INIST @2 16343 @5 354000117777950330`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 24 ref.`
A47	`01`	`1`		`@0 04-0134445`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.`
C02	`01`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Temps linéaire @5 21`
C03	`01`	`X`	`ENG`	`@0 Linear time @5 21`
C03	`01`	`X`	`SPA`	`@0 Tiempo lineal @5 21`
C03	`02`	`X`	`FRE`	`@0 Temps calcul @5 22`
C03	`02`	`X`	`ENG`	`@0 Computation time @5 22`
C03	`02`	`X`	`SPA`	`@0 Tiempo computación @5 22`
N21				`@1 089`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 Mathematical foundations of computer science. International symposium @2 28 @3 Bratislava SVK @4 2003-08-25`

Format Inist (serveur)

NO :	PASCAL 04-0134445 INIST
ET :	Linear-time computation of local periods
AU :	DUVAL (Jean-Pierre); KOLPAKOV (Roman); KUCHEROV (Gregory); LECROQ (Thierry); LEFEBVRE (Arnaud); ROVAN (Branislav); VOJTAS (Peter)
AF :	LIFAR, Université de Rouen/France (1 aut.); Department of Computer Science, University of Liverpool/Royaume-Uni (2 aut.); INRIA/LORIA/Nancy/France (3 aut.); ABISS, Université de Rouen/France (4 aut., 5 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2747; Pp. 388-397; Bibl. 24 ref.
LA :	Anglais
EA :	We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.
CC :	001D02A05
FD :	Temps linéaire; Temps calcul
ED :	Linear time; Computation time
SD :	Tiempo lineal; Tiempo computación
LO :	INIST-16343.354000117777950330
ID :	04-0134445

Links to Exploration step

Pascal:04-0134445

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Linear-time computation of local periods</title>
<author><name sortKey="Duval, Jean Pierre" sort="Duval, Jean Pierre" uniqKey="Duval J" first="Jean-Pierre" last="Duval">Jean-Pierre Duval</name>
<affiliation><inist:fA14 i1="01"><s1>LIFAR, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, University of Liverpool</s1>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation><inist:fA14 i1="03"><s1>INRIA/LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
<affiliation><inist:fA14 i1="04"><s1>ABISS, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Lefebvre, Arnaud" sort="Lefebvre, Arnaud" uniqKey="Lefebvre A" first="Arnaud" last="Lefebvre">Arnaud Lefebvre</name>
<affiliation><inist:fA14 i1="04"><s1>ABISS, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0134445</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0134445 INIST</idno>
<idno type="RBID">Pascal:04-0134445</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000723</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Linear-time computation of local periods</title>
<author><name sortKey="Duval, Jean Pierre" sort="Duval, Jean Pierre" uniqKey="Duval J" first="Jean-Pierre" last="Duval">Jean-Pierre Duval</name>
<affiliation><inist:fA14 i1="01"><s1>LIFAR, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, University of Liverpool</s1>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation><inist:fA14 i1="03"><s1>INRIA/LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
<affiliation><inist:fA14 i1="04"><s1>ABISS, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Lefebvre, Arnaud" sort="Lefebvre, Arnaud" uniqKey="Lefebvre A" first="Arnaud" last="Lefebvre">Arnaud Lefebvre</name>
<affiliation><inist:fA14 i1="04"><s1>ABISS, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computation time</term>
<term>Linear time</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Temps linéaire</term>
<term>Temps calcul</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2747</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Linear-time computation of local periods</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>MFCS 2003 : mathematical foundations of computer science 2003 : Bratislava, 25-29 August 2003</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DUVAL (Jean-Pierre)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KOLPAKOV (Roman)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KUCHEROV (Gregory)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>LECROQ (Thierry)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>LEFEBVRE (Arnaud)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ROVAN (Branislav)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VOJTAS (Peter)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LIFAR, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Computer Science, University of Liverpool</s1>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>INRIA/LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>ABISS, Université de Rouen</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</fA14>
<fA20><s1>388-397</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-40671-9</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117777950330</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>24 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0134445</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Temps linéaire</s0>
<s5>21</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Linear time</s0>
<s5>21</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Tiempo lineal</s0>
<s5>21</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Temps calcul</s0>
<s5>22</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Computation time</s0>
<s5>22</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Tiempo computación</s0>
<s5>22</s5>
</fC03>
<fN21><s1>089</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Mathematical foundations of computer science. International symposium</s1>
<s2>28</s2>
<s3>Bratislava SVK</s3>
<s4>2003-08-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0134445 INIST</NO>
<ET>Linear-time computation of local periods</ET>
<AU>DUVAL (Jean-Pierre); KOLPAKOV (Roman); KUCHEROV (Gregory); LECROQ (Thierry); LEFEBVRE (Arnaud); ROVAN (Branislav); VOJTAS (Peter)</AU>
<AF>LIFAR, Université de Rouen/France (1 aut.); Department of Computer Science, University of Liverpool/Royaume-Uni (2 aut.); INRIA/LORIA/Nancy/France (3 aut.); ABISS, Université de Rouen/France (4 aut., 5 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2747; Pp. 388-397; Bibl. 24 ref.</SO>
<LA>Anglais</LA>
<EA>We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.</EA>
<CC>001D02A05</CC>
<FD>Temps linéaire; Temps calcul</FD>
<ED>Linear time; Computation time</ED>
<SD>Tiempo lineal; Tiempo computación</SD>
<LO>INIST-16343.354000117777950330</LO>
<ID>04-0134445</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 000723 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000723 | 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:04-0134445
   |texte=   Linear-time computation of local periods
}}

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

Linear-time computation of local periods

Linear-time computation of local periods

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