default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaohi Eguchi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j3]Martin Avanzini, Naohi Eguchi, Georg Moser:
A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. 585: 3-24 (2015)- [c5]Naohi Eguchi:
Formalizing Termination Proofs under Polynomial Quasi-interpretations. FICS 2015: 33-47 - 2014
- [c4]Naohi Eguchi:
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems. TERMGRAPH 2014: 33-47 - [i7]Naohi Eguchi:
Proving Termination of Unfolding Graph Rewriting for General Safe Recursion. CoRR abs/1404.6196 (2014) - 2013
- [c3]Naohi Eguchi:
Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions. FOPARA 2013: 77-92 - [i6]Naohi Eguchi:
Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions. CoRR abs/1308.0247 (2013) - [i5]Martin Avanzini, Naohi Eguchi:
A New Term Rewriting Characterisation of ETIME functions. CoRR abs/1312.7284 (2013) - 2012
- [c2]Martin Avanzini, Naohi Eguchi, Georg Moser:
A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS 2012: 280-295 - [i4]Naohi Eguchi:
A term-rewriting characterization of PSPACE. CoRR abs/1201.0562 (2012) - [i3]Martin Avanzini, Naohi Eguchi, Georg Moser:
A New Order-theoretic Characterisation of the Polytime Computable Functions. CoRR abs/1201.2553 (2012) - 2011
- [c1]Martin Avanzini, Naohi Eguchi, Georg Moser:
A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA 2011: 123-138 - 2010
- [i2]Martin Avanzini, Naohi Eguchi, Georg Moser:
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report). CoRR abs/1010.1128 (2010)
2000 – 2009
- 2009
- [j2]Naohi Eguchi:
A lexicographic path order with slow growing derivation bounds. Math. Log. Q. 55(2): 212-224 (2009) - [j1]Toshiyasu Arai, Naohi Eguchi:
A new function algebra of EXPTIME functions by safe nested recursion. ACM Trans. Comput. Log. 10(4): 24:1-24:19 (2009) - 2006
- [i1]Toshiyasu Arai, Naohi Eguchi:
A new function algebra of EXPTIME functions by safe nested recursion. CoRR abs/cs/0607118 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
