default search action
Kazuhiro Inaba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j3]Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. Acta Informatica 58(1-2): 95-152 (2021)
2010 – 2019
- 2019
- [i3]Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. CoRR abs/1904.09203 (2019) - 2015
- [i2]Kazuhiro Inaba:
Quick Brown Fox in Formal Languages. CoRR abs/1512.08168 (2015) - 2014
- [c14]Naoki Kobayashi, Kazuhiro Inaba, Takeshi Tsukada:
Unsafe Order-2 Tree Languages Are Context-Sensitive. FoSSaCS 2014: 149-163 - [c13]Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi:
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML 2014: 351-359 - 2012
- [j2]Kazutaka Matsuda, Kazuhiro Inaba, Keisuke Nakano:
Polynomial-time inverse computation for accumulative functions with multiple data traversals. High. Order Symb. Comput. 25(1): 3-38 (2012) - [c12]Kazutaka Matsuda, Kazuhiro Inaba, Keisuke Nakano:
Polynomial-time inverse computation for accumulative functions with multiple data traversals. PEPM 2012: 5-14 - 2011
- [c11]Isao Sasano, Zhenjiang Hu, Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano:
Toward Bidirectionalization of ATL with GRoundTram. ICMT@TOOLS 2011: 138-151 - [c10]Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano:
GRoundTram: An integrated framework for developing well-behaved bidirectional model transformations. ASE 2011: 480-483 - [c9]Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano, Isao Sasano:
Marker-Directed Optimization of UnCAL Graph Transformations. LOPSTR 2011: 123-138 - [c8]Kazuhiro Inaba, Soichiro Hidaka, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano:
Graph-transformation verification using monadic second-order logic. PPDP 2011: 17-28 - 2010
- [j1]Kazuhiro Inaba, Haruo Hosoya:
Compact representation for answer sets of n-ary regular queries. Theor. Comput. Sci. 411(38-39): 3481-3492 (2010) - [c7]Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano:
Bidirectionalizing graph transformations. ICFP 2010: 205-216
2000 – 2009
- 2009
- [c6]Kazuhiro Inaba, Haruo Hosoya:
Compact Representation for Answer Sets of n-ary Regular Queries. CIAA 2009: 94-104 - [i1]Kazuhiro Inaba, Sebastian Maneth:
The Complexity of Translation Membership for Macro Tree Transducers. CoRR abs/0910.2315 (2009) - 2008
- [c5]Kazuhiro Inaba, Sebastian Maneth:
The Complexity of Tree Transducer Output Languages. FSTTCS 2008: 244-255 - [c4]Kazuhiro Inaba, Haruo Hosoya:
Multi-Return Macro Tree Transducers. PLAN-X 2008 - [c3]Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth:
Multi-Return Macro Tree Transducers. CIAA 2008: 102-111 - 2007
- [c2]Kazuhiro Inaba, Haruo Hosoya:
XML Transformation Language Based on Monadic Second Order Logic. PLAN-X 2007: 49-60 - [c1]Kazuhiro Inaba, Haruo Hosoya:
MTran: An XML Transformation Language Based on Monadic Second Order Logic. PLAN-X 2007: 91-92
Coauthor Index
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:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint