Two optimal parallel algorithms on the commutation class of a word (Q1882917): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000242366 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial problems of commutation and rearrangements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4260375 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3736919 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorics on traces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023519 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Prefix Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3219752 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Notes on finite asynchronous automata / rank | |||
Normal rank | |||
Latest revision as of 12:07, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two optimal parallel algorithms on the commutation class of a word |
scientific article |
Statements
Two optimal parallel algorithms on the commutation class of a word (English)
0 references
1 October 2004
0 references
automaton
0 references
commutation class
0 references
parallel algorithm
0 references
partially commutative monoid
0 references
