| The complexity of the optimal variable ordering problems of a shared binary decision diagram S Tani, K Hamaguchi, S Yajima IEICE TRANSACTIONS on Information and Systems 79 (4), 271-281, 1996 | 182 | 1996 |
| Quantum addition circuits and unbounded fan-out Y Takahashi, S Tani, N Kunihiro arXiv preprint arXiv:0910.2530, 2009 | 165 | 2009 |
| Claw finding algorithms using quantum walk. S Tani Theoretical Computer Science 410 (50), 5285-5297, 2009 | 146* | 2009 |
| Computing the Tutte polynomial of a graph of moderate size K Sekine, H Imai, S Tani Algorithms and Computations: 6th International Symposium, ISAAC'95 Cairns …, 1995 | 119 | 1995 |
| Exact quantum algorithms for the leader election problem S Tani, H Kobayashi, K Matsumoto ACM Transactions on Computation Theory (TOCT) 4 (1), 1-24, 2012 | 84* | 2012 |
| Impossibility of classically simulating one-clean-qubit model with multiplicative error K Fujii, H Kobayashi, T Morimae, H Nishimura, S Tamate, S Tani Physical review letters 120 (20), 200502, 2018 | 78 | 2018 |
| Multicast data communication method, multicast data communication system, repeater, repeating method, and medium for storing repeating programs S Tani, T Miyazaki, N Takahashi, T Murooka, S Ishihara, T Inoue US Patent 7,313,596, 2007 | 59 | 2007 |
| Efficient path selection for delay testing based on path clustering S Tani, M Teramoto, T Fukazawa, K Matsuhiro Journal of Electronic Testing 15, 75-85, 1999 | 57* | 1999 |
| Multicast data communication method, multicast data communication system, repeater, repeating method, and medium for storing repeating programs S Tani, T Miyazaki, N Takahashi, T Murooka, S Ishihara, T Inoue US Patent 7,986,641, 2011 | 38 | 2011 |
| Collapse of the hierarchy of constant-depth exact quantum circuits Y Takahashi, S Tani computational complexity 25, 849-881, 2016 | 35 | 2016 |
| A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs S Tani, H Imai Algorithms and Computation: 5th International Symposium, ISAAC'94 Beijing …, 1994 | 32 | 1994 |
| Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code H Yamasaki, K Fukui, Y Takeuchi, S Tani, M Koashi arXiv preprint arXiv:2006.05416, 2020 | 27 | 2020 |
| Power of quantum computation with few clean qubits K Fujii, H Kobayashi, T Morimae, H Nishimura, S Tamate, S Tani arXiv preprint arXiv:1509.07276, 2015 | 27 | 2015 |
| Adaptive stream multicast based on IP unicast and dynamic commercialattachment mechanism: An active network implementation S Tani, T Miyazaki, N Takahashi IFIP International Working Conference on Active Networks, 116-133, 2001 | 20 | 2001 |
| Reconstructing strings from substrings with quantum queries R Cleve, K Iwama, F Le Gall, H Nishimura, S Tani, J Teruyama, ... Scandinavian Workshop on Algorithm Theory, 388-397, 2012 | 18 | 2012 |
| Compression of view on anonymous networks—Folded view— S Tani IEEE Transactions on Parallel and Distributed Systems 23 (2), 255-262, 2011 | 18 | 2011 |
| Improved quantum multicollision-finding algorithm A Hosoyamada, Y Sasaki, S Tani, K Xagawa International Conference on Post-Quantum Cryptography, 350-367, 2019 | 17 | 2019 |
| Quantum algorithm for the multicollision problem A Hosoyamada, Y Sasaki, S Tani, K Xagawa Theoretical Computer Science 842, 100-117, 2020 | 14 | 2020 |
| Output-size sensitiveness of OBDD construction through maximal independent set problem K Hayase, K Sadakane, S Tani Computing and Combinatorics: First Annual International Conference, COCOON …, 1995 | 14 | 1995 |
| The quantum query complexity of certification A Ambainis, AM Childs, FL Gall, S Tani arXiv preprint arXiv:0903.1291, 2009 | 13 | 2009 |
Toshiaki MiyazakiProfessor, The University of Aizu在 u-aizu.ac.jp 的电子邮件经过验证
