Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuhiko Kakehi 0001
Person information
- affiliation: University of Tokyo, Graduate School of Information Science and Technology, Japan
- affiliation: Waseda University, Institute for Software Production Technology, Tokyo, Japan
- not to be confused with: Katsuhiko Kakehi 0001
Other persons with the same name
- Kazuhiko Kakehi — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]Kazuhiko Kakehi, Kiminori Matsuzaki, Kento Emoto:
Efficient Parallel Tree Reductions on Distributed Memory Environments. Scalable Comput. Pract. Exp. 18(1): 1-15 (2017)- 2012
- [j3]Akimasa Morihata
, Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi:
Manipulating accumulative functions by swapping call-time and return-time computations. J. Funct. Program. 22(3): 275-299 (2012) - 2010
- [c10]Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Kiminori Matsuzaki, Masato Takeichi:
Generators-of-Generators Library with Optimization Capabilities in Fortress. Euro-Par (2) 2010: 26-37
2000 – 2009
- 2007
- [j2]Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi:
A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays. Int. J. Parallel Program. 35(6): 615-658 (2007) - [c9]Kazuhiko Kakehi, Kiminori Matsuzaki, Kento Emoto:
Efficient Parallel Tree Reductions on Distributed Memory Environments. International Conference on Computational Science (2) 2007: 601-608 - 2006
- [c8]Akimasa Morihata, Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi:
Swapping Arguments and Results of Recursive Functions. MPC 2006: 379-396 - 2005
- [j1]Kiminori Matsuzaki, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi:
Systematic Derivation of Tree Contraction Algorithms. Parallel Process. Lett. 15(3): 321-336 (2005) - 2004
- [c7]Kiminori Matsuzaki, Kazuhiko Kakehi, Hideya Iwasaki, Zhenjiang Hu, Yoshiki Akashi:
A Fusion-Embedded Skeleton Library. Euro-Par 2004: 644-653 - [c6]Kumiko Tanaka-Ishii, Kazuhiko Kakehi, Masato Takeichi:
EMMA: a web-based report system for programming course--automated verification and enhanced feedback. ITiCSE 2004: 278 - 2003
- [c5]Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi:
An Efficient Staging Algorithm for Binding-Time Analysis. LOPSTR 2003: 106-107 - [c4]Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi:
List Homomorphism with Accumulation. SNPD 2003: 250-259 - 2002
- [c3]Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi:
Fusion Transformation on Functional Programs of Regular Expression Types. APLAS 2002: 160-174 - 2001
- [c2]Kazuhiko Kakehi, Robert Glück, Yoshihiko Futamura:
On Deforesting Parameters of Accumulating Maps. LOPSTR 2001: 46-56 - [c1]Armin Kühnemann, Robert Glück, Kazuhiko Kakehi:
Relating Accumulative and Non-accumulative Functional Programs. RTA 2001: 154-168
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-04-24 23:16 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:
