Akimasa Morihata

Orcid: 0000-0003-2741-5954

According to our database1, Akimasa Morihata authored at least 30 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
When does 0-1 Principle Hold for Prefix Sums?
New Gener. Comput., September, 2023

Conjuring Fusion Laws via Relational Calculus.
J. Inf. Process., 2023

2022
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing.
J. Funct. Program., 2022

2021
Lambda calculus with algebraic simplification for reduction parallelisation: Extended study.
J. Funct. Program., 2021

Reverse engineering for reduction parallelization via semiring polynomials.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2019
Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning.
Proc. ACM Program. Lang., 2019

Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel.
J. Inf. Process., 2019

2018
Incremental computing with data structures.
Sci. Comput. Program., 2018

Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers.
Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

2016
From identification of parallelizability to derivation of parallelizable codes.
Proceedings of the 5th International Workshop on Functional High-Performance Computing, 2016

Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Incremental Computing with Abstract Data Structures.
Proceedings of the Functional and Logic Programming - 13th International Symposium, 2016

2015
Approximate by thinning: Deriving fully polynomial-time approximation schemes.
Sci. Comput. Program., 2015

2014
Dynamic Programming via Thinning and Incrementalization.
Proceedings of the Functional and Logic Programming - 12th International Symposium, 2014

The Essence of Ruby.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

Syntax-Directed Divide-and-Conquer Data-Flow Analysis.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
A short cut to parallelization theorems.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
Manipulating accumulative functions by swapping call-time and return-time computations.
J. Funct. Program., 2012

Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011
A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree.
Proceedings of the International Conference on Computational Science, 2011

A Short Cut to Optimal Sequences.
New Gener. Comput., 2011

Generalising and dualising the third list-homomorphism theorem: functional pearl.
Proceedings of the Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, 2011

Balanced trees inhabiting functional parallel programming.
Proceedings of the Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, 2011

Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning.
Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2010

Automatic Parallelization of Recursive Functions Using Quantifier Elimination.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

2008
Write it recursively: a generic framework for optimal path queries.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007
Automatic inversion generates divide-and-conquer parallel programs.
Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

2006
Swapping Arguments and Results of Recursive Functions.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006


  Loading...