default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshiki Nakamura 0001
Person information
- affiliation: Tokyo Institute of Technology, School of Computing, Tokyo, Japan
Other persons with the same name
- Yoshiki Nakamura 0002
![[0000-0002-7739-7574]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7739-7574")
— Tokyo Institute of Technology, Department of Industrial Engineering and Economics, Tokyo, Japan - Yoshiki Nakamura 0003 — Yokohama National University, Yokohama, Japan
- Yoshiki Nakamura 0004 — Nihon University, Tokyo, Japan
- Yoshiki Nakamura 0005 — Aoyama Gakuin University, Kanagawa, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Yoshiki Nakamura:
Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph Loops. RAMiCS 2024: 207-224- [i4]Yoshiki Nakamura:
Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure. CoRR abs/2408.08236 (2024) - 2023
- [c9]Yoshiki Nakamura:
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. LICS 2023: 1-13 - [c8]Yoshiki Nakamura:
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. MFCS 2023: 69:1-69:15 - [c7]Yoshiki Nakamura, Ryoma Sin'ya:
Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements. AFL 2023: 185-199 - [i3]Yoshiki Nakamura:
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. CoRR abs/2304.12079 (2023) - [i2]Yoshiki Nakamura:
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. CoRR abs/2307.05046 (2023) - [i1]Yoshiki Nakamura:
Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity. CoRR abs/2310.02845 (2023) - 2022
- [j2]Yoshiki Nakamura:
Expressive power and succinctness of the positive calculus of binary relations. J. Log. Algebraic Methods Program. 127: 100760 (2022) - [c6]Yoshiki Nakamura:
Spatial Existential Positive Logics for Hyperedge Replacement Grammars. CSL 2022: 30:1-30:17 - 2021
- [j1]Yoshiki Nakamura, Naosuke Matsuda:
On Implicational Intermediate Logics Axiomatizable by Formulas Minimal in Classical Logic: A Counter-Example to the Komori-Kashima Problem. Stud Logica 109(6): 1413-1422 (2021) - 2020
- [c5]Yoshiki Nakamura:
Expressive Power and Succinctness of the Positive Calculus of Relations. RAMiCS 2020: 204-220 - [c4]Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
On Average-Case Hardness of Higher-Order Model Checking. FSCD 2020: 21:1-21:23
2010 – 2019
- 2019
- [c3]Yoshiki Nakamura:
The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation. ICLA 2019: 108-120 - 2017
- [c2]Yoshiki Nakamura:
Partial derivatives on graphs for Kleene allegories. LICS 2017: 1-12 - 2016
- [c1]Yoshiki Nakamura:
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities. GandALF 2016: 272-286
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-09-25 01:36 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:
