We stand with Ukraine  

Kohtaro Watanabe

Orcid: 0000-0001-9674-0924

Affiliations:
  • National Defense Academy of Japan, Department of Computer Science, Yokosuka, Japan


According to our database1, Kohtaro Watanabe authored at least 11 papers between 2005 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems.
[BibTeX]
[DOI]
Kohtaro Watanabe
,
Motonari Ohtsuka
,
Yuta Tsukie
IEEE Trans. Inf. Theory, 2024

2022
Improved scheme and evaluation method for progressive visual cryptography.
[BibTeX]
[DOI]
Binh Le Thanh Thai
,
Hidema Tanaka
,
Kohtaro Watanabe
EURASIP J. Inf. Secur., 2022

2021
Shortened LDPC codes accelerate OSD decoding performance.
[BibTeX]
[DOI]
Kohtaro Watanabe
,
Ryusei Kaguchi
,
Toshiya Shinoda
EURASIP J. Wirel. Commun. Netw., 2021

2020
The best constant of discrete Sobolev inequality on 1812 C60 fullerene isomers.
[BibTeX]
[DOI]
Yoshinori Kametaka
,
Kohtaro Watanabe
,
Atsushi Nagai
,
Kazuo Takemura
,
Hiroyuki Yamagishi
,
Hiroto Sekido
JSIAM Lett., 2020

2013
The best estimation corresponding to continuous model of Thomson cable.
[BibTeX]
[DOI]
Hiroyuki Yamagishi
,
Yoshinori Kametaka
,
Atsushi Nagai
,
Kohtaro Watanabe
,
Kazuo Takemura
JSIAM Lett., 2013

Complete low-cut filter and the best constant of Sobolev inequality.
[BibTeX]
[DOI]
Hiroyuki Yamagishi
,
Yoshinori Kametaka
,
Atsushi Nagai
,
Kohtaro Watanabe
,
Kazuo Takemura
JSIAM Lett., 2013

2012
Elliptic theta function and the best constants of Sobolev-type inequalities.
[BibTeX]
[DOI]
Hiroyuki Yamagishi
,
Yoshinori Kametaka
,
Atsushi Nagai
,
Kohtaro Watanabe
,
Kazuo Takemura
JSIAM Lett., 2012

2011
Riemann zeta function and Lyapunov-type inequalities for certain higher order differential equations.
[BibTeX]
[DOI]
Kohtaro Watanabe
,
Hiroyuki Yamagishi
,
Yoshinori Kametaka
Appl. Math. Comput., 2011

2010
Listing all the minimum spanning trees in an undirected graph.
[BibTeX]
[DOI]
Takeo Yamada
,
Seiji Kataoka
,
Kohtaro Watanabe
Int. J. Comput. Math., 2010

2005
Algorithms to solve the knapsack constrained maximum spanning tree problem.
[BibTeX]
[DOI]
Takeo Yamada
,
Kohtaro Watanabe
,
Seiji Kataoka
Int. J. Comput. Math., 2005

Heuristic and exact algorithms for the spanning tree detection problem.
[BibTeX]
[DOI]
Takeo Yamada
,
Seiji Kataoka
,
Kohtaro Watanabe
Comput. Oper. Res., 2005


  Loading...