Atsuki Nagao

Publication Activity (10 Years)

Years Active: 2014-2022
Publications (10 Years): 13

Top Topics

Pursuit Evasion

Voting Protocols

Top Venues

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

J. Inf. Process.

Publications

Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone
Card-Based ZKP Protocols for Takuzu and Juosan. FUN (2021)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. Theory Comput. Syst. 64 (8) (2020)
Naoki Matsumoto, Atsuki Nagao
Feedback game on Eulerian graphs. CoRR (2020)
Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi
Edge Cover Problem in a Wide Sense. J. Inf. Process. 28 (2020)
Pascal Lafourcade, Takaaki Mizuki, Atsuki Nagao, Kazumasa Shinagawa
Light Cryptography. World Conference on Information Security Education (2019)
Hiro Ito, Atsuki Nagao, Teagun Park
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Kazuo Iwama, Atsuki Nagao
Read-Once Branching Programs for Tree Evaluation Problems. ACM Trans. Comput. Theory 11 (1) (2019)
Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone
Physical Zero-Knowledge Proof for Makaro. SSS (2018)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. Algorithmica 80 (10) (2018)
Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25 (2017)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. ISAAC (2017)
Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW (2016)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. WADS (2015)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
-Sets in Bins. IEICE Trans. Inf. Syst. (10) (2015)
Kazuo Iwama, Atsuki Nagao
Read-Once Branching Programs for Tree Evaluation Problems. STACS (2014)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
Efficient Algorithms for Sorting k-Sets in Bins. WALCOM (2014)