Dieter Hofbauer. An upper bound on the derivational complexity of Knuth-Bendix orderings. Inf. Comput., 183(1):43-56, 2003. [doi]
@article{Hofbauer03,
title = {An upper bound on the derivational complexity of Knuth-Bendix orderings},
author = {Dieter Hofbauer},
year = {2003},
doi = {10.1016/S0890-5401(03)00008-7},
url = {http://dx.doi.org/10.1016/S0890-5401(03)00008-7},
researchr = {https://researchr.org/publication/Hofbauer03},
cites = {0},
citedby = {0},
journal = {Inf. Comput.},
volume = {183},
number = {1},
pages = {43-56},
}