IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime sieves using binary quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shortest crucial words avoiding abelian powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some logical characterizations of the dot-depth hierarchy and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Seeds Computation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclic binary morphism avoiding abelian fourth powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080338541 / rank
 
Normal rank

Latest revision as of 10:36, 30 July 2024

scientific article; zbMATH DE number 6171170
Language Label Description Also known as
English
IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
scientific article; zbMATH DE number 6171170

    Statements

    Identifiers