On Dehn presentations and Dehn algorithms
The word problems for some classes of small cancellation groups are solved by means of algorithms which are much simpler than those previously known for certain subclasses. The corresponding proofs are also considerably simpler.
scientific article; zbMATH DE number 3929282