default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuuki Tanaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Jianglin Wei
, Anna Kuwana, Haruo Kobayashi, Kazuyoshi Kubo, Yuuki Tanaka:
Floating-Point Inverse Square Root Algorithm Based on Taylor-Series Expansion. IEEE Trans. Circuits Syst. II Express Briefs 68(7): 2640-2644 (2021)- [c4]Jianglin Wei, Anna Kuwana, Haruo Kobayashi, Kazuyoshi Kubo, Yuuki Tanaka:
Floating-Point Square Root Calculation Algorithm Based on Taylor-Series Expansion and Region Division. MWSCAS 2021: 774-778 - 2020
- [j13]Yuuki Tanaka, Yuuki Suzuki, Shugang Wei:
Novel Binary Signed-Digit Addition Algorithm for FPGA Implementation. J. Circuits Syst. Comput. 29(9): 2050136:1-2050136:8 (2020)
2010 – 2019
- 2018
- [c3]Yuuki Tanaka, Yoshihiro Yamashita, Kiyoshi Nishikawa, Toru Yamaguchi, Takao Nishitani:
Retinex Foreground Segmentation for Low Light Environments. APSIPA 2018: 285-290 - 2016
- [j12]Yuuki Tanaka:
On the Stack Number and the Queue Number of the Bubble-Sort Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1012-1018 (2016) - [j11]Yuuki Tanaka:
Efficient signed-digit-to-canonical-signed-digit recoding circuits. Microelectron. J. 57: 21-25 (2016) - 2014
- [j10]Yuuki Tanaka, Shugang Wei:
Efficient squaring circuit using canonical signed-digit number representation. IEICE Electron. Express 11(2): 20130955 (2014) - [j9]Tamaki Nakajima, Yuuki Tanaka, Toru Araki:
Twin Domination Problems in Round Digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1192-1199 (2014) - 2010
- [j8]Yuuki Tanaka, Yukio Shibata:
The Cayley digraph associated to the Kautz digraph. Ars Comb. 94 (2010) - [j7]Yuuki Tanaka, Yosuke Kikuchi, Toru Araki, Yukio Shibata:
Bipancyclic properties of Cayley graphs generated by transpositions. Discret. Math. 310(4): 748-754 (2010) - [j6]Yuuki Tanaka, Yukio Shibata:
On the Pagenumber of the Cube-Connected Cycles. Math. Comput. Sci. 3(1): 109-117 (2010)
2000 – 2009
- 2009
- [j5]Yuuki Tanaka, Yukio Shibata:
A note on the k-degree Cayley graph. Networks 54(1): 20-22 (2009) - [c2]Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, Shingo Osawa, Yukio Shibata:
Broadcasting Multiple Messages Using Cycle-Rooted Trees. PDCAT 2009: 524-529 - 2008
- [j4]Haruaki Onishi, Yuuki Tanaka, Yukio Shibata:
Dihedral Butterfly Digraph and Its Cayley Graph Representation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(2): 613-622 (2008) - [c1]Yuuki Tanaka, Yukio Shibata:
On the pagenumber of the cube-connected cycles. IWOCA 2008: 155-165 - 2007
- [j3]Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata:
Isomorphic factorization, the Kronecker product and the line digraph. Inf. Process. Lett. 101(2): 72-77 (2007) - 2006
- [j2]Yuuki Tanaka, Yukio Shibata:
On the pagenumber of trivalent Cayley graphs. Discret. Appl. Math. 154(8): 1279-1292 (2006) - [j1]Yuuki Tanaka, Yukio Shibata:
A Minimum Feedback Vertex Set in the Trivalent Cayley Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1269-1274 (2006)
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:58 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:
