default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikito Nanashima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima:
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. FOCS 2024: 369-378- [c11]Shuichi Hirahara
, Mikito Nanashima:
One-Way Functions and Zero Knowledge. STOC 2024: 1731-1738 - [i10]Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima:
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. CoRR abs/2409.12744 (2024) - [i9]Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima:
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. Electron. Colloquium Comput. Complex. TR24 (2024) - [i8]Shuichi Hirahara, Mikito Nanashima:
One-Way Functions and Zero Knowledge. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c10]Shuichi Hirahara, Mikito Nanashima:
Learning in Pessiland via Inductive Inference. FOCS 2023: 447-457 - [c9]Shuichi Hirahara, Mikito Nanashima:
Learning Versus Pseudorandom Generators in Constant Parallel Time. ITCS 2023: 70:1-70:18 - [c8]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC 2023: 1039-1050 - [i7]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. Electron. Colloquium Comput. Complex. TR23 (2023) - [i6]Shuichi Hirahara, Mikito Nanashima:
Learning in Pessiland via Inductive Inference. Electron. Colloquium Comput. Complex. TR23 (2023) - [i5]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. IACR Cryptol. ePrint Arch. 2023: 424 (2023) - 2022
- [c7]Shuichi Hirahara, Mikito Nanashima:
Finding Errorless Pessiland in Error-Prone Heuristica. CCC 2022: 25:1-25:28 - [i4]Shuichi Hirahara, Mikito Nanashima:
Learning versus Pseudorandom Generators in Constant Parallel Time. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c6]Mikito Nanashima:
A Theory of Heuristic Learnability. COLT 2021: 3483-3525 - [c5]Shuichi Hirahara, Mikito Nanashima:
On Worst-Case Learning in Relativized Heuristica. FOCS 2021: 751-758 - [c4]Mikito Nanashima:
On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions. ITCS 2021: 29:1-29:15 - [i3]Shuichi Hirahara, Mikito Nanashima:
On Worst-Case Learning in Relativized Heuristica. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c3]Mikito Nanashima:
A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields. ALT 2020: 660-686 - [c2]Mikito Nanashima:
Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning. COLT 2020: 2998-3029 - [i2]Mikito Nanashima:
On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [i1]Mikito Nanashima:
A Faster Algorithm Enumerating Relevant Features over Finite Fields. CoRR abs/1903.06412 (2019) - 2018
- [c1]Mikito Nanashima:
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning. IWOCA 2018: 285-297
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 2025-01-21 00:13 CET 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:
