Follow
Atsuki Nagao
Title
Cited by
Cited by
Year
Physical zero-knowledge proof for Makaro
X Bultel, J Dreier, JG Dumas, P Lafourcade, D Miyahara, T Mizuki, ...
Stabilization, Safety, and Security of Distributed Systems: 20th …, 2018
592018
Card-based ZKP protocols for Takuzu and Juosan
D Miyahara, L Robert, P Lafourcade, S Takeshige, T Mizuki, K Shinagawa, ...
10th International Conference on Fun with Algorithms (FUN 2021), 2020
482020
A much faster branch-and-bound algorithm for finding a maximum clique
E Tomita, K Yoshida, T Hatta, A Nagao, H Ito, M Wakatsuki
Frontiers in Algorithmics: 10th International Workshop, FAW 2016, Qingdao …, 2016
412016
A much faster algorithm for finding a maximum clique with computational experiments
E Tomita, S Matsuzaki, A Nagao, H Ito, M Wakatsuki
Journal of Information Processing 25, 667-677, 2017
172017
Topological graph description of multicellular dynamics based on vertex model
A Hashimoto, A Nagao, S Okuda
Journal of theoretical biology 437, 187-201, 2018
142018
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
A Nagao, K Seto, J Teruyama
Algorithmica 80, 2725-2741, 2018
92018
Light cryptography
P Lafourcade, T Mizuki, A Nagao, K Shinagawa
Information Security Education. Education in Proactive Information Security …, 2019
52019
Generalized shogi, chess, and xiangqi are constant-time testable
H Ito, A Nagao, T Park
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2019
42019
Read-once branching programs for tree evaluation problems
K Iwama, A Nagao
ACM Transactions on Computation Theory (TOCT) 11 (1), 1-12, 2018
42018
Sublinear computation paradigm: algorithmic revolution in the big data era
N Katoh, Y Higashikawa, H Ito, A Nagao, T Shibuya, A Sljoka, K Tanaka, ...
Springer Nature, 2022
32022
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
A Nagao, K Seto, J Teruyama
Theory of Computing Systems 64, 1392-1407, 2020
32020
Feedback game on eulerian graphs
N Matsumoto, A Nagao
arXiv preprint arXiv:2002.09570, 2020
22020
Sublinear Computation Paradigm
Y Higashikawa, H Ito, A Nagao, T Shibuya, A Sljoka, K Tanaka, Y Uno
Springer Open Access, 2022
12022
k3 edge cover problem in a wide sense
K Chiba, R Belmonte, H Ito, M Lampis, A Nagao, Y Otachi
Journal of Information Processing 28, 849-858, 2020
12020
Card-based ZKP protocols for Takuzu and Juosan
P Lafourcade, D Miyahara, T Mizuki, A Nagao, H Sone, L Robert, ...
Conference on Fun with Algorithms, FUN, 2020
12020
Efficient Algorithms for Sorting k-Sets in Bins
A Nagao, K Seto, J Teruyama
IEICE TRANSACTIONS on Information and Systems 98 (10), 1736-1743, 2015
12015
Generalized shogi and chess are constant-time testable
H Ito, A Nagao, T Park
12th International Symposium on Operations Research and its Applications in …, 2015
12015
k-IBDD充足可能性問題に対する厳密アルゴリズム
脊戸和寿, 照山順一, 長尾篤樹
研究報告アルゴリズム (AL) 2014 (9), 1-6, 2014
12014
Read-Once Branching Programs for Tree Evaluation Problems
K Iwama, A Nagao
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
12014
Feedback Game on Eulerian Graphs: Discrete and Computational Geometry, Graphs, and Games
N Matsumoto, A Nagao
Thai Journal of Mathematics 21 (4), 751–768-751–768, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20