-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
138 lines (133 loc) · 9.5 KB
/
index.html
File metadata and controls
138 lines (133 loc) · 9.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8"/>
<meta content="width=device-width, initial-scale=1.0" name="viewport"/>
<title>Mikito Nanashima</title>
<meta content="light dark" name="color-scheme"/>
<link href="https://fonts.googleapis.com" rel="preconnect"/>
<link crossorigin="" href="https://fonts.gstatic.com" rel="preconnect"/>
<link href="https://fonts.googleapis.com/css2?family=Kaisei+Opti&family=Noto+Sans+JP:wght@400;700&family=Noto+Serif+JP:wght@400;600&display=swap" rel="stylesheet"/>
<link href="assets/style.css" rel="stylesheet"/>
</head>
<body>
<div aria-hidden="true" class="site-bg"><div aria-hidden="true" class="motif-layer"></div></div>
<header class="site-header">
<div class="header-panel">
<!--
<div aria-label="Seasonal theme" class="season-badge" id="seasonBadge">
<span class="season-name" id="seasonName">Season</span>
<span class="season-sep">•</span>
<span class="season-motif" id="seasonMotif">Birds and Flowers</span>
</div>
-->
<h1>Mikito Nanashima</h1>
<p class="header-meta">Assistant Professor, Institute of Science Tokyo • Last updated: 2026-02-02</p>
</div>
</header>
<nav>
<button aria-controls="primary-nav" aria-expanded="false" aria-label="Menu" class="menu-toggle" type="button">☰</button>
<ul id="primary-nav">
<li><a href="#about">About</a></li>
<li><a href="#research">Research</a></li>
<li><a href="#publications">Publications</a></li>
<li><a href="#projects">Fellowships & Projects</a></li>
<li><a href="#teaching">Teaching</a></li>
<li><a href="#activities">Activities</a></li>
</ul>
</nav>
<div class="container">
<section class="section" id="about">
<h2>About</h2><div class="about-grid"><div class="about-text"><p class="name-line">Name: Mikito Nanashima / <span class="name-ja" lang="ja">七島幹人</span></p><p>I am an assistant professor in the School of Computing at Institute of Science Tokyo, Japan.</p><p>
I received my Ph.D. under the supervision of Prof. Toshiya Itoh. During my undergraduate studies, I was also advised by Prof. Osamu Watanabe.<br/>
I was a visiting student at the Simons Institute for the <a href="https://simons.berkeley.edu/programs/Meta-Complexity2023">Meta-Complexity program</a>
in February and March 2023.
</p><p>To be honest, I am not very confident in my English skills. If you happen to see me at an international conference, please go easy on me 🙇</p></div><figure class="about-portrait"><div class="portrait-frame"><img alt="Portrait illustration of Mikito Nanashima" decoding="async" loading="lazy" src="assets/portrait.png"/></div><figcaption>Portrait drawn by O. Watanabe.</figcaption></figure></div>
</section>
<section class="section" id="contact">
<h2>Contact</h2>
<p>Email: nanashima at comp dot isct dot ac dot jp (replace dot and at properly)</p>
</section>
<section class="section" id="research">
<h2>Research</h2>
<ul>
<li>Theoretical Computer Science</li>
<li>Computational Complexity</li>
<li>Dichotomy between Learning and Cryptography</li>
<li>Complexity-Theoretic Inductive Inference</li>
</ul>
</section>
<section class="section" id="publications">
<h2>Publications</h2>
<p>Link: <a href="https://dblp.org/pers/hd/n/Nanashima:Mikito">[dblp]</a></p>
<p>[14] S. Hirahara and <u>M. Nanashima</u>, Complexity-Theoretic Universal Inductive Inference, in STOC2026 <a href="https://eccc.weizmann.ac.il/report/2025/092/">[full]</a>.</p>
<p>[13] S. Hirahara and <u>M. Nanashima</u>, A Sharp Characterization of Pessiland, in STOC2026 <a href="https://eccc.weizmann.ac.il/report/2026/052/">[full]</a>.</p>
<p>[12] S. Hirahara, Z. Lu, and <u>M. Nanashima</u>, Optimal Coding for Randomized Kolmogorov Complexity and Its Applications, in FOCS2024 <a href="https://arxiv.org/pdf/2409.12744">[full]</a>.</p>
<p>[11] S. Hirahara and <u>M. Nanashima</u>, One-Way Functions and Zero Knowledge, in STOC2024 <a href="https://eccc.weizmann.ac.il/report/2024/063/">[full]</a>.</p>
<p>[10] S. Hirahara and <u>M. Nanashima</u>, Learning in Pessiland via Inductive Inference, in FOCS2023 <a href="https://eccc.weizmann.ac.il/report/2023/100/">[full]</a>.</p>
<p>[9] S. Hirahara, R. Ilango, Z. Lu, <u>M. Nanashima</u>, and I. C. Oliveira, A Duality Between One-Way Functions and Average-Case Symmetry of Information, in STOC2023 <a href="https://eccc.weizmann.ac.il/report/2023/035/">[full]</a>.</p>
<p>[8] S. Hirahara and <u>M. Nanashima</u>, Learning versus Pseudorandom Generators in Constant Parallel Time, in ITCS2023 <a href="https://eccc.weizmann.ac.il/report/2022/164/">[full]</a>.</p>
<p>[7] S. Hirahara and <u>M. Nanashima</u>, Finding Errorless Pessiland in Error-Prone Heuristica, in CCC2022 <a href="https://drops.dagstuhl.de/opus/volltexte/2022/16587/pdf/LIPIcs-CCC-2022-25.pdf">[proc]</a>.</p>
<p>[6] S. Hirahara and <u>M. Nanashima</u>, On Worst-Case Learning in Relativized Heuristica, in FOCS2021 <a href="https://eccc.weizmann.ac.il/report/2021/161/">[full]</a>.</p>
<p>[5] <u>M. Nanashima</u>, A Theory of Heuristic Learnability, in COLT2021 <a href="http://proceedings.mlr.press/v134/nanashima21a/nanashima21a.pdf">[proc]</a>.</p>
<p>[4] <u>M. Nanashima</u>, Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions, in ITCS2021 <a href="https://drops.dagstuhl.de/opus/volltexte/2021/13568/">[proc]</a> <a href="https://eccc.weizmann.ac.il/report/2020/095/">[full]</a>.</p>
<p>[3] <u>M. Nanashima</u>, Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning, in COLT2020 <a href="src/nanashima20Main.pdf">[proc]</a>.</p>
<p>[2] <u>M. Nanashima</u>, A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields, in ALT2020 <a href="http://proceedings.mlr.press/v117/nanashima20a.html">[proc]</a>. (M.Sc. thesis)</p>
<p>[1] <u>M. Nanashima</u>, Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning, in IWOCA2018 <a href="https://link.springer.com/chapter/10.1007/978-3-319-94667-2_24">[proc]</a>. (B.Sc. thesis)</p>
</section>
<section class="section" id="projects">
<h2>Fellowships & Projects</h2>
<h3>Principal Investigator</h3>
<p>2024.10 - 2027.3 JST ACT-X NextAI Math Info, Computational Complexity of Learning and Compression.</p>
<p>2023.9 - 2025.3 JSPS Grant-in-Aid for Research Activity Start-up, A Study on Breaking and Avoiding Relativization Barriers against Constructing One-Way Functions.</p>
<p>2019.10 - 2022.3 JST ACT-X Math. and Info., Research on Difficulty of Proving Efficient Learnability.</p>
<p>2020.4 - 2021.3 Tokyo Tech Tsubame Scholarship for Doctoral Students.</p>
<p>2021.4 - 2023.3 JSPS Research Fellowship for Young Scientists (DC2).</p>
<h3>Co-Investigator</h3>
<p>2024.4 - Now JSPS Grant-in-Aid for Challenging Research (Pioneering), Average-Case NP-Completeness Theory via Meta-Complexity.</p>
<p>2023.4 - Now JSPS Grant-in-Aid for Scientific Research (A), Theoretical Foundations of Resource-Bounded Quantum Computation.</p>
<h3>Prize</h3>
<p>The 13th JSPS Ikushi Prize <a href="https://www.jsps.go.jp/english/e-ikushi-prize/index.html">[link]</a>.</p>
</section>
<section class="section" id="teaching">
<h2>Teaching</h2>
<h3>Instructor</h3>
<p>2023-, Programming I (co-instructed with Ken Wakita)</p>
<h3>TA</h3>
<p>2018, 19, 22, Introduction to Algorithms and Data Structures</p>
<p>2018, 19, Information Literacy I</p>
<p>2018, Programming I</p>
<p>2018, Information Literacy II</p>
</section>
<section class="section" id="activities">
<h2>Activities</h2>
<h3>Talks (except for invited talks on the aforementioned papers)</h3>
<p>Learning versus Cryptography (in Japanese), in Final Lecture and Workshop of Prof. Osamu Watanabe @ Science Tokyo, 2025, March.</p>
<p>Universal Extrapolation, in the EnCORE Workshop on Meta-Complexity as the Bridge Between Learning and Cryptography @ UC Sandiego (EnCORE Institute), 2025, February.</p>
<p>Math on Difficulties of Computation (in Japanese) @ Tokyo Tech Open Campus, 2023, August <a href="https://youtu.be/FGy8qAXNkqk?si=joSo3gTnDuMPT0pS">[recorded video]</a>. (aimed at high school students in Japan)</p>
<p>Kolmogorov Complexity and its Algorithmic and Cryptographic Benefits (in Japanese), in Workshop on Mathematics of Next-Generation Cryptography for Secure Utilization of Quantum Information @ Kyushu Univ. (hybrid), 2022, August.</p>
<p>Hardness of Learning, Auxiliary-Input Cryptography, and Meta-Complexity (in Japanese), in the seminar for International Research Unit of Quantum Information @ Kyoto Univ. (zoom), 2021, July.</p>
<p>A Story of Computation, Cryptography, and the Gaps (in Japanese), in the course of "Literacy of Computing" @ Tokyo Tech., 2020, 2021.</p>
<h3>External Reviews</h3>
<p>Conferences: RANDOM2021, STACS2022, CSR2022, CCC2022, ISAAC2022, STOC2023, CCC2023, FOCS2023, and more...</p>
<p>Journal: SICOMP, TCS, TheoretiCS, Computational Complexity, and more...</p>
</section>
</div>
<footer>
<!--
<details class="season-switcher">
<summary><span id="seasonSummary">Theme: Auto</span></summary>
<div aria-label="Choose seasonal theme" class="season-buttons" role="group">
<button class="season-btn" data-set-season="auto" type="button">Auto</button>
<button class="season-btn" data-set-season="spring" type="button">Spring</button>
<button class="season-btn" data-set-season="summer" type="button">Summer</button>
<button class="season-btn" data-set-season="autumn" type="button">Autumn</button>
<button class="season-btn" data-set-season="winter" type="button">Winter</button>
</div>
</details>
-->
<p class="footer-note">Theme changes automatically with the season. <span class="footer-current">(Current: <span id="seasonCurrent">Season</span>)</span></p>
</footer>
<script defer="" src="assets/site.js"></script>
</body>
</html>