default search action
Mitsuru Kusumoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c7]Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe, Takuya Akiba, Masanori Koyama:
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation. NeurIPS 2019: 1161-1170 - [i4]Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe, Takuya Akiba, Masanori Koyama:
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation. CoRR abs/1905.11722 (2019) - 2018
- [i3]Mitsuru Kusumoto, Keisuke Yahata, Masahiro Sakai:
Automated Theorem Proving in Intuitionistic Propositional Logic by Deep Reinforcement Learning. CoRR abs/1811.00796 (2018) - 2015
- [c6]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Scalable SimRank join algorithm. ICDE 2015: 603-614 - 2014
- [c5]Mitsuru Kusumoto, Yuichi Yoshida:
Testing Forest-Isomorphism in the Adjacency List Model. ICALP (1) 2014: 763-774 - [c4]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Efficient SimRank computation via linearizationPublication of this article pending inquiry. KDD 2014: 1426-1435 - [c3]Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable similarity search for SimRank. SIGMOD Conference 2014: 325-336 - [i2]Mitsuru Kusumoto, Yuichi Yoshida:
Testing Forest-Isomorphism in the Adjacency List Model. CoRR abs/1404.7060 (2014) - [i1]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Efficient SimRank Computation via Linearization. CoRR abs/1411.7228 (2014) - 2013
- [j1]Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. 3(2): 205-216 (2013) - [c2]Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Mining for Analogous Tuples from an Entity-Relation Graph. IJCAI 2013: 2064-2070 - 2012
- [c1]Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC 2012: 407-413
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-25 05:57 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: