Nagao Atsuki

ナガオアツキ | Nagao Atsuki

Affiliation and department：
Homepage URL (1)： https://sites.google.com/view/a-nagao/

Research field (1)： Information theory

Research keywords (4)： Discrete Optimization , Satisfiability Problem , Algorithms , Computational Complexity

Research theme for competitive and other funds (3)：

Papers (15)：

MAKITA Tomu, NAGAO Atsuki, OKADA Tatsuki, SETO Kazuhisa, TERUYAMA Junichi. A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2022. E105.A. 9. 1298-1308
Daiki Miyahara, Leo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone. Card-Based ZKP Protocols for Takuzu and Juosan. 10th International Conference on Fun with Algorithms. 2020
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama. Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. Theory of Computing Systems. 2020
Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi. K3 Edge Cover Problem in a Wide Sense. Journal of Information Processing. 2020. 28. 849-858
Pascal Lafourcade, Takaaki Mizuki, Atsuki Nagao, Kazumasa Shinagawa. Light Cryptography. 12th World Conference on Information Security Education. 2019

ｍore...

MISC (3)：

SETO KAZUHISA, TERUYAMA JUN'ICHI, TERUYAMA JUN'ICHI, NAGAO ATSUKI, NAGAO ATSUKI. 線形サイズk-IBDD充足可能性問題に対する厳密アルゴリズム. 情報処理学会研究報告(Web). 2015. 2015. AL-152. VOL.2015-AL-152,NO.1 (WEB ONLY)
脊戸和寿, 照山順一, 長尾篤樹. k-IBDD充足可能性問題に対する厳密アルゴリズム. 情報処理学会研究報告. AL, アルゴリズム研究会報告. 2014. 2014. 9. 1-6
SETO Kazuhisa, TERUYAMA Junichi, NAGAO Atsuki. Efficient Algorithms for Sorting k-Sets in Bins. IEICE technical report. Theoretical foundations of Computing. 2013. 113. 371. 81-85

Lectures and oral presentations (11)：

Dance Dance Revolution における交互踏み可能性と捻り・回転数最小問題について
(LAシンポジウム2019 夏のLA 2019)
PSPACE-completeness for Snakebird
(The 21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2018) 2018)
Satisfiability Algorithm for Read k-times Branching Programs.
(28th International Symposium on Algorithms and Computation, ISAAC 2017 2017)
K_3 edge cover in a wide sense.
(The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017) 2017)
A Superpolynomial Lower Bound for Restricted Branching Programs Solving Tree Evaluation Problems.
(IEICE General Conference 2017)

ｍore...

Education (3)：

2012 - 2015 Kyoto University Graduate School of Informatics Department of Communications and Computer Engineering, Ph.D. course
2010 - 2012 Kyoto University Graduate School of Informatics Department of Communications and Computer Engineering, Master course
2004 - 2010 Kyoto University Undergraduate School of Informatics and Mathematical Science

Professional career (1)：

Work history (6)：

2022/04 - 現在 Ochanomizu University Faculty of Core Research Natural Science Division Lecturer
2018/04 - 2022/03 Ochanomizu University Faculty of Core Research Natural Science Division Assistant Perofessor
2017/04 - 2018/03 Seikei University Faculty of Science and Technology Assistant Perofessor
2015/04 - 2017/03 The University of Electro-Communications School of Informatics and Engineering Project Researcher
2014/04 - 2015/03 Japan Society for the Promotion of Science, DC2 research fellow

Show all

Committee career (3)：

2019/06 - 2023/06 電子情報通信学会英文論文誌D編集委員会編集委員
2018 - 2018 International Conference on Fun with Algorithms (FUN 2018) Organizing Committee
2016 - 2017 Japan Conference on Discrete and Computational Geometry, Graphs, and Games: JCDCG^3 Organizing Committee

Awards (2)：

2013/03 - The Institute of Electronics, Information and Communication Engineers Young Researcher’s Award
2012/03 - IEICE Technical Committee on Theoretical Foundations of Computing Best student paper award

Association Membership(s) (1)：

THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page