On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems. In Jakob Rehof (Hrsg.), 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024), (299):16:1--16:18, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2024. [PUMA: Confluence Derivational Description_Logics Proof_rewriting Rewriting Termination complexity topic_knowledge yaff] URL