Rchr
J-GLOBAL ID：201101038424305948
Update date: Jun. 07, 2023
Matsui Tetsushi
Matsui Tetsushi
Contact this researcher
You can send email directly to the researcher.
Research field (2)：
Information theory
, Algebra
Papers (7)：
Tetsushi Matsui, Takeaki Uno, Juzoh Umemori, Tsuyoshi Koide. A New Approach to String Pattern Mining with Approximate Match. Lecture Notes in Computer Science (DS2013). 2013. 8140. 110-125
Tetsushi Matsui. Ehrhart Series for Connected Simple Graphs. GRAPHS AND COMBINATORICS. 2013. 29. 3. 617-635
Matsui Tetsushi, Uno Takeaki. Algorithm to Generate All Connected Simple Graphs of Given Order. 2013. 2013-AL-143. 15. 1-5
Tetsushi Matsui, Akihiro Higashitani, Yuuki Nagazawa, Hidefumi Ohsugi, Takayuki Hibi. Roots of Ehrhart polynomials arising from graphs. JOURNAL OF ALGEBRAIC COMBINATORICS. 2011. 34. 4. 721-749
Satoru Tanaka, Naoki Ogura, Ken Nakamula, Tetsushi Matsui, Shigenori Uchiyama. NZMATH 1.0. MATHEMATICAL SOFTWARE - ICMS 2010. 2010. 6327. 260-269
ｍore...
MISC (8)：
Tetsushi Matsui. Ehrhart Polynomials of Edge Polytopes for Connected Simple Graphs. 2011
松井 鉄史, 宇野 毅明. 計算幾何学的な手法を用いた高速相同性計算手法. 情報処理学会研究報告. BIO, バイオ情報学. 2010. 2010. 2. 1-8
MATSUI Tetsushi. Computational Complexity and Transcendence of Numbers. AC2007 Proceedings. 2008. 120-126
Tetsushi Matsui. On Polynomial Time Computable Numbers. 2006
MATSUI Tetsushi. NZMATH: Past and Future of the Development. AC2005 Proceedings. 2006
ｍore...
Lectures and oral presentations (3)：
NZMATH 1.0
(The Third International Congress on Mathematical Software 2010)
計算幾何学的な手法を用いた高速相同性計算手法
(第22回バイオ情報学研究発表会 2010)
Roots of Ehrhart polynomials arising from graphs and posets
(The Second CREST-SBM International Conference 2010)
Professional career (1)：
博士(理学) (東京都立大学)
Association Membership(s) (1)：
日本数学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in
researchmap
.
For details, see here
.
Return to Previous Page
TOP
BOTTOM
