Follow
Seiichiro Tani
Seiichiro Tani
NTT Communication Science Laboratories
Verified email at hco.ntt.co.jp
Title
Cited by
Cited by
Year
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
1771996
Quantum addition circuits and unbounded fan-out
Y Takahashi, S Tani, N Kunihiro
arXiv preprint arXiv:0910.2530, 2009
1372009
Claw finding algorithms using quantum walk.
S Tani
Theoretical Computer Science 410 (50), 5285-5297, 2009
125*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
1101995
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
682018
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
67*2012
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
582007
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
55*1999
Efficient path selection for delay testing based on partial path evaluation
S Tani, M Teramoto, T Fukazawa, K Matsuhiro
Proceedings. 16th IEEE VLSI Test Symposium (Cat. No. 98TB100231), 188-193, 1998
471998
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
372011
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
351994
Collapse of the hierarchy of constant-depth exact quantum circuits
Y Takahashi, S Tani
computational complexity 25, 849-881, 2016
292016
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
262015
Adaptive Stream Multicast Based on IP Unicast and Dynamic CommercialAttachment Mechanism: An Active Network Implementation
S Tani, T Miyazaki, N Takahashi
Active Networks: IFIP-TC6 Third International Working Conference, IWAN 2001 …, 2001
222001
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
192020
Compression of view on anonymous networks—Folded view—
S Tani
IEEE Transactions on Parallel and Distributed Systems 23 (2), 255-262, 2011
162011
Output-size sensitiveness of OBDD construction through maximal independent set problem
K Hayase, K Sadakane, S Tani
Lecture Notes in Computer Science 959 (229-234), 67, 1995
161995
Improved quantum multicollision-finding algorithm
A Hosoyamada, Y Sasaki, S Tani, K Xagawa
Post-Quantum Cryptography: 10th International Conference, PQCrypto 2019 …, 2019
132019
Reconstructing strings from substrings with quantum queries
R Cleve, K Iwama, F Le Gall, H Nishimura, S Tani, J Teruyama, ...
Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012
122012
The quantum query complexity of certification
A Ambainis, AM Childs, FL Gall, S Tani
arXiv preprint arXiv:0903.1291, 2009
112009
The system can't perform the operation now. Try again later.
Articles 1–20