Travelled to:1 × Canada
3 × USA
4 × Japan
Collaborated with:K.Matsuzaki ∅ M.Takeichi S.Mu Z.Hu M.Koishi A.Ohori K.Morita
Talks about:parallel (5) function (3) theorem (3) program (3) homomorph (2) conquer (2) automat (2) recurs (2) third (2) divid (2)
Person: Akimasa Morihata
DBLP: Morihata:Akimasa
Contributed to:
2014
2013201220112010
20092008
2007Wrote 9 papers:
- FLOPS-2014-MorihataKO #programming
- Dynamic Programming via Thinning and Incrementalization (AM, MK, AO), pp. 186–202.
- ICFP-2013-Morihata #parallel #theorem
- A short cut to parallelization theorems (AM), pp. 245–256.
- FLOPS-2012-Morihata #algorithm #parallel #problem
- Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems (AM), pp. 213–227.
- ICFP-2011-MorihataM #functional #parallel #programming
- Balanced trees inhabiting functional parallel programming (AM, KM), pp. 117–128.
- ICFP-2011-MuM #functional #morphism #theorem
- Generalising and dualising the third list-homomorphism theorem: functional pearl (SCM, AM), pp. 385–391.
- FLOPS-2010-MorihataM #automation #parallel #quantifier #recursion #using
- Automatic Parallelization of Recursive Functions Using Quantifier Elimination (AM, KM), pp. 321–336.
- POPL-2009-MorihataMHT #divide and conquer #morphism #theorem
- The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer (AM, KM, ZH, MT), pp. 177–185.
- ICFP-2008-MorihataMT #framework #query #recursion
- Write it recursively: a generic framework for optimal path queries (AM, KM, MT), pp. 169–178.
- PLDI-2007-MoritaMMHT #automation #divide and conquer #parallel #source code
- Automatic inversion generates divide-and-conquer parallel programs (KM, AM, KM, ZH, MT), pp. 146–155.