Shuffle factorization is unique (Q1605326)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Shuffle factorization is unique	scientific article

Statements

scholarly article

0 references

Shuffle factorization is unique (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

15 July 2002

0 references

zbMATH Keywords

shuffle

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A constant time string shuffle algorithm on reconfigurable meshes

0 references

A natural ring basis for the shuffle algebra and an application to group schemes

0 references

0 references

Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)

0 references

full work available at URL

https://doi.org/10.1016/s0304-3975(00)00433-3

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0304-3975(00)00433-3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1605326

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1605326&oldid=36960756"