• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

HARA Masao  原 正雄

ORCIDConnect your ORCID iD *help
Researcher Number 10238165
Other IDs
External Links
Affiliation (Current) 2022: 東海大学, 理系教育センター, 准教授
Affiliation (based on the past Project Information) *help 2007 – 2011: Tokai University, Department of Mathematical Science, Associate Professor
1998 – 2006: 東海大学, 理学部, 助教授
1993 – 1997: 東海大学, 理学部, 講師
Review Section/Research Field
Principal Investigator
Geometry / Geometry / General mathematics (including Probability theory/Statistical mathematics)
Except Principal Investigator
General mathematics (including Probability theory/Statistical mathematics) / Algebra / General mathematics (including Probability theory/Statistical mathematics) / Fundamental theory of informatics
Keywords
Principal Investigator
結び目理論 / 計算位相幾何 / 計算位相幾何学 / Jones多項式 / 2-bridge link / 3-braid link / Montesinos link / 空間グラフ / グラフ理論 / 絡み目不変量 … More / Montesinos絡み目 / Montesinos 絡み目 / 計算量 / 組合せアルゴリズム / link theory / computational topology / Jones polynomial … More
Except Principal Investigator
upper bound graph / double bound graph / グラフ理論 / semi bound graph / poset / 半順序集合 / graph theory / Frobenius map / rational singularity / F-rational ring / forbidden subgraph / F-regular ring / 組合せ論 / forbidden subposet / log-terminal singularity / blowing-up / 交グラフ / 進化生物学 / 系統樹 / 最節約復元問題 / MPR-poset / DELTRAN復元 / ACCTRAN復元 / 離散数学 / 応用数学 / 計算量理論 / アルゴリズム / graph operation / semi bound graphs / F-pure ring / link / tight closure / cohomology group / Boutot's Theorem / lower bound graph / edge clique cover / 線形時間アルゴリズム / 祖先形質 / 最節約復元順序集合 / MPRーpoest / σ(γ)-version MPR-poest / 大域的最適解 / strict-double-bound graph / strict-double-bound number / 結び目 / 絡み目 / 位相不変量 / Jones多項式 / 計算量 / commutative ring theory (可挽環論) / algebraic geometry (代数幾何学) / singularities (特異点論) / 有理特異点 / terminal singularity / 例外因子 / Hilbert-Kunz重複度 / Frobenius写像 / regular local ring / Hilbert-Kung multiplicity / 特異点の解消 / (例外因子の)discropanciy / terninal singularity / F-teruinal ring / test ideal / geometric genus / GNentein ring / F-terminal ring / canonical singularity / Algebraic Geometry / Singularities / Terminal Singularity / regular ring / Hilbert-Kunz multiplicity / intersection graph / upper bound graphs / double bound graphs / simplicial vertex / subposet / 計算論的位相幾何学 / ジョーンズ多項式 / 離散アルゴリズム / 結び目理論 / 多項式不変量 / トポロジー / 量子計算 / Computational topoloay / Jones polynomial / discrete al aorithm / computational complexity / knot theory / upper bound grap / k-tree Less
  • Research Projects

    (17 results)
  • Research Products

    (55 results)
  • Co-Researchers

    (25 People)
  •  Computational topology on knots and spatial graphs

    • Principal Investigator
      YAMAMOTO Makoto
    • Project Period (FY)
      2009 – 2011
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Chuo University
  •  Link Invariant From The Computational Topological ViewpointPrincipal Investigator

    • Principal Investigator
      HARA Masao
    • Project Period (FY)
      2008 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Geometry
    • Research Institution
      Tokai University
  •  On bound graphs and poset operations

    • Principal Investigator
      TSUCHIYA Morimasa
    • Project Period (FY)
      2008 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  On subgraphs and subposets of bound graphs

    • Principal Investigator
      TSUCHIYA Morimasa
    • Project Period (FY)
      2006 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  On Computational Complexity of Computing Jones Polynomials

    • Principal Investigator
      TANI Seiichi
    • Project Period (FY)
      2005 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Nihon University
  •  Link Theory from the Computational Topological ViewpointPrincipal Investigator

    • Principal Investigator
      HARA Masao
    • Project Period (FY)
      2005 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  On bound graphs and simplicial vertices

    • Principal Investigator
      TSUCHIYA Morimasa
    • Project Period (FY)
      2004 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  On bound graphs and non-maximal cliques

    • Principal Investigator
      TSUCHIYA Morimasa
    • Project Period (FY)
      2002 – 2003
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      TOKAI UNIVERSITY
  •  On bound graphs and cique covers

    • Principal Investigator
      TUCHIYA Morimasa
    • Project Period (FY)
      2000 – 2001
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      TOKAI UNIVERSITY
  •  On relations between upper bound graphs and graph operations

    • Principal Investigator
      TSUCHIYA Morimasa
    • Project Period (FY)
      1998 – 1999
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  3次元ユークリッド空間内のグラフの位相幾何学的研究Principal Investigator

    • Principal Investigator
      原 正雄
    • Project Period (FY)
      1996
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      Geometry
    • Research Institution
      Tokai University
  •  進化生物学における離散最適化問題の数理的研究

    • Principal Investigator
      成嶋 弘
    • Project Period (FY)
      1996 – 1997
    • Research Category
      Grant-in-Aid for Exploratory Research
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  Upper bound graphとposetの関連について

    • Principal Investigator
      土屋 守正
    • Project Period (FY)
      1995
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  系統分類学における組合せ論的問題の研究

    • Principal Investigator
      成嶋 弘
    • Project Period (FY)
      1995
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Tokai University
  •  Applications of Frobenius map to Commutative Ring Theory and Algebraic Geometry

    • Principal Investigator
      WATANABE Keiichi
    • Project Period (FY)
      1995 – 1997
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Algebra
    • Research Institution
      NIHON UNIVERSITY
      Tokai University
  •  F-rational Ringの研究

    • Principal Investigator
      渡辺 敬一
    • Project Period (FY)
      1994
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      Algebra
    • Research Institution
      Tokai University
  •  Frobenius写像の特異点への作用

    • Principal Investigator
      WATANABE Keiichi
    • Project Period (FY)
      1993
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      Algebra
    • Research Institution
      Tokai University

