Swapping Arguments and Results of Recursive Functions. - Akimasa Morihata; Kazuhiko Kakehi 001; Zhenjiang Hu; Masato Takeichi (MPC, 2006)

Automatic inversion generates divide-and-conquer parallel programs. - Kazutaka Morita; Akimasa Morihata; Kiminori Matsuzaki; Zhenjiang Hu; Masato Takeichi (PLDI, 2007)

Write it recursively: a generic framework for optimal path queries. - Akimasa Morihata; Kiminori Matsuzaki; Masato Takeichi (ICFP, 2008)

The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. - Akimasa Morihata; Kiminori Matsuzaki; Zhenjiang Hu; Masato Takeichi (POPL, 2009)

Automatic Parallelization of Recursive Functions Using Quantifier Elimination. - Akimasa Morihata; Kiminori Matsuzaki (FLOPS, 2010)

Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. - Shin-Cheng Mu; Yu-Han Lyu; Akimasa Morihata (ICFP-WGP, 2010)

Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism. - Akimasa Morihata (APLAS, 2011)

Balanced trees inhabiting functional parallel programming. - Akimasa Morihata; Kiminori Matsuzaki (ICFP, 2011)

Generalising and dualising the third list-homomorphism theorem: functional pearl. - Shin-Cheng Mu; Akimasa Morihata (ICFP, 2011)

A Short Cut to Optimal Sequences. - Akimasa Morihata (New Gener. Comput., 2011)

A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree. - Akimasa Morihata; Kiminori Matsuzaki (ICCS, 2011)

Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems. - Akimasa Morihata (FLOPS, 2012)

Manipulating accumulative functions by swapping call-time and return-time computations. - Akimasa Morihata; Kazuhiko Kakehi 001; Zhenjiang Hu; Masato Takeichi (J. Funct. Program., 2012)

A short cut to parallelization theorems. - Akimasa Morihata (ICFP, 2013)

Syntax-Directed Divide-and-Conquer Data-Flow Analysis. - Shigeyuki Sato 001; Akimasa Morihata (APLAS, 2014)

The Essence of Ruby. - Katsuhiro Ueno; Yutaka Fukasawa; Akimasa Morihata; Atsushi Ohori (APLAS, 2014)

Dynamic Programming via Thinning and Incrementalization. - Akimasa Morihata; Masato Koishi; Atsushi Ohori (FLOPS, 2014)

Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree. - Akimasa Morihata; Kiminori Matsuzaki (Inf. Media Technol., 2015)

Approximate by thinning: Deriving fully polynomial-time approximation schemes. - Shin-Cheng Mu; Yu-Han Lyu; Akimasa Morihata (Sci. Comput. Program., 2015)

Incremental Computing with Abstract Data Structures. - Akimasa Morihata (FLOPS, 2016)

Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing. - Kento Emoto; Kiminori Matsuzaki; Zhenjiang Hu; Akimasa Morihata; Hideya Iwasaki (ICFP, 2016)

From identification of parallelizability to derivation of parallelizable codes. - Akimasa Morihata (FHPC@ICFP, 2016)

Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers. - Akimasa Morihata; Kento Emoto; Kiminori Matsuzaki; Zhenjiang Hu; Hideya Iwasaki (FLOPS, 2018)

Incremental computing with data structures. - Akimasa Morihata (Sci. Comput. Program., 2018)

Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel. - Akimasa Morihata (J. Inf. Process., 2019)

Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning. - Akimasa Morihata (Proc. ACM Program. Lang., 2019)

Reverse engineering for reduction parallelization via semiring polynomials. - Akimasa Morihata; Shigeyuki Sato 001 (PLDI, 2021)

Lambda calculus with algebraic simplification for reduction parallelisation: Extended study. - Akimasa Morihata (J. Funct. Program., 2021)

Fregel: a functional domain-specific language for vertex-centric large-scale graph processing. - Hideya Iwasaki; Kento Emoto; Akimasa Morihata; Kiminori Matsuzaki; Zhenjiang Hu (J. Funct. Program., 2022)

Conjuring Fusion Laws via Relational Calculus. - Akimasa Morihata (J. Inf. Process., 2023)

When does 0-1 Principle Hold for Prefix Sums? - Akimasa Morihata (New Gener. Comput., 2023)

Leveraging LLM for Detecting and Explaining LLM-generated Code in Python Programming Courses. - Jeonghun Baek; Tetsuro Yamazaki; Akimasa Morihata; Junichiro Mori; Yoko Yamakata; Kenjiro Taura; Shigeru Chiba (SIGCSE (2), 2025)