default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKohtaro Watanabe 0001
Person information
- affiliation: National Defense Academy of Japan, Department of Computer Science, Yokosuka, Japan
Other persons with the same name
- Kohtaro Watanabe 0002 — Meiji University, Nakano-City, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Kohtaro Watanabe
, Motonari Ohtsuka, Yuta Tsukie:
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems. IEEE Trans. Inf. Theory 70(3): 1774-1786 (2024)- 2022
- [j10]Binh Le Thanh Thai, Hidema Tanaka, Kohtaro Watanabe:
Improved scheme and evaluation method for progressive visual cryptography. EURASIP J. Inf. Secur. 2022(1): 9 (2022) - [i1]Kohtaro Watanabe, Motonari Ohtsuka, Yuta Tsukie:
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-based McEliece Cryptosystems. IACR Cryptol. ePrint Arch. 2022: 1610 (2022) - 2021
- [j9]Kohtaro Watanabe, Ryusei Kaguchi, Toshiya Shinoda:
Shortened LDPC codes accelerate OSD decoding performance. EURASIP J. Wirel. Commun. Netw. 2021(1): 22 (2021) - 2020
- [j8]Yoshinori Kametaka, Kohtaro Watanabe, Atsushi Nagai, Kazuo Takemura, Hiroyuki Yamagishi, Hiroto Sekido:
The best constant of discrete Sobolev inequality on 1812 C60 fullerene isomers. JSIAM Lett. 12: 49-52 (2020)
2010 – 2019
- 2013
- [j7]Hiroyuki Yamagishi, Yoshinori Kametaka, Atsushi Nagai, Kohtaro Watanabe, Kazuo Takemura:
Complete low-cut filter and the best constant of Sobolev inequality. JSIAM Lett. 5: 33-36 (2013) - [j6]Hiroyuki Yamagishi, Yoshinori Kametaka, Atsushi Nagai, Kohtaro Watanabe, Kazuo Takemura:
The best estimation corresponding to continuous model of Thomson cable. JSIAM Lett. 5: 53-56 (2013) - 2012
- [j5]Hiroyuki Yamagishi, Yoshinori Kametaka, Atsushi Nagai, Kohtaro Watanabe, Kazuo Takemura:
Elliptic theta function and the best constants of Sobolev-type inequalities. JSIAM Lett. 4: 1-4 (2012) - 2011
- [j4]Kohtaro Watanabe, Hiroyuki Yamagishi, Yoshinori Kametaka:
Riemann zeta function and Lyapunov-type inequalities for certain higher order differential equations. Appl. Math. Comput. 218(7): 3950-3953 (2011) - 2010
- [j3]Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe:
Listing all the minimum spanning trees in an undirected graph. Int. J. Comput. Math. 87(14): 3175-3185 (2010)
2000 – 2009
- 2005
- [j2]Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe:
Heuristic and exact algorithms for the spanning tree detection problem. Comput. Oper. Res. 32: 239-255 (2005) - [j1]Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka:
Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math. 82(1): 23-34 (2005)
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:53 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:
