- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j9 |      | Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto: Exact Quantum Algorithms for the Leader Election Problem. TOCT 4(1): 1 (2012) |
| j8 | | Seiichiro Tani: Compression of View on Anonymous Networks - Folded View -. IEEE Trans. Parallel Distrib. Syst. 23(2): 255-262 (2012) |
| c16 | | Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita: Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 |
| i6 | | Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita: Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) |
| 2011 | ||
| j7 | | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani: The One-Way Communication Complexity of Subgroup Membership. Chicago J. Theor. Comput. Sci. 2011 (2011) |
| i5 | | Yasuhiro Takahashi, Seiichiro Tani: Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions. CoRR abs/1112.6063 (2011) |
| 2010 | ||
| j6 | | Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani: The quantum query complexity of certification. Quantum Information & Computation 10(3&4): 181-189 (2010) |
| j5 | | Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro: Quantum addition circuits and unbounded fan-out. Quantum Information & Computation 10(9&10): 872-890 (2010) |
| i4 | | Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani: Computing on Anonymous Quantum Network. CoRR abs/1001.5307 (2010) |
| 2009 | ||
| j4 | | Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita: Multi-Party Quantum Communication Complexity with Routed Messages. IEICE Transactions 92-D(2): 191-199 (2009) |
| j3 | | |
| j2 | | Seiichiro Tani: Claw finding algorithms using quantum walk. Theor. Comput. Sci. 410(50): 5285-5297 (2009) |
| c15 | | Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani: Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. PODC 2009: 334-335 |
| i3 | | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani: The One-Way Communication Complexity of Group Membership. CoRR abs/0902.3175 (2009) |
| i2 | | Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani: The quantum query complexity of certification. CoRR abs/0903.1291 (2009) |
| i1 | | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita: Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size. CoRR abs/0908.2468 (2009) |
| 2008 | ||
| c14 | | Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita: Multi-party Quantum Communication Complexity with Routed Messages. COCOON 2008: 180-190 |
| c13 | | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita: Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918 |
| 2007 | ||
| c12 | | |
| 2005 | ||
| c11 | | Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima: Design and Implementation of Advanced Multicast Router Based on Cluster Computing. ICPADS (1) 2005: 328-335 |
| c10 | | Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto: Exact Quantum Algorithms for the Leader Election Problem. STACS 2005: 581-592 |
| 2001 | ||
| c9 | | Seiichiro Tani, Toshiaki Miyazaki, Noriyuki Takahashi: Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation. IWAN 2001: 116-133 |
| 2000 | ||
| c8 | | Toshiaki Miyazaki, Atsushi Takahara, Shinya Ishihara, Seiichiro Tani, Takahiro Murooka, Tomoo Fukazawa, Mitsuo Teramoto, Kazuyoshi Matsuhiro: Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer. IPDPS 2000: 535-540 |
| 1999 | ||
| j1 | | Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro: Efficient Path Selection for Delay Testing Based on Path Clustering. J. Electronic Testing 15(1-2): 75-85 (1999) |
| c7 | | Atsushi Takahara, Seiichiro Tani, Shinya Ishihara, Toshiaki Miyazaki, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro: Virtual BUS: An Easy-to-Use Environment for Distributed Resources. LCN 1999: 62-70 |
| c6 | | Shinya Ishihara, Seiichiro Tani, Atsushi Takahara: Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM. PVM/MPI 1999: 461-468 |
| 1998 | ||
| c5 | | Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro: Efficient Path Selection for Delay Testing Based on Partial Path Evaluation. VTS 1998: 188-193 |
| 1995 | ||
| c4 | | Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani: Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995: 229-234 |
| c3 | | Kyoko Sekine, Hiroshi Imai, Seiichiro Tani: Computing the Tutte Polynomial of a Graph of Moderate Size. ISAAC 1995: 224-233 |
| 1994 | ||
| c2 | | Seiichiro Tani, Hiroshi Imai: A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. ISAAC 1994: 575-583 |
| 1993 | ||
| c1 | | Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima: The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. ISAAC 1993: 389-398 |
Data released under the ODC-BY 1.0 license — See also our legal information page