|
|
| Property / cites work |
| | | |
| Property / cites work: The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Artin groups and infinite Coxeter groups / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: The accessibility of finitely presented groups / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Dehn's algorithm for the word problem / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On Dehn's algorithms for the conjugacy and word problems, with applications / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: An analogue of a theorem of Magnus / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Q3772406 / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Random walk in random groups. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: The halting problem is decidable on a set of asymptotic probability one / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On the hyperbolicity of small cancellation groups and one-relator groups / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: The subadditive ergodic theorem and generic stretching factors for free group automorphisms. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Average-case complexity and decision problems in group theory. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Delzant's \(T\)-invariant, Kolmogorov complexity and one-relator groups. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On group-theoretic models of randomness and genericity. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Random quotients of the modular group are rigid and essentially incompressible / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Groups, the theory of ends, and context-free languages / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Alternating automata on infinite trees / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Q4726235 / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Alternating automata, the weak monadic theory of trees and its complexity / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Generic complexity of undecidable problems / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: ALMOST EVERY GROUP IS HYPERBOLIC / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Peripheral fillings of relatively hyperbolic groups. / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Generic complexity of Presburger arithmetic / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On Dehn's algorithm and the conjugacy problem / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On the conjugacy problem for certain quotient groups of free products / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On Greendlinger's lemma / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Small cancellation theory over free products with amalgamation / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Q4043240 / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group / rank |
| | | Normal rank |
| Property / cites work |
| | | |
| Property / cites work: Q5659762 / rank |
| | | Normal rank |
