default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWataru Kishimoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Yusuke Takimoto, Hiroyuki Sato, Hikari Takehara, Keishiro Uragaki, Takehiro Tawara, Xiao Liang, Kentaro Oku, Wataru Kishimoto, Bo Zheng:
Dressi: A Hardware-Agnostic Differentiable Renderer with Reactive Shader Packing and Soft Rasterization. Comput. Graph. Forum 41(2): 13-27 (2022)- [i2]Yusuke Takimoto, Hiroyuki Sato, Hikari Takehara, Keishiro Uragaki, Takehiro Tawara, Xiao Liang, Kentaro Oku, Wataru Kishimoto, Bo Zheng:
Dressi: A Hardware-Agnostic Differentiable Renderer with Reactive Shader Packing and Soft Rasterization. CoRR abs/2204.01386 (2022)
2010 – 2019
- 2013
- [j5]Wataru Kishimoto:
An Extension of a Balanced Flow in a Network. Electron. Notes Discret. Math. 41: 109-116 (2013) - 2011
- [c2]Wataru Kishimoto:
A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a Network. INOC 2011: 230-242
2000 – 2009
- 2008
- [j4]Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba
:
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. IEEE Trans. Inf. Theory 54(6): 2566-2571 (2008) - 2007
- [i1]Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba:
How to Derive Lower Bound on Oblivious Transfer Reduction. IACR Cryptol. ePrint Arch. 2007: 65 (2007) - 2006
- [j3]Paolo D'Arco, Wataru Kishimoto, Douglas R. Stinson:
Properties and constraints of cheating-immune secret sharing schemes. Discret. Appl. Math. 154(2): 219-233 (2006) - 2002
- [j2]Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata:
On the bound for anonymous secret sharing schemes. Discret. Appl. Math. 121(1-3): 193-202 (2002) - 2000
- [j1]Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto:
A relationship between linear complexity and kapa-error linear complexity. IEEE Trans. Inf. Theory 46(2): 694-698 (2000)
1990 – 1999
- 1998
- [c1]Yvo Desmedt, Brian King, Wataru Kishimoto, Kaoru Kurosawa:
A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group. ACISP 1998: 391-402
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-24 23:17 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:
