default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuo Iwama
- > Home > Persons > Kazuo Iwama
Publications
- 2016
[j89]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura
, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Comput. Complex. 25(4): 723-735 (2016)- 2013
- [j71]Kazuo Iwama, Harumichi Nishimura:
Recovering Strings in Oracles: Quantum and Classic. Int. J. Found. Comput. Sci. 24(7): 979-994 (2013) - 2012
- [j68]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum counterfeit coin problems. Theor. Comput. Sci. 456: 51-64 (2012) - [c107]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 - [i15]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) - 2010
- [c99]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. ISAAC (1) 2010: 85-96 - [i13]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. CoRR abs/1009.0416 (2010) - 2009
- [i12]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size. CoRR abs/0908.2468 (2009) - 2008
- [c95]Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282 - [c94]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918 - 2007
- [c85]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121 - [c84]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error Classical and Quantum Communication Complexity. ISAAC 2007: 100-111 - [c80]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita:
Quantum Network Coding. STACS 2007: 610-621 - 2006
- [c74]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
(4, 1)-Quantum Random Access Coding Does Not Exist. ISIT 2006: 446-450 - [i6]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Quantum Network Coding. Complexity of Boolean Functions 2006
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-08-27 22: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:
