default search action
Masahiko Sakai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Ryotaro Harada, Tadahiro Oyama, Kenji Fujimoto
, Toshihiko Shimizu, Masayoshi Ozawa, Julien Samuel Amar, Masahiko Sakai:
Trash Detection Algorithm Suitable for Mobile Robots Using Improved YOLO. J. Adv. Comput. Intell. Intell. Informatics 27(4): 622-631 (2023) - [j20]Shunya Hara, Toshihiko Shimizu, Masayoshi Ozawa, Masahiko Sakai, Tadahiro Oyama, Julien Samuel Amar:
Navit(oo)n: Open Source Mobile Robot Project for Nakanoshima Robot Challenge. J. Robotics Mechatronics 35(6): 1540-1549 (2023) - [i3]Emmanouil Karystinaios
8+8=4: Formalizing Time Units to Handle Symbolic Music Durations. CoRR abs/2310.14952 (2023) - 2021
- [i2]Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda:
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR abs/2110.05184 (2021) - 2020
- [c25]Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, Masahiko Sakai:
ASAP: a dataset of aligned scores and performances for piano transcription. ISMIR 2020: 534-541
2010 – 2019
- 2019
- [j19]Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai
Conditions for confluence of innermost terminating term rewriting systems. Appl. Algebra Eng. Commun. Comput. 30(4): 349-360 (2019) - [c24]Francesco Foscarin
A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring. MCM 2019: 248-260 - 2018
- [c23]Genki Sakanashi, Masahiko Sakai
Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems. PPDP 2018: 19:1-19:13 - 2017
- [c22]Yutaro Nagae, Masahiko Sakai
Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems. WPTE@FSCD 2017: 67-81 - [c21]Tomohiro Sasano, Naoki Nishida, Masahiko Sakai
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers. WPTE@FSCD 2017: 82-97 - 2016
- [c20]Yutaro Nagae, Masahiko Sakai
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems. WPTE@FSCD 2016: 46-61 - [c19]Ryota Nakayama, Naoki Nishida, Masahiko Sakai
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems. WPTE@FSCD 2016: 62-77 - 2015
- [j18]Masahiko Sakai
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers. IEICE Trans. Inf. Syst. 98-D(6): 1121-1127 (2015) - [c18]Masahiko Sakai
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent. CADE 2015: 111-126 - [c17]Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. CADE 2015: 137-151 - 2014
- [c16]Masanori Nagashima, Tomofumi Kato, Masahiko Sakai
Inverse Unfold Problem and Its Heuristic Solving. WPTE@RTA/TLCA 2014: 27-38 - [e1]Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba:
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, July 13, 2014, Vienna, Austria. OASIcs 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-70-5 [contents] - 2013
- [c15]Naoki Nishida, Masahiko Sakai
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms. TTATT 2013: 1-10 - 2012
- [j17]Naoki Nishida, Masahiko Sakai
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. Log. Methods Comput. Sci. 8(3) (2012) - [j16]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida:
A Sound Type System for Typing Runtime Errors. Inf. Media Technol. 7(2): 667-675 (2012) - [j15]Masanori Nagashima, Masahiko Sakai
Determinization of conditional term rewriting systems. Theor. Comput. Sci. 464: 72-89 (2012) - [c14]Minami Niwa, Naoki Nishida, Masahiko Sakai
Improving Determinization of Grammar Programs for Program Inversion. LOPSTR 2012: 155-175 - 2011
- [j14]Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe:
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems. Inf. Media Technol. 6(4): 1185-1208 (2011) - [c13]Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
Controlled Term Rewriting. FroCoS 2011: 179-194 - [c12]Naoki Nishida, Masahiko Sakai
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. RTA 2011: 267-282 - [i1]Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui:
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems. CoRR abs/1109.5468 (2011) - 2010
- [j13]Keita Uchiyama, Masahiko Sakai
Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. IEICE Trans. Inf. Syst. 93-D(5): 953-962 (2010) - [j12]Masahiko Sakai
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. Inf. Process. Lett. 110(18-19): 810-814 (2010) - [c11]Naoki Nishida, Masahiko Sakai
Proving Injectivity of Functions via Program Inversion in Term Rewriting. FLOPS 2010: 288-303
2000 – 2009
- 2009
- [j11]Keiichirou Kusakari, Masahiko Sakai
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques. IEICE Trans. Inf. Syst. 92-D(2): 235-247 (2009) - [j10]Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. 92-D(10): 2007-2015 (2009) - [j9]Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa:
Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes. Inf. Media Technol. 4(2): 411-432 (2009) - [j8]Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe:
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems. Inf. Media Technol. 4(4): 802-814 (2009) - 2008
- [c10]Yoshiharu Kojima, Masahiko Sakai
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. RTA 2008: 187-201 - [c9]Naoki Nishida, Masahiko Sakai
Completion after Program Inversion of Injective Functions. WRS@RTA 2008: 39-56 - 2007
- [j7]Keiichirou Kusakari, Masahiko Sakai
Enhancing dependency pair method using strong computability in simply-typed term rewriting. Appl. Algebra Eng. Commun. Comput. 18(5): 407-431 (2007) - [c8]Keita Uchiyama, Masahiko Sakai
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. WRS@RDP 2007: 21-34 - [c7]Masahiko Sakai
Undecidable Properties on Length-Two String Rewriting Systems. WRS@RDP 2007: 53-69 - 2006
- [c6]Yi Wang, Masahiko Sakai
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. RTA 2006: 343-356 - [c5]Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai
Transformation for Refining Unraveled Conditional Term Rewriting Systems. WRS@FLoC 2006: 75-95 - 2005
- [j6]Masahiko Sakai, Keiichirou Kusakari:
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. 88-D(3): 583-593 (2005) - [j5]Keiichirou Kusakari, Masahiko Sakai
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Trans. Inf. Syst. 88-D(12): 2715-2726 (2005) - [c4]Naoki Nishida, Masahiko Sakai
Partial Inversion of Constructor Term Rewriting Systems. RTA 2005: 264-278 - 2003
- [c3]Naoki Nishida, Masahiko Sakai
Narrowing-based simulation of term rewriting systems with extra variables. WFLP 2003: 52-69 - 2002
- [c2]Hideto Kasuya, Masahiko Sakai
Descendants and Head Normalization of Higher-Order Rewrite Systems. FLOPS 2002: 198-211
1990 – 1999
- 1998
- [j4]Masahiko Sakai
Semantics and Strong Sequentiality of Priority Term Rewriting Systems. Theor. Comput. Sci. 208(1-2): 87-110 (1998) - 1997
- [j3]Takeshi Hamaguchi, Masahiko Sakai, Shinichirou Yamamoto, Kiyoshi Agusa:
Algebraic specification with provision for the automatic addition of error descriptions. Syst. Comput. Jpn. 28(1): 1-9 (1997) - 1996
- [j2]Takeshi Hamaguchi, Shinichirou Yamamoto, Kiyoshi Agusa, Masahiko Sakai
Error description on algebraic specification and its automatic addition. Syst. Comput. Jpn. 27(10): 59-67 (1996) - [c1]Masahiko Sakai
Semantics and Strong Sequentiality of Priority Term Rewriting Systems. RTA 1996: 377-391 - 1992
- [j1]Masahiko Sakai
Algebraic specification and automatic generation of compilers. Syst. Comput. Jpn. 23(2): 1-13 (1992)
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-10-07 21:12 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: