| 2022 | MFCS | Space-Bounded Unitary Quantum Computation with Postselection. | Seiichiro Tani |
| 2020 | MFCS | Classically Simulating Quantum Circuits with Local Depolarizing Noise. | Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani |
| 2020 | TAMC | Sumcheck-Based Delegation of Quantum Computing to Rational Server. | Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani |
| 2019 | PQCrypto | Improved Quantum Multicollision-Finding Algorithm. | Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa |
| 2018 | STACS | Power of Uninitialized Qubits in Shallow Quantum Circuits. | Yasuhiro Takahashi, Seiichiro Tani |
| 2016 | ICALP | Power of Quantum Computation with Few Clean Qubits. | Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani |
| 2015 | COCOON | Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. | Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka |
| 2014 | COCOON | Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. | Franois Le Gall, Harumichi Nishimura, Seiichiro Tani |
| 2009 | PODC | Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. | Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani |
| 2008 | COCOON | Multi-party Quantum Communication Complexity with Routed Messages. | Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita |
| 2008 | ISAAC | Quantum Query Complexity of Boolean Functions with Small On-Sets. | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita |
| 2007 | MFCS | An Improved Claw Finding Algorithm Using Quantum Walk. | Seiichiro Tani |
| 2005 | ICPADS | Design and Implementation of Advanced Multicast Router Based on Cluster Computing. | Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima |
| 2005 | STACS | Exact Quantum Algorithms for the Leader Election Problem. | Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto |
| 1999 | LCN | Virtual BUS: An Easy-to-Use Environment for Distributed Resources. | Atsushi Takahara, Seiichiro Tani, Shinya Ishihara, Toshiaki Miyazaki, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro |
| 1998 | VTS | Efficient Path Selection for Delay Testing Based on Partial Path Evaluation. | Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro |
| 1995 | COCOON | Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. | Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani |
| 1995 | ISAAC | Computing the Tutte Polynomial of a Graph of Moderate Size. | Kyoko Sekine, Hiroshi Imai, Seiichiro Tani |
| 1994 | ISAAC | A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. | Seiichiro Tani, Hiroshi Imai |
| 1993 | ISAAC | The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. | Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima |