The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. - Seiichiro Tani; Kiyoharu Hamaguchi; Shuzo Yajima (ISAAC, 1993)

A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. - Seiichiro Tani; Hiroshi Imai (ISAAC, 1994)

Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. - Kazuyoshi Hayase; Kunihiko Sadakane; Seiichiro Tani (COCOON, 1995)

Computing the Tutte Polynomial of a Graph of Moderate Size. - Kyoko Sekine; Hiroshi Imai; Seiichiro Tani (ISAAC, 1995)

Efficient Path Selection for Delay Testing Based on Partial Path Evaluation. - Seiichiro Tani; Mitsuo Teramoto; Tomoo Fukazawa; Kazuyoshi Matsuhiro (VTS, 1998)

Virtual BUS: An Easy-to-Use Environment for Distributed Resources. - Atsushi Takahara; Seiichiro Tani; Shinya Ishihara; Toshiaki Miyazaki; Mitsuo Teramoto; Tomoo Fukazawa; Kazuyoshi Matsuhiro (LCN, 1999)

Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM. - Shinya Ishihara; Seiichiro Tani; Atsushi Takahara (PVM/MPI, 1999)

Efficient Path Selection for Delay Testing Based on Path Clustering. - Seiichiro Tani; Mitsuo Teramoto; Tomoo Fukazawa; Kazuyoshi Matsuhiro (J. Electron. Test., 1999)

Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer. - Toshiaki Miyazaki; Atsushi Takahara; Shinya Ishihara; Seiichiro Tani; Takahiro Murooka; Tomoo Fukazawa; Mitsuo Teramoto; Kazuyoshi Matsuhiro (IPDPS, 2000)

Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation. - Seiichiro Tani; Toshiaki Miyazaki; Noriyuki Takahashi (IWAN, 2001)

Design and Implementation of Advanced Multicast Router Based on Cluster Computing. - Takeru Inoue; Seiichiro Tani; Hirokazu Takahashi; Toshiaki Miyazaki; Kan Toyoshima (ICPADS (1), 2005)

An Improved Claw Finding Algorithm Using Quantum Walk. - Seiichiro Tani (MFCS, 2007)

Quantum Query Complexity of Boolean Functions with Small On-Sets. - Andris Ambainis; Kazuo Iwama; Masaki Nakanishi; Harumichi Nishimura; Rudy Raymond; Seiichiro Tani; Shigeru Yamashita (ISAAC, 2008)

Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. - Hirotada Kobayashi; Keiji Matsumoto; Seiichiro Tani (PODC, 2009)

The One-Way Communication Complexity of Group Membership - Scott Aaronson; François Le Gall; Alexander Russell; Seiichiro Tani (CoRR, 2009)

Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size - Andris Ambainis; Kazuo Iwama; Masaki Nakanishi; Harumichi Nishimura; Rudy Raymond; Seiichiro Tani; Shigeru Yamashita (CoRR, 2009)

Foreword. - Seiichiro Tani (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Multi-Party Quantum Communication Complexity with Routed Messages. - Seiichiro Tani; Masaki Nakanishi; Shigeru Yamashita (IEICE Trans. Inf. Syst., 2009)

Claw finding algorithms using quantum walk. - Seiichiro Tani (Theor. Comput. Sci., 2009)

Computing on Anonymous Quantum Network - Hirotada Kobayashi; Keiji Matsumoto; Seiichiro Tani (CoRR, 2010)

The quantum query complexity of certification. - Andris Ambainis; Andrew M. Childs; François Le Gall; Seiichiro Tani (Quantum Inf. Comput., 2010)

Quantum addition circuits and unbounded fan-out. - Yasuhiro Takahashi; Seiichiro Tani; Noboru Kunihiro (Quantum Inf. Comput., 2010)

The One-Way Communication Complexity of Subgroup Membership. - Scott Aaronson; François Le Gall; Alexander Russell; Seiichiro Tani (Chic. J. Theor. Comput. Sci., 2011)

Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions - Yasuhiro Takahashi; Seiichiro Tani (CoRR, 2011)

Reconstructing Strings from Substrings with Quantum Queries. - Richard Cleve; Kazuo Iwama; François Le Gall; Harumichi Nishimura; Seiichiro Tani; Junichi Teruyama; Shigeru Yamashita (SWAT, 2012)

Exact Quantum Algorithms for the Leader Election Problem. - Seiichiro Tani; Hirotada Kobayashi; Keiji Matsumoto (ACM Trans. Comput. Theory, 2012)

Compression of View on Anonymous Networks - Folded View -. - Seiichiro Tani (IEEE Trans. Parallel Distributed Syst., 2012)

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. - François Le Gall; Harumichi Nishimura; Seiichiro Tani (CoRR, 2013)

Simpler Exact Leader Election via Quantum Reduction. - Hirotada Kobayashi; Keiji Matsumoto; Seiichiro Tani (Chic. J. Theor. Comput. Sci., 2014)

Impossibility of Classically Simulating One-Clean-Qubit Computation. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (CoRR, 2014)

Power of Quantum Computation with Few Clean Qubits. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (ICALP, 2016)

Quantum Query Complexity of Almost All Functions with Fixed On-set Size. - Andris Ambainis; Kazuo Iwama; Masaki Nakanishi; Harumichi Nishimura; Rudy Raymond; Seiichiro Tani; Shigeru Yamashita (Comput. Complex., 2016)

Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. - Yasuhiro Takahashi; Seiichiro Tani (Comput. Complex., 2016)

Shallow Quantum Circuits with Uninitialized Ancillary Qubits. - Yasuhiro Takahashi; Seiichiro Tani (CoRR, 2016)

Commuting quantum circuits with few outputs are unlikely to be classically simulatable. - Yasuhiro Takahashi; Seiichiro Tani; Takeshi Yamazaki; Kazuyuki Tanaka (Quantum Inf. Comput., 2016)

Quantum algorithms for finding constant-sized sub-hypergraphs. - François Le Gall; Harumichi Nishimura; Seiichiro Tani (Theor. Comput. Sci., 2016)

A fast exact quantum algorithm for solitude verification. - Seiichiro Tani (Quantum Inf. Comput., 2017)

Improved Quantum Multicollision-Finding Algorithm. - Akinori Hosoyamada; Yu Sasaki; Seiichiro Tani; Keita Xagawa (IACR Cryptol. ePrint Arch., 2018)

Impossibility of blind quantum sampling for classical client. - Tomoyuki Morimae; Harumichi Nishimura; Yuki Takeuchi; Seiichiro Tani (Quantum Inf. Comput., 2019)

Efficiently generating ground states is hard for postselected quantum computation. - Yuki Takeuchi; Yasuhiro Takahashi; Seiichiro Tani (CoRR, 2020)

Quantum algorithm for the multicollision problem. - Akinori Hosoyamada; Yu Sasaki; Seiichiro Tani; Keita Xagawa (Theor. Comput. Sci., 2020)

Computational self-testing for entangled magic states. - Akihiro Mizutani; Yuki Takeuchi; Ryo Hiromasa; Yusuke Aikawa; Seiichiro Tani (IACR Cryptol. ePrint Arch., 2021)

Power of uninitialized qubits in shallow quantum circuits. - Yasuhiro Takahashi; Seiichiro Tani (Theor. Comput. Sci., 2021)

Classically simulating quantum circuits with local depolarizing noise. - Yasuhiro Takahashi; Yuki Takeuchi; Seiichiro Tani (Theor. Comput. Sci., 2021)

Space-Bounded Unitary Quantum Computation with Postselection. - Seiichiro Tani (MFCS, 2022)

Divide-and-conquer verification method for noisy intermediate-scale quantum computation. - Yuki Takeuchi; Yasuhiro Takahashi; Tomoyuki Morimae; Seiichiro Tani (Quantum, 2022)

Sumcheck-based delegation of quantum computing to rational server. - Yuki Takeuchi; Tomoyuki Morimae; Seiichiro Tani (Theor. Comput. Sci., 2022)

Approximate Degrees of Multisymmetric Properties with Application to Quantum Claw Detection. - Seiichiro Tani (CoRR, 2024)

Quantum algorithm for finding the optimal variable ordering for binary decision diagrams. - Seiichiro Tani (Theor. Comput. Sci., 2025)

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection. - Ryo Hiromasa; Akihiro Mizutani; Yuki Takeuchi; Seiichiro Tani (Theory Comput. Syst., 2025)