default search action
Akimasa Morihata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Akimasa Morihata:
Conjuring Fusion Laws via Relational Calculus. J. Inf. Process. 31: 21-32 (2023) - [j10]Akimasa Morihata
:
When does 0-1 Principle Hold for Prefix Sums? New Gener. Comput. 41(3): 523-531 (2023) - 2022
- [j9]Hideya Iwasaki
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing. J. Funct. Program. 32: e4 (2022) - 2021
- [j8]Akimasa Morihata
Lambda calculus with algebraic simplification for reduction parallelisation: Extended study. J. Funct. Program. 31: e7 (2021) - [c21]Akimasa Morihata
Reverse engineering for reduction parallelization via semiring polynomials. PLDI 2021: 820-834
2010 – 2019
- 2019
- [j7]Akimasa Morihata
Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel. J. Inf. Process. 27: 411-421 (2019) - [j6]Akimasa Morihata:
Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning. Proc. ACM Program. Lang. 3(ICFP): 80:1-80:25 (2019) - 2018
- [j5]Akimasa Morihata
Incremental computing with data structures. Sci. Comput. Program. 164: 18-36 (2018) - [c20]Akimasa Morihata
Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers. FLOPS 2018: 166-181 - 2016
- [c19]Akimasa Morihata
Incremental Computing with Abstract Data Structures. FLOPS 2016: 215-231 - [c18]Akimasa Morihata
From identification of parallelizability to derivation of parallelizable codes. FHPC@ICFP 2016: 1 - [c17]Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Akimasa Morihata
Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing. ICFP 2016: 200-213 - 2015
- [j4]Akimasa Morihata, Kiminori Matsuzaki:
Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree. Inf. Media Technol. 10(1): 17-25 (2015) - [j3]Shin-Cheng Mu
Approximate by thinning: Deriving fully polynomial-time approximation schemes. Sci. Comput. Program. 98: 484-515 (2015) - 2014
- [c16]Katsuhiro Ueno, Yutaka Fukasawa, Akimasa Morihata
The Essence of Ruby. APLAS 2014: 78-98 - [c15]Shigeyuki Sato, Akimasa Morihata
Syntax-Directed Divide-and-Conquer Data-Flow Analysis. APLAS 2014: 392-407 - [c14]Akimasa Morihata
Dynamic Programming via Thinning and Incrementalization. FLOPS 2014: 186-202 - 2013
- [c13]Akimasa Morihata
A short cut to parallelization theorems. ICFP 2013: 245-256 - 2012
- [j2]Akimasa Morihata
Manipulating accumulative functions by swapping call-time and return-time computations. J. Funct. Program. 22(3): 275-299 (2012) - [c12]Akimasa Morihata
Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems. FLOPS 2012: 213-227 - 2011
- [j1]Akimasa Morihata
A Short Cut to Optimal Sequences. New Gener. Comput. 29(1): 31-59 (2011) - [c11]Akimasa Morihata
Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism. APLAS 2011: 204-219 - [c10]Akimasa Morihata
Balanced trees inhabiting functional parallel programming. ICFP 2011: 117-128 - [c9]Shin-Cheng Mu
Generalising and dualising the third list-homomorphism theorem: functional pearl. ICFP 2011: 385-391 - [c8]Akimasa Morihata
A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree. ICCS 2011: 7-16 - 2010
- [c7]Akimasa Morihata
Automatic Parallelization of Recursive Functions Using Quantifier Elimination. FLOPS 2010: 321-336 - [c6]Shin-Cheng Mu
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. ICFP-WGP 2010: 97-108
2000 – 2009
- 2009
- [c5]Akimasa Morihata
A Short Cut to Optimal Sequences. APLAS 2009: 63-78 - [c4]Akimasa Morihata
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. POPL 2009: 177-185 - 2008
- [c3]Akimasa Morihata
Write it recursively: a generic framework for optimal path queries. ICFP 2008: 169-178 - 2007
- [c2]Kazutaka Morita, Akimasa Morihata
Automatic inversion generates divide-and-conquer parallel programs. PLDI 2007: 146-155 - 2006
- [c1]Akimasa Morihata
Swapping Arguments and Results of Recursive Functions. MPC 2006: 379-396
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-08-27 23:00 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: