Mitsuru Kusumoto

Publication Activity (10 Years)

Years Active: 2012-2019
Publications (10 Years): 3

Top Topics

Automated Theorem Proving

Theoretic Framework

Constant Factor Approximation

Top Venues

Publications

Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe, Takuya Akiba, Masanori Koyama
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation. NeurIPS (2019)
Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe, Takuya Akiba, Masanori Koyama
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation. CoRR (2019)
Mitsuru Kusumoto, Keisuke Yahata, Masahiro Sakai
Automated Theorem Proving in Intuitionistic Propositional Logic by Deep Reinforcement Learning. CoRR (2018)
Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
Scalable SimRank join algorithm. ICDE (2015)
Mitsuru Kusumoto, Yuichi Yoshida
Testing Forest-Isomorphism in the Adjacency List Model. ICALP (1) (2014)
Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
Efficient SimRank computation via linearizationPublication of this article pending inquiry. KDD (2014)
Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
Efficient SimRank Computation via Linearization. CoRR (2014)
Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi
Scalable similarity search for SimRank. SIGMOD Conference (2014)
Mitsuru Kusumoto, Yuichi Yoshida
Testing Forest-Isomorphism in the Adjacency List Model. CoRR (2014)
Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, Ken-ichi Kawarabayashi
Mining for Analogous Tuples from an Entity-Relation Graph. IJCAI (2013)
Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. 3 (2) (2013)
Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC (2012)