 | 2012 |
| 13 |  | Akimasa Morihata:
Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems.
FLOPS 2012: 213-227 |
| 2011 |
| 12 |  | Akimasa Morihata:
Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism.
APLAS 2011: 204-219 |
| 11 |  | Akimasa Morihata,
Kiminori Matsuzaki:
Balanced trees inhabiting functional parallel programming.
ICFP 2011: 117-128 |
| 10 |  | Shin-Cheng Mu,
Akimasa Morihata:
Generalising and dualising the third list-homomorphism theorem: functional pearl.
ICFP 2011: 385-391 |
| 9 |  | Akimasa Morihata:
A Short Cut to Optimal Sequences.
New Generation Comput. 29(1): 31-59 (2011) |
| 8 |  | Akimasa Morihata,
Kiminori Matsuzaki:
A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree.
Procedia CS 4: 7-16 (2011) |
| 2010 |
| 7 |  | Akimasa Morihata,
Kiminori Matsuzaki:
Automatic Parallelization of Recursive Functions Using Quantifier Elimination.
FLOPS 2010: 321-336 |
| 6 |  | Shin-Cheng Mu,
Yu-Han Lyu,
Akimasa Morihata:
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning.
ICFP-WGP 2010: 97-108 |
| 2009 |
| 5 |  | Akimasa Morihata:
A Short Cut to Optimal Sequences.
APLAS 2009: 63-78 |
| 4 |  | Akimasa Morihata,
Kiminori Matsuzaki,
Zhenjiang Hu,
Masato Takeichi:
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer.
POPL 2009: 177-185 |
| 2008 |
| 3 |  | Akimasa Morihata,
Kiminori Matsuzaki,
Masato Takeichi:
Write it recursively: a generic framework for optimal path queries.
ICFP 2008: 169-178 |
| 2007 |
| 2 |  | Kazutaka Morita,
Akimasa Morihata,
Kiminori Matsuzaki,
Zhenjiang Hu,
Masato Takeichi:
Automatic inversion generates divide-and-conquer parallel programs.
PLDI 2007: 146-155 |
| 2006 |
| 1 |  | Akimasa Morihata,
Kazuhiko Kakehi,
Zhenjiang Hu,
Masato Takeichi:
Swapping Arguments and Results of Recursive Functions.
MPC 2006: 379-396 |