長尾篤樹, Atsuki Nagao
長尾篤樹, Atsuki Nagao
Assistant Professor of Ochanomizu University
Verified email at is.ocha.ac.jp - Homepage
Title
Cited by
Cited by
Year
Physical zero-knowledge proof for Makaro
X Bultel, J Dreier, JG Dumas, P Lafourcade, D Miyahara, T Mizuki, ...
International Symposium on Stabilizing, Safety, and Security of Distributedá…, 2018
292018
A much faster branch-and-bound algorithm for finding a maximum clique
E Tomita, K Yoshida, T Hatta, A Nagao, H Ito, M Wakatsuki
International Workshop on Frontiers in Algorithmics, 215-226, 2016
282016
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 2020), 2020
212020
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
112017
A moderately exponential time algorithm for k-IBDD satisfiability
A Nagao, K Seto, J Teruyama
Algorithmica 80 (10), 2725-2741, 2018
82018
Topological graph description of multicellular dynamics based on vertex model
A Hashimoto, A Nagao, S Okuda
Journal of theoretical biology 437, 187-201, 2018
82018
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable
H Ito, A Nagao, T Park
IEICE Transactions on Fundamentals of Electronics, Communications andá…, 2019
22019
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
A Nagao, K Seto, J Teruyama
Theory of Computing Systems 64 (8), 1392-1407, 2020
12020
Feedback game on Eulerian graphs
N Matsumoto, A Nagao
arXiv preprint arXiv:2002.09570, 2020
12020
Read-once branching programs for tree evaluation problems
K Iwama, A Nagao
ACM Transactions on Computation Theory (TOCT) 11 (1), 1-12, 2018
12018
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
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
2022
Card-based ZKP protocols for Takuzu and Juosan
P Lafourcade, D Miyahara, T Mizuki, A Nagao, H Sone, L Robert, ...
In 10th International Conference on Fun with Algorithms (FUN), 2020
2020
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
2020
Light Cryptography
P Lafourcade, T Mizuki, A Nagao, K Shinagawa
IFIP World Conference on Information Security Education, 89-101, 2019
2019
Physical Bucket Sort with Restricted take Operations
A Nagao, W Wu, H Ito
IEICE Technical Report; IEICE Tech. Rep. 117 (370), 119-122, 2017
2017
K_3 edge cover problem in a wide sense
K Chiba, R Belmonte, H Ito, A Nagao
IEICE Technical Report; IEICE Tech. Rep. 117 (176), 47-55, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20