Naohi Eguchi

Publication Activity (10 Years)

Years Active: 2006-2015
Publications (10 Years): 0

Top Topics

Rewrite Systems

Recursive Functions

Top Venues

Publications

Martin Avanzini, Naohi Eguchi, Georg Moser
A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. 585 (2015)
Naohi Eguchi
Formalizing Termination Proofs under Polynomial Quasi-interpretations. FICS (2015)
Naohi Eguchi
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems. TERMGRAPH (2014)
Naohi Eguchi
Proving Termination of Unfolding Graph Rewriting for General Safe Recursion. CoRR (2014)
Naohi Eguchi
Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions. CoRR (2013)
Martin Avanzini, Naohi Eguchi
A New Term Rewriting Characterisation of ETIME functions. CoRR (2013)
Naohi Eguchi
Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions. FOPARA (2013)
Martin Avanzini, Naohi Eguchi, Georg Moser
A New Order-theoretic Characterisation of the Polytime Computable Functions CoRR (2012)
Naohi Eguchi
A term-rewriting characterization of PSPACE CoRR (2012)
Martin Avanzini, Naohi Eguchi, Georg Moser
A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS (2012)
Martin Avanzini, Naohi Eguchi, Georg Moser
A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA (2011)
Martin Avanzini, Naohi Eguchi, Georg Moser
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) CoRR (2010)
Naohi Eguchi
A lexicographic path order with slow growing derivation bounds. Math. Log. Q. 55 (2) (2009)
Toshiyasu Arai, Naohi Eguchi
A new function algebra of EXPTIME functions by safe nested recursion. ACM Trans. Comput. Log. 10 (4) (2009)
Toshiyasu Arai, Naohi Eguchi
A new function algebra of EXPTIME functions by safe nested recursion CoRR (2006)