Seiichiro Tani
Seiichiro Tani
NTT Communication Science Laboratories
Bestätigte E-Mail-Adresse bei hco.ntt.co.jp
Titel
Zitiert von
Zitiert von
Jahr
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
1691996
Quantum addition circuits and unbounded fan-out
Y Takahashi, S Tani, N Kunihiro
arXiv preprint arXiv:0910.2530, 2009
882009
Computing the Tutte polynomial of a graph of moderate size
K Sekine, H Imai, S Tani
International Symposium on Algorithms and Computation, 224-233, 1995
871995
Claw finding algorithms using quantum walk.
S Tani
Theoretical Computer Science 410 (50), 5285-5297, 2009
77*2009
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
59*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
552007
Efficient path selection for delay testing based on path clustering
S Tani, M Teramoto, T Fukazawa, K Matsuhiro
Journal of Electronic Testing 15 (1-2), 75-85, 1999
51*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
451998
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
442018
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
352011
A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs
S Tani, H Imai
International Symposium on Algorithms and Computation, 575-583, 1994
331994
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
212015
Collapse of the hierarchy of constant-depth exact quantum circuits
Y Takahashi, S Tani
computational complexity 25 (4), 849-881, 2016
192016
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
192001
Compression of view on anonymous networks—Folded view—
S Tani
IEEE Transactions on Parallel and Distributed Systems 23 (2), 255-262, 2011
142011
Output-size sensitiveness of OBDD construction through maximal independent set problem
K Hayase, K Sadakane, S Tani
International Computing and Combinatorics Conference, 229-234, 1995
131995
Wide-area multicasting based on flexcast: Toward the ubiquitous network
T Inoue, S Tani, K Ishimaru, S Minato, T Miyazaki
Proc. APSITT 3, 301-306, 2003
112003
Design and implementation of advanced multicast router based on cluster computing
T Inoue, S Tani, H Takahashi, S Minato, T Miyazaki, K Toyoshima
11th International Conference on Parallel and Distributed Systems (ICPADS'05 …, 2005
102005
The quantum query complexity of certification
A Ambainis, AM Childs, FL Gall, S Tani
arXiv preprint arXiv:0903.1291, 2009
92009
Quantum query complexity of boolean functions with small on-sets
A Ambainis, K Iwama, M Nakanishi, H Nishimura, R Raymond, S Tani, ...
International Symposium on Algorithms and Computation, 907-918, 2008
72008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20