A lexicographic path order with slow growing derivation bounds. - Naohi Eguchi (Math. Log. Q., 2009)

A new function algebra of EXPTIME functions by safe nested recursion. - Toshiyasu Arai; Naohi Eguchi (ACM Trans. Comput. Log., 2009)

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) - Martin Avanzini; Naohi Eguchi; Georg Moser (CoRR, 2010)

A Path Order for Rewrite Systems that Compute Exponential Time Functions. - Martin Avanzini; Naohi Eguchi; Georg Moser (RTA, 2011)

A term-rewriting characterization of PSPACE - Naohi Eguchi (CoRR, 2012)

Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions. - Naohi Eguchi (FOPARA, 2013)

A New Term Rewriting Characterisation of ETIME functions. - Martin Avanzini; Naohi Eguchi (CoRR, 2013)

Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions. - Naohi Eguchi (CoRR, 2013)

Proving Termination of Unfolding Graph Rewriting for General Safe Recursion. - Naohi Eguchi (CoRR, 2014)

Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems. - Naohi Eguchi (TERMGRAPH, 2014)

Formalizing Termination Proofs under Polynomial Quasi-interpretations. - Naohi Eguchi (FICS, 2015)

A new order-theoretic characterisation of the polytime computable functions. - Martin Avanzini; Naohi Eguchi; Georg Moser (Theor. Comput. Sci., 2015)