All 2012 2010 2009 2008 2007 2006 2005 2004 Other

All Journal Article Presentation Book

  • [Book] Javaではじめるレイトレーシング入門基礎から結び目と帯の描画まで2005

    • Author(s)
      郡山彬, 原 正雄, 峯崎俊哉, 尾崎克久
    • Publisher
      森桁出版
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] O(n^2) time algorithms for computing Jones polynomials of certain links2010

    • Author(s)
      Masahiko Murakami, Masao Hara, Seiichi Tani, Makoto Yamamoto
    • Journal Title

      研究集会「結び目の数学II」報告集

    • Data Source
      KAKENHI-PROJECT-21500022
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Montesinos Links2009

    • Author(s)
      Masao Hara
    • Journal Title

      Scientiae Mathematicae Japonicae 69

      Pages: 1-26

    • NAID

      10025094629

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Journal Article] Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries2009

    • Author(s)
      Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida
    • Journal Title

      IPSJ Transactions on Mathematical Modeling and Its Applications Vol.2, No.3

      Pages: 127-137

    • NAID

      130000142338

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Montesinos Links2009

    • Author(s)
      Masao Hara, Masahiko Murakami, Seiichi Tani, Makoto Yamamoto
    • Journal Title

      Scientiae Mathematicae Japonicae Vol.69, No.1

      Pages: 1-26

    • NAID

      10025094629

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Journal Article] Learning of Elementary Formal Systems with Two Clauses Using Queries2009

    • Author(s)
      Hirotaka Kato, Satoshi Matsumoto, Tetsuhiro Miyahara
    • Journal Title

      IEICE Transactions on Information and Systems Vol.E92-D, No.2

      Pages: 172-180

    • NAID

      10026807387

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Journal Article] The determinants of certain matrices arising from the Boolean lattice2008

    • Author(s)
      Masao Hara
    • Journal Title

      Discrete Mathematics 308

      Pages: 5815-5822

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Journal Article] The determinants of certain matrices arising from the Boolean lattice2008

    • Author(s)
      Masao Hara, Junzo Watanabe
    • Journal Title

      Discrete Mathematics Vol.308

      Pages: 5815-5822

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Journal Article] Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries2008

    • Author(s)
      Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara, Yusuke Suzuki
    • Journal Title

      IEICE TRANSACTIONS on Information and Systems

      Pages: 222-230

    • NAID

      110003178732

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Journal Article] The determinants of certain matrices arising from the Boolean lattice2008

    • Author(s)
      M. Hara and J. Watanabe
    • Journal Title

      Discrete Mathematics (In press)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries2008

    • Author(s)
      Satoshi, Matsumoto, Takayoshi, Shoudai, Tomoyuki, Uchida, Tetsuhiro, Miyahara, Yusuke, Suzuki
    • Journal Title

      IEICE TRANSACTIONS on Information and Systems

      Pages: 222-230

    • NAID

      110003178732

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2007

    • Author(s)
      M. Murakami, M. Hara, M. Yamamoto, S. Tani
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      村上雅彦, 原正雄, 山本慎, 谷聖一
    • Journal Title

      京都大学数理解析研究所講究録 1554

      Pages: 153-160

    • NAID

      10025094629

    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2007

    • Author(s)
      M., Murakami, M., Hara, M., Yamamoto, S., Tani
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] Fast algorithms for computing Jones polynomials of certain links2007

    • Author(s)
      Masao Hara
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      Masao, Hara, Masahiko, Murakami, Seiichi, Tani, Makoto, Yamamoto
    • Journal Title

      2007 KOREA-JAPAN Joint Workshop on Algorithms and Computation

      Pages: 40-47

    • NAID

      10025094629

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      村上 雅彦, 原 正雄, 山本 慎, 谷 聖一
    • Journal Title

      京都大学数理解析研究所講究録 1554

      Pages: 153-160

    • NAID

      10025094629

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] Fast algorithms for computing Jones polynomials of certain links2007

    • Author(s)
      Masahiko, Murakami, Masao, Hara, Makoto, Yamamoto, Seiichi, Tani
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      原 正雄
    • Journal Title

      京都大学数理解析研究所講究録 1554

      Pages: 153-160

    • NAID

      10025094629

    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] Fast algohthms for computing Jones polynomials of certain links2007

    • Author(s)
      Maso Hara, Masahiko Murakami, Makoto Yamamoto, Seiichi Tani
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      Masao Hara
    • Journal Title

      2007 KOREA-JAPAN Joint Workshop on Algorithms and Computation

      Pages: 40-47

    • NAID

      10025094629

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] Fast algorithms for computing Jones polynomials of certain links2007

    • Author(s)
      Masao, Hara, Masahiko, Murakami, Makoto, Yamamoto, Seiichi, Tani
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Journal Article] Fast algorithms for computing Jones polynomials of certain links2007

    • Author(s)
      Masao Hara, Masahiko Murakami, Makoto Yamamoto, Seiichi Tani
    • Journal Title

      Theoretical Computer Science 374

      Pages: 1-24

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Journal Article] Learning of Elementary Formal Systems with Two Clauses using Queries and Their Languages2006

    • Author(s)
      加藤 浩央, 松本 哲志, 宮原 哲浩
    • Journal Title

      数理解析研究所講究録 1489

      Pages: 64-70

    • Data Source
      KAKENHI-PROJECT-18540139
  • [Journal Article] Learning of Elementary Formal Systems with Two Clauses using Queries and Their Languages2006

    • Author(s)
      加藤浩央, 松本哲志, 宮原哲浩
    • Journal Title

      数理解析研究所講究録 1489

      Pages: 64-70

    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2005

    • Author(s)
      Masao Hara, Masahiko Murakami, Makoto Yamamoto, Seiichi Tani
    • Journal Title

      4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 209-216

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] Learning of Elementary Formal Systems with Two Clausese using Quereies2005

    • Author(s)
      Hirotaka Kato, Satoshi Matsumoto, Tetsuhiro Miyahara
    • Journal Title

      Proceedings of the 16^th International Conference on Algorithmic Learning Theory, LNAI 3734

      Pages: 211-225

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2005

    • Author(s)
      M. Murakami, M. Hara, M. Yamamoto, S. Tani
    • Journal Title

      Proc.of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 209-216

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2005

    • Author(s)
      M.Murakami, M.Hara, M.Yamamoto, S.Tani
    • Journal Title

      Proceedings of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 209-216

    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] Learning of Elementary Formal Systems with Two Clausese using Quereies2005

    • Author(s)
      Hirotaka Kato, Satoshi Matsumoto, Tetsuhiro Miyahara
    • Journal Title

      Proceedings of the 16th International Conference on Algorithmic Learning Theory, LNAI 3734

      Pages: 211-225

    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] Fast Algorithms for Computing Jones Polynomial of Certain Links2005

    • Author(s)
      Masahiko Murakami, Masao Hara, Makoto Yamamoto, Seiichi Tani
    • Journal Title

      4^<th> Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 209-216

    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] Learning of Elementary Formal Systems with Two Clausese using Quereies2005

    • Author(s)
      Hirotaka Kato, Satoshi Matsumoto, Tetsuhiro Miyahara
    • Journal Title

      Proceedings of the 16^<th> International Conference on Algorithmic Learning Theory, LNAI 3734

      Pages: 211-225

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] UNKNOTTING is in AM∩co-AM2004

    • Author(s)
      Masao Hara 他
    • Journal Title

      Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms

      Pages: 359-364

    • NAID

      110003178737

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data2004

    • Author(s)
      Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tetsuhiro Miyahara
    • Journal Title

      Proceedings of the 8th Pacific Rim International Conference on Artificial Intelligence, LNAI 3157

      Pages: 211-220

    • NAID

      110002812009

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] Unknotting is in AM ∩co-AM2004

    • Author(s)
      Masao Hara, Seiichi Tani, Makoto Yamamoto
    • Journal Title

      Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms

      Pages: 359-364

    • NAID

      110003178737

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16540118
  • [Journal Article] The determinants of certain matrices arising from the Boolean lattice

    • Author(s)
      M. Hara, J. Watanabe
    • Journal Title

      Discrete Mathematics (In Press)

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Journal Article] On Jones polynomials of alternating pretzel knot(preprint)

    • Author(s)
      Masao. Hara, Makoto Yamamoto
    • Data Source
      KAKENHI-PROJECT-21500022
  • [Journal Article] The determinants of certain matrices arising from the Boolean lattice

    • Author(s)
      Masao Hara
    • Journal Title

      Discrete Mathematics (印刷中)

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Journal Article] The determinants of certain matrices arising from the Boolean lattice

    • Author(s)
      Masao, Hara, Junzo, Watanabe
    • Journal Title

      to appear in Discrete Mathematics

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Presentation] On Jones polynomials of alternating pretzel knots2012

    • Author(s)
      原正雄, 山本慎
    • Organizer
      研究集会「結び目理論の展望」
    • Place of Presentation
      早稲田大学
    • Year and Date
      2012-03-18
    • Data Source
      KAKENHI-PROJECT-21500022
  • [Presentation] O(n^2) time algorithms for computing Jones polynomials of certain links2009

    • Author(s)
      村上雅彦,原正雄,谷聖一,山本慎
    • Organizer
      研究集会「結び目の数学II」日本数学会トポロジー分科会・トポロジープロジェクト
    • Place of Presentation
      早稲田大学
    • Year and Date
      2009-12-23
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Presentation] O(n^2) time algorithms for computing Jones polynomials of certain links2009

    • Author(s)
      村上雅彦, 原正雄, 谷聖一, 山本慎
    • Organizer
      研究集会「結び目の数学II」
    • Place of Presentation
      早稲田大学
    • Year and Date
      2009-12-23
    • Data Source
      KAKENHI-PROJECT-21500022
  • [Presentation] Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries2009

    • Author(s)
      松本哲志,鈴木祐介,正代隆義,宮原哲浩,内田智之
    • Organizer
      第73回MPS研究会,沖縄県恩納村OIST Seaside House,情報処理学会
    • Year and Date
      2009-03-05
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Presentation] Polynomial time algorithms for computing Jones polynomials of certain links2008

    • Author(s)
      Masahiko Murakami, Masao Hara, Seiichi Tani, Makoto Yamamoto
    • Organizer
      The 20th Workshop on Topological Graph Theory, Yokohama National University
    • Year and Date
      2008-11-26
    • Data Source
      KAKENHI-PROJECT-20540092
  • [Presentation] Fast Algorithms for Computing Jones Polynomials of Certain Links2007

    • Author(s)
      M., Murakami, M., Hara, M., Yamamoto, S., Tani
    • Organizer
      10th Korea-Japan Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Gwangju, Korea
    • Year and Date
      2007-08-09
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Presentation] Fast algorithms for computing Jones polynomials of certain links2007

    • Author(s)
      Masao, Hara, Masahiko, Murakami, Seiichi, Tani, Makoto, Yamamoto
    • Organizer
      LA symposium at Winter
    • Place of Presentation
      KYOTO
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Presentation] Montesinos絡み目のJones多項式を計算するアルゴリズムについて2007

    • Author(s)
      村上 雅彦, 原 正雄, 山本 慎, 谷 聖一
    • Organizer
      京都大学数理解析研究所研究集会「計算機科学の理論とその応用」
    • Place of Presentation
      同志社大学
    • Year and Date
      2007-01-31
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Presentation] A Fast Algorithm for Computing Jones Polynomial of Montesinos Links2007

    • Author(s)
      Masao Hara
    • Organizer
      Kore-Japan Joint Workshop WAAC 2007
    • Place of Presentation
      Chonnam National University,Korea
    • Year and Date
      2007-08-09
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Presentation] A Fast Algorithm for Computing Jones Polynomial of Montesinos Links2007

    • Author(s)
      Masao, Hara, Masahiko, Murakami, Seiichi, Tani, Makoto, Yamamoto
    • Organizer
      Kore-Japan Joint Workshop WAAC 2007
    • Place of Presentation
      Chonnam National University Korea
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Presentation] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      M. Hara, M. Murakami, S. Tani and M. Yamamoto
    • Organizer
      10th Korea-Japan Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Gwangju, Korea
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Presentation] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      M. Hara, M. Murakami, S. Tani, M. Yamamoto
    • Organizer
      10th Korea-Japan Joint Workshop on Algorithms and Compputation
    • Place of Presentation
      Gwangju,Korea
    • Year and Date
      2007-08-09
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Presentation] Montesinos絡み目のJones多項式を計算するアルゴリズムについて2007

    • Author(s)
      原 正雄, 村上 雅彦, 谷 聖一, 山本 慎
    • Organizer
      冬のLAシンポジューム
    • Place of Presentation
      京都
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-18540139
  • [Presentation] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

    • Author(s)
      Masao Hara
    • Organizer
      10th Korea-Japan Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Chonnam National University
    • Year and Date
      2007-08-09
    • Data Source
      KAKENHI-PROJECT-17540135
  • [Presentation] Fast Algorithms for Computing Jones Polynomials of Certain Links2005

    • Author(s)
      M. Murakanu, M. Hara, M. Yamamoto, S. Tani
    • Organizer
      4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Budapest,Hungary
    • Year and Date
      2005-06-05
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500014
  • [Presentation] Fast Algorithms for Computing Jones Polynomials of Certain Links2005

    • Author(s)
      Masahiko, Murakami, Masao, Hara, Makoto, Yamamoto, Seiichi, Tani
    • Organizer
      4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Renyi Institute, Budapest Hungary
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17540135
  • 1.  TSUCHIYA Morimasa (00188583)
    # of Collaborated Projects: 11 results
    # of Collaborated Products: 0 results
  • 2.  MATSUMOTO Satoshi (30307235)
    # of Collaborated Projects: 8 results
    # of Collaborated Products: 11 results
  • 3.  MATSUI Yasuko (10264582)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 0 results
  • 4.  TANI Seiichi (70266708)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 21 results
  • 5.  WATANABE Keiichi (10087083)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 6.  YAMAMOTO Makoto (10158305)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 23 results
  • 7.  WATANABE Junzo (40022727)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 8.  成嶋 弘 (90056200)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 9.  ONISHI Kensuke (00303024)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 10.  和泉澤 正隆 (50108445)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 11.  花沢 正純 (50008851)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 12.  ITAI Masanori (80266361)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 13.  MATSUURA Yutaka (50096905)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  SUZUKI Masahiko (00171249)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 15.  MORI Makoto (60092532)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 16.  YAKU Takeo (90102821)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  TODA Seinosuke (90172163)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  郡山 彬 (30056246)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 19.  草場 公邦 (20087076)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 20.  占部 正承 (30256177)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 21.  藤井 信彦 (60228955)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 22.  桔梗 宏孝 (80204824)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 23.  堀江 邦明 (20201759)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 24.  太田 雅巳 (40025490)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 25.  内村 桂輔 (20092835)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to connect your ORCID iD to this researcher?
* This action can be performed only by the researcher themselves.

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi