Geodesic
Fast algorithms for identification and comparison of braids
Zapiski Nauchnykh Seminarov POMI, Geometry and topology. Part 6, Tome 279 (2001), pp. 197-217

Voir la notice de l'article provenant de la source Math-Net.Ru

A method for constructing various algorithms for mapping-class groups (e.g., for the braid group) is presented, and a family of one-side invariant orders on the mapping-class group of a surface with boundary is described. A method for constructing comparison algorithms for all finite orders on the mapping-class group of any surface with boundary is described, a fast and simple comparison algorithm for the Dehornois order on the braid group is presented, examples of normal forms for braid groups are given, and algorithms for finding the forms are indicated. 
@article{ZNSL_2001_279_a12,
     author = {A. V. Malyutin},
     title = {Fast algorithms for identification and comparison of braids},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {197--217},
     publisher = {mathdoc},
     volume = {279},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2001_279_a12/}
}
TY  - JOUR
AU  - A. V. Malyutin
TI  - Fast algorithms for identification and comparison of braids
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2001
SP  - 197
EP  - 217
VL  - 279
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2001_279_a12/
LA  - ru
ID  - ZNSL_2001_279_a12
ER  - 
%0 Journal Article
%A A. V. Malyutin
%T Fast algorithms for identification and comparison of braids
%J Zapiski Nauchnykh Seminarov POMI
%D 2001
%P 197-217
%V 279
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2001_279_a12/
%G ru
%F ZNSL_2001_279_a12
A. V. Malyutin. Fast algorithms for identification and comparison of braids. Zapiski Nauchnykh Seminarov POMI, Geometry and topology. Part 6, Tome 279 (2001), pp. 197-217. http://geodesic.mathdoc.fr/item/ZNSL_2001_279_a12/