Parallel RAM algorithms for factorizing words (Q1325834): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast parallel Lyndon factorization with applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Factorizing words over an ordered alphabet / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal algorithms for computing the canonical form of a circular string / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4529547 / rank | |||
Normal rank | |||
Latest revision as of 15:51, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel RAM algorithms for factorizing words |
scientific article |
Statements
Parallel RAM algorithms for factorizing words (English)
0 references
26 January 1995
0 references
CRCW PRAM algorithm
0 references
Lyndon factorization
0 references
unbounded alphabet
0 references
