-
Efficient algorithms for highly compressed data: The Word Problem in Higman's...
International audience -
Algorithms for Garside calculus
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's... -
On the inverse braid monoid
International audience -
About presentations of braid groups and their generalizations
35 pages, 18 figures -
Foundations of Garside Theory
This text consists of the introduction, table of contents, and bibliography of a long manuscript (703 pages) that is currently submitted for publication. This... -
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful... -
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematiz...
Colloque avec actes et comité de lecture.
