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

Mieno Takuya  三重野 琢也

ORCIDConnect your ORCID iD *help
Researcher Number 60953388
Other IDs
Affiliation (Current) 2025: 電気通信大学, 大学院情報理工学研究科, 助教
Affiliation (based on the past Project Information) *help 2022 – 2024: 電気通信大学, 大学院情報理工学研究科, 助教
Review Section/Research Field
Principal Investigator
Transformative Research Areas, Section (IV) / Basic Section 60010:Theory of informatics-related / 1001:Information science, computer engineering, and related fields
Keywords
Principal Investigator
文字列アルゴリズム / 文字列データ構造 / 回文 / データ構造 / アルゴリズム / 文字列データ処理 / 極小不在文字列 / NP困難問題 / 一般化文字列 / 文字列組合せ論 … More / 動的文字列データ処理 / ユニーク部分文字列 / 周期性 / 動的文字列 / 回文部分文字列 / 動的文字列処理 Less
  • Research Projects

    (3 results)
  • Research Products

    (3 results)
  •  不在/稀少文字列の計算技法と一般化文字列への展開Principal Investigator

    • Principal Investigator
      三重野 琢也
    • Project Period (FY)
      2024 – 2026
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      The University of Electro-Communications
  •  文字列処理におけるNP困難問題の高速解法の追求Principal Investigator

    • Principal Investigator
      三重野 琢也
    • Project Period (FY)
      2023 – 2024
    • Research Category
      Grant-in-Aid for Transformative Research Areas (A)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      The University of Electro-Communications
  •  Development of algorithms for dynamic string processing and elucidation of computational lower bound.Principal Investigator

    • Principal Investigator
      Mieno Takuya
    • Project Period (FY)
      2022 – 2023
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Review Section
      1001:Information science, computer engineering, and related fields
    • Research Institution
      The University of Electro-Communications

All 2023

All Journal Article Presentation

  • [Journal Article] Data Structures for Computing Unique Palindromes in Static and Non-Static Strings2023

    • Author(s)
      Mieno Takuya、Funakoshi Mitsuru
    • Journal Title

      Algorithmica

      Volume: 86 Issue: 3 Pages: 852-873

    • DOI

      10.1007/s00453-023-01170-8

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22K21273
  • [Journal Article] Finding top-k longest palindromes in substrings2023

    • Author(s)
      Mitani Kazuki、Mieno Takuya、Seto Kazuhisa、Horiyama Takashi
    • Journal Title

      Theoretical Computer Science

      Volume: 979 Pages: 114183-114183

    • DOI

      10.1016/j.tcs.2023.114183

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22K21273, KAKENHI-PLANNED-20H05964, KAKENHI-PUBLICLY-23H04381, KAKENHI-PROJECT-23K24806
  • [Presentation] Linear-time computation of generalized minimal absent words for multiple strings2023

    • Author(s)
      Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
    • Organizer
      30th International Symposium on String Processing and Information Retrieval (SPIRE 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-23H04381

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi