[English/Japanese]

Department of Information Science, Nihon University.

Papers of Seiichi TANI

Refereed papers

• Kazuhiro Ichihara, Yuya Nishimura, Seiichi Tani: The Computational Complexity of Classical Knot Recognition, Journal of Knot Theory and Its Ramifications, October 2023.
  DOI: https://doi.org/10.1142/S0218216523500694
• Matsuzawa Y., Murata K., Tani S.: Multivocal Challenge Toward Measuring Computational Thinking, in: Passey D., Bottino R., Lewin C., Sanchez E. (eds) Empowering Learners for Life in the Digital Age. OCCE 2018. IFIP Advances in Information and Communication Technology, 2019, vol. 524, pp. 56 - 66. Springer, Cham (revised selected paper at WCCE2018).
  DOI: 10.1007/978-3-030-23513-0_6
• Hiroki Manabe, Seiichi Tani, Susumu Kanemune, Yoshiki Manabe: Creating the Original Bebras Tasks by High School Students, OLYMPIADS IN INFORMATICS, 2018, Vol. 12, pp. 99 - 110
  DOI: 10.15388/ioi.2018.08
• Susumu Kanemune, Shizuka Shirai, Seiichi Tani: Informatics and Programming Education at Primary and Secondary Schools in Japan, OLYMPIADS IN INFORMATICS, 2017, Vol. 11, pp. 143 - 150
  DOI: 10.15388/ioi.2017.11
• Masahiko Murakami, Fumio Takeshita and Seiichi Tani: Computing HOMFLY polynomials of 2-bridge links from 4-plat representation, Discrete Applied Mathematics, Volume 162, pp.271-284 (2014).
  DOI: 10.1016/j.dam.2013.08.023
• Hiroshi Toyoizumi, Seiichi Tani, Naoto Miyoshi and Yoshio Okamoto: " Reverse preferential spread in complex networks", Physical Review E, Volume 86, Issue 021103 (2012).
  DOI: 10.1103/PhysRevE.86.021103
• Masao Hara, Masahiko Murakami, Seiichi Tani and Makoto Yamamoto: Fast Algorithms for Computing Jones Polynomials of Montesinos Links, Scientiae Mathematicae Japonicae, Vol. 69, No. 1 (Whole No. 253), pp.1-26 (2009).
• Seiichi Tani and Etsuro Moriya: Japanese Olympiad in Informatics, Olympiads in informatics, Vol. 2, pp.163-170 (2008).
• Masahiko Murakami, Masao Hara, Makoto Yamamoto and Seiichi Tani: Fast Algorithms for Computing Jones Polynomials of Certain Links, Theoretical Computer Science, vol.374 (2007) pages 1-24.
  DOI: 10.1016/j.tcs.2006.11.012
• Takayuki Nagoya, Sei'ichi Tani and Seinosuke Toda: A Polynomial-Time Algorithms for Counting Graph Isomorphisms among Partial k-Trees (in Japanese). IEICE Transactions, Vol.J85-D-I:424-435, No.5, 2002.
• Koichi Yamazaki, Sei'ichi Tani and Tetsuro Nishino: A Characterization of k-th Powers P_n^k of Paths in Terms of k-Trees. International Journal of Foundation on Computer Science, 12(4):435-444, 2001.
  DOI: 10.1142/S0129054101000576
• Masao Hara, Sei'ichi Tani and Makoto Yamamoto: Degrees of the Jones polynomials of certain pretzel links, Journal of Knot Theory and Its Ramifications, Vol. 9, No.7 (2000) pp.907--916.
  DOI: 10.1142/S0218216500000529
• Yoshiyasu Ishigami and Sei'ichi Tani: VC-dimensions of finite automata and commutative finite automata with k letters and n states. Discrete Applied Mathematics, (74)2:123-134, 1997.
  DOI: 10.1016/S0166-218X(96)00025-X
• Seiichi Tani: On the Role of Equivalence Queries in Learning via Queries. IEICE Transaction on Information and Systems, Vol.E75-D, No.4:435--441, 1992.

Conferences

• Yoshiaki matsuzawa, Kazuyoshi Murata, Seiichi Tani: Multivocal Challenge toward Measuring Computational Thinking: Bebras Challenge vs Computer Programming, IFIP-TC3 Open Conference on Computers in Education (OCCE) 2018, Linz, Austria, June 2018.
• Masahiko Murakami and Seiichi Tani: A fast algorithm for computing invariants defined by skein relations of 2-bridge diagrams. China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , Dalian, China, November 2010.
• Suguru Yoshioka, Masumi Morii, Shintaro Matsushima and Seiichi Tani: Spacio-Temporal Analysis Using the Web Archive System Based on Ajax. the 11th International Conference on Asia-Pacific Digital Libraries (ICADL 2008), Bali, Indonesia, December 2008.
• Seiichi Tani and Etsuro Moriya: Japanese Olympiad in Informatics. the second OLYMPIADS IN INFORMATICS conference, Cairo, Egypt, August 2008.
• Masao Hara, Masahiko Murakami, Seiichi Tani and Makoto Yamamoto: A Fast Algorithm for Computing Jones Polynomials of Montesinos Links, 10th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2007), Gwangju, Korea, August 2007.
• M. Murakami, M. Hara, M. Yamamoto and S. Tani: Fast Algorithms for Computing Jones polynomials of Certain Links, 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, June 2005
• Masao Hara, Seiichi Tani and Makoto Yamamoto: Unknotting is in AM ∩ co-AM. 16th ACM-SIAM Symposium on Discrete Algorithm (SODA 2005), Vancouver, British Columbia, Canada, January 2005.
• Sei'ichi Tani and Koichi Yamazaki: Learning of restricted RNLC Graph Languages, 6th International Symposium Algorithms and Computation (ISAAC 1995), Cairns, Australia, December 1995.
• Yoshiyasu Ishigami and Sei'ichi Tani: The VC-dimensions of Finite Automata with n States. 4th Workshop on Algorithmic Learning Theory (ALT 1993), Tokyo, November 1993.
• Sei'ichi Tani: On the Role of Equivalence Queries in MAT Learning, 2nd Workshop on Algorithmic Learning Theory (ALT 1991), Tokyo, October 1991.

Technical Report

• Masashi Matsuba and Seiichi Tani: On Computational Complexity of the Conjugacy Problem for Braids, Technical Report of IEICE. CPMP-2003-88 (2004-03), pp.17-23.