長尾篤樹, Atsuki Nagao
長尾篤樹, Atsuki Nagao
Assistant Professor of Ochanomizu University
確認したメール アドレス: is.ocha.ac.jp - ホームページ
タイトル
引用先
引用先
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
232016
Fast two-dimensional potential measurement at the thermal barrier region of the tandem mirror GAMMA 10
N Kikuno, K Ishii, N Ishibashi, M Nagasaki, Y Katsuki, T Goto, Y Goi, ...
Review of scientific instruments 70 (11), 4251-4259, 1999
151999
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
112018
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
72018
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
62017
Characteristics of 63.6° cylindrical energy analyzer used as charge exchange neutral particle analyzer
T Goto, K Ishii, A Nagao, Y Goi, Y Katsuki, N Kikuno, N Ishibashi, Y Ono, ...
Review of scientific instruments 70 (6), 2661-2664, 1999
31999
Satisfiability algorithm for syntactic read-k-times branching programs
A Nagao, K Seto, J Teruyama
Theory of Computing Systems, 1-16, 2020
12020
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
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
IET Digital Library, 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
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
Feedback game on Eulerian graphs
N Matsumoto, A Nagao
arXiv preprint arXiv:2002.09570, 2020
2020
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable
H Ito, A Nagao, T Park
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2019
2019
Light Cryptography
P Lafourcade, T Mizuki, A Nagao, K Shinagawa
IFIP World Conference on Information Security Education, 89-101, 2019
2019
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
M Babenko, S Artamonov, R Takhanov, A Nagao, K Seto, J Teruyama, ...
2017
2 種類のアイテムに限定した物理的バケットソート
長尾篤樹, 吉澤修平, 伊藤大雄
電子情報通信学会技術研究報告= IEICE technical report: 信学技報 116 (262), 23-27, 2016
2016
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20