{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1040282256971018880.json","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"18H04098"},{"@type":"JGN","@value":"JP18H04098"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18H04098/"}],"jpcoar:awardTitle":[{"@language":"ja","@value":"情報爆縮に基づくIoTデータ処理基盤の構築"}],"field":[{"keyword":[{"language":"ja","textList":["中区分60:情報科学、情報工学およびその関連分野"]},{"language":"en","textList":["Medium-sized Section 60:Information science, computer engineering, and related fields"]}]}],"dc:language":"ja","description":[{"type":"outline_of_research_performance","notation":[{"@language":"ja","@value":"IoT時代が到来し, 製造・産業界, モビリティ・交通インフラ, 医療・ヘルスケアなど, 広範な分野において技術革新が生み出され新たな価値が創出されると期待されている. 一方, IoTデータの急増に伴い, クラウドサーバヘのデータ処理の集中, ネットワーク回線の逼迫, データ送信の遅延などの技術的問題が深刻化している. 現在のIoTに対する取り組みは実証フェーズのものが多くIoTを用いた価値創出に重点が置かれているため, 上記の問題の抜本的な解決は後回しとなっている. 代表者らは, これまでに, 入力データや計算に用いるデータ構造に潜む冗長性の除去に基づいて計算そのものの効率化を図る「情報爆縮」の研究を行ってきた. 本研究プロジェクトでは, この情報爆縮技術を核に据え, 理論と実用的の両面から, エッジ側とクラウド側の処理を効率化する技術を開発し低コストでデータを収集・集約・送信・蓄積・検索・解析できる新しいIoTデータ処理基盤の構築を目指す.\nこのために, 以下の3つの研究項目をおいて研究を行った.\n(A) 圧縮データストリームに対するリアルタイム抽出・集計技術.\n(B) 圧縮データに対する高速質問処理技術.\n(C) 解釈可能な圧縮データ錬成技術.\n前年度に引き続き, 特に(A)(B)に力点を置いて研究を行い、(A) スライド窓における極小不在文字列の精緻な解析による列挙アルゴリズムの計算量改善、(B) 双方向にパターン延長可能な、パラメータ化照合のための索引構造の提案等をはじめ、多くの研究成果を得た."}]},{"type":"progress","notation":[{"@language":"ja","@value":"令和4年度が最終年度であるため、記入しない。"}]},{"type":"planning_scheme","notation":[{"@language":"ja","@value":"令和4年度が最終年度であるため、記入しない。"}]}],"researcher":[{"@id":"https://cir.nii.ac.jp/crid/1030003658302391301","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50216909"},{"@type":"NRID","@value":"1000050216909"},{"@type":"AID","@value":"DA12201928"},{"@type":"NRID","@value":"9000404282908"},{"@type":"NRID","@value":"9000410923937"}],"foaf:name":[{"@language":"ja","@value":"竹田 正幸"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州大学"}],"role":"principal_investigator"},{"@id":"https://cir.nii.ac.jp/crid/1420282801183814784","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"20323090"},{"@type":"NRID","@value":"1000020323090"},{"@type":"CINII_AUTHOR_ID","@value":"DA19018442"},{"@type":"URI","@value":"https://ci.nii.ac.jp/author/DA19018442#entity"},{"@type":"URI","@value":"https://viaf.org/viaf/NII%7CDA19018442"},{"@type":"NRID","@value":"9000404229972"},{"@type":"NRID","@value":"9000024579100"},{"@type":"NRID","@value":"9000020762549"},{"@type":"NRID","@value":"9000404239047"},{"@type":"NRID","@value":"9000242793342"},{"@type":"NRID","@value":"9000258454146"},{"@type":"NRID","@value":"9000258458041"},{"@type":"NRID","@value":"9000258455224"},{"@type":"NRID","@value":"9000291613661"},{"@type":"NRID","@value":"9000415427536"},{"@type":"NRID","@value":"9000335548832"},{"@type":"NRID","@value":"9000022248794"},{"@type":"NRID","@value":"9000242864872"},{"@type":"NRID","@value":"9000258458088"},{"@type":"NRID","@value":"9000258456148"},{"@type":"NRID","@value":"9000404238982"},{"@type":"NRID","@value":"9000398624030"},{"@type":"NRID","@value":"9000258454150"},{"@type":"NRID","@value":"9000239658494"},{"@type":"NRID","@value":"9000388994016"},{"@type":"NRID","@value":"9000021538842"},{"@type":"NRID","@value":"9000004795715"},{"@type":"NRID","@value":"9000283435763"},{"@type":"NRID","@value":"9000240139835"},{"@type":"NRID","@value":"9000365541671"},{"@type":"NRID","@value":"9000404271187"},{"@type":"NRID","@value":"9000405849246"},{"@type":"NRID","@value":"9000404225108"},{"@type":"NRID","@value":"9000046253913"},{"@type":"NRID","@value":"9000410649790"},{"@type":"NRID","@value":"9000287170554"},{"@type":"NRID","@value":"9000404099415"},{"@type":"NRID","@value":"9000258454669"},{"@type":"NRID","@value":"9000004799207"},{"@type":"NRID","@value":"9000258456174"},{"@type":"NRID","@value":"9000404227319"},{"@type":"NRID","@value":"9000404271172"},{"@type":"NRID","@value":"9000258454154"},{"@type":"NRID","@value":"9000258454660"},{"@type":"NRID","@value":"9000021501923"},{"@type":"NRID","@value":"9000284630325"},{"@type":"NRID","@value":"9000284630297"},{"@type":"NRID","@value":"9000283435668"},{"@type":"NRID","@value":"9000283913746"},{"@type":"NRID","@value":"9000258449910"},{"@type":"NRID","@value":"9000378071231"},{"@type":"NRID","@value":"9000411075008"},{"@type":"NRID","@value":"9000259070349"},{"@type":"NRID","@value":"9000258449906"},{"@type":"NRID","@value":"9000003016219"},{"@type":"NRID","@value":"9000404245638"},{"@type":"NRID","@value":"9000021521655"},{"@type":"NRID","@value":"9000378071216"},{"@type":"NRID","@value":"9000403556640"},{"@type":"NRID","@value":"9000283829597"},{"@type":"NRID","@value":"9000287185715"},{"@type":"NRID","@value":"9000258454673"},{"@type":"NRID","@value":"9000010490793"},{"@type":"NRID","@value":"9000021501939"},{"@type":"NRID","@value":"9000404229976"},{"@type":"NRID","@value":"9000002298228"},{"@type":"NRID","@value":"9000403576566"},{"@type":"NRID","@value":"9000290371584"},{"@type":"NRID","@value":"9000258456141"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/sada"}],"foaf:name":[{"@language":"ja","@value":"定兼 邦彦"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"東京大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420001326229933824","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"20773360"},{"@type":"NRID","@value":"1000020773360"},{"@type":"NRID","@value":"9000006818869"},{"@type":"NRID","@value":"9000412549395"},{"@type":"NRID","@value":"9000383088081"},{"@type":"NRID","@value":"9000332219211"},{"@type":"NRID","@value":"9000017717183"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/tomohiro_i"}],"foaf:name":[{"@language":"ja","@value":"井 智弘"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州工業大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420001326221324160","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50236395"},{"@type":"NRID","@value":"1000050236395"},{"@type":"NRID","@value":"9000017682855"},{"@type":"NRID","@value":"9000403557114"},{"@type":"NRID","@value":"9000019096537"},{"@type":"NRID","@value":"9000299517109"},{"@type":"NRID","@value":"9000006588997"},{"@type":"NRID","@value":"9000403558409"},{"@type":"NRID","@value":"9000396103803"},{"@type":"NRID","@value":"9000243893439"},{"@type":"NRID","@value":"9000287144058"},{"@type":"NRID","@value":"9000378058471"},{"@type":"NRID","@value":"9000107318932"},{"@type":"NRID","@value":"9000414200602"},{"@type":"NRID","@value":"9000403556876"},{"@type":"NRID","@value":"9000308048418"},{"@type":"NRID","@value":"9000405860457"},{"@type":"NRID","@value":"9000403556880"},{"@type":"NRID","@value":"9000403559591"},{"@type":"NRID","@value":"9000414200604"},{"@type":"NRID","@value":"9000403558412"},{"@type":"NRID","@value":"9000403559595"},{"@type":"NRID","@value":"9000413547421"},{"@type":"NRID","@value":"9000403558817"},{"@type":"NRID","@value":"9000383088051"},{"@type":"NRID","@value":"9000398137823"},{"@type":"NRID","@value":"9000308048533"},{"@type":"NRID","@value":"9000397687882"},{"@type":"NRID","@value":"9000402285513"},{"@type":"NRID","@value":"9000321620786"},{"@type":"NRID","@value":"9000356603906"},{"@type":"NRID","@value":"9000403556872"},{"@type":"NRID","@value":"9000331084218"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/eiji_takimoto"}],"foaf:name":[{"@language":"ja","@value":"瀧本 英二"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420001326232576640","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50315123"},{"@type":"NRID","@value":"1000050315123"},{"@type":"ORCID","@value":"0000-0002-3470-9187"},{"@type":"NRID","@value":"9000404116855"},{"@type":"NRID","@value":"9000344129264"},{"@type":"NRID","@value":"9000004834423"},{"@type":"NRID","@value":"9000023731497"},{"@type":"NRID","@value":"9000413516372"},{"@type":"NRID","@value":"9000017682022"},{"@type":"NRID","@value":"9000020510415"},{"@type":"NRID","@value":"9000412549738"},{"@type":"NRID","@value":"9000017682839"},{"@type":"NRID","@value":"9000014432871"},{"@type":"NRID","@value":"9000411075195"},{"@type":"NRID","@value":"9000383088082"},{"@type":"NRID","@value":"9000259337821"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/hiroshi_sakamoto"}],"foaf:name":[{"@language":"ja","@value":"坂本 比呂志"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州工業大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420282801210591872","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"60404026"},{"@type":"NRID","@value":"1000060404026"},{"@type":"ORCID","@value":"0000-0002-1536-1269"},{"@type":"NRID","@value":"9000403557113"},{"@type":"NRID","@value":"9000019096536"},{"@type":"NRID","@value":"9000018481548"},{"@type":"NRID","@value":"9000406388185"},{"@type":"NRID","@value":"9000017194808"},{"@type":"NRID","@value":"9000403558407"},{"@type":"NRID","@value":"9000403557109"},{"@type":"NRID","@value":"9000396103802"},{"@type":"NRID","@value":"9000404313888"},{"@type":"NRID","@value":"9000243893438"},{"@type":"NRID","@value":"9000287144056"},{"@type":"NRID","@value":"9000378058470"},{"@type":"NRID","@value":"9000107318931"},{"@type":"NRID","@value":"9000404313897"},{"@type":"NRID","@value":"9000414200601"},{"@type":"NRID","@value":"9000331444779"},{"@type":"NRID","@value":"9000331084081"},{"@type":"NRID","@value":"9000399248847"},{"@type":"NRID","@value":"9000403957215"},{"@type":"NRID","@value":"9000403556874"},{"@type":"NRID","@value":"9000308048416"},{"@type":"NRID","@value":"9000405860456"},{"@type":"NRID","@value":"9000403556879"},{"@type":"NRID","@value":"9000403559590"},{"@type":"NRID","@value":"9000019056252"},{"@type":"NRID","@value":"9000414200605"},{"@type":"NRID","@value":"9000303992340"},{"@type":"NRID","@value":"9000403558411"},{"@type":"NRID","@value":"9000403558404"},{"@type":"NRID","@value":"9000404314181"},{"@type":"NRID","@value":"9000403559594"},{"@type":"NRID","@value":"9000413547420"},{"@type":"NRID","@value":"9000403558816"},{"@type":"NRID","@value":"9000383088050"},{"@type":"NRID","@value":"9000398137821"},{"@type":"NRID","@value":"9000399247832"},{"@type":"NRID","@value":"9000308048531"},{"@type":"NRID","@value":"9000397687881"},{"@type":"NRID","@value":"9000402285512"},{"@type":"NRID","@value":"9000321620785"},{"@type":"NRID","@value":"9000356603905"},{"@type":"NRID","@value":"9000107323000"},{"@type":"NRID","@value":"9000403957217"},{"@type":"NRID","@value":"9000403556871"},{"@type":"NRID","@value":"9000403556870"},{"@type":"NRID","@value":"9000403559585"},{"@type":"NRID","@value":"9000405913775"},{"@type":"NRID","@value":"9000405914415"},{"@type":"NRID","@value":"9000021655056"},{"@type":"NRID","@value":"9000331084217"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/kohei_hatano"}],"foaf:name":[{"@language":"ja","@value":"畑埜 晃平"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420282801199572608","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"60448404"},{"@type":"NRID","@value":"1000060448404"},{"@type":"NRID","@value":"9000004783309"},{"@type":"NRID","@value":"9000411075202"},{"@type":"NRID","@value":"9000254840641"},{"@type":"NRID","@value":"9000403557032"},{"@type":"NRID","@value":"9000403559629"},{"@type":"NRID","@value":"9000365541670"},{"@type":"NRID","@value":"9000019976491"},{"@type":"NRID","@value":"9000020879501"},{"@type":"NRID","@value":"9000411032604"},{"@type":"NRID","@value":"9000410923936"},{"@type":"NRID","@value":"9000411211783"},{"@type":"NRID","@value":"9000403557905"},{"@type":"NRID","@value":"9000241890097"},{"@type":"NRID","@value":"9000260204531"},{"@type":"NRID","@value":"9000017717184"},{"@type":"NRID","@value":"9000403557037"},{"@type":"NRID","@value":"9000403563056"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/s-inenaga"}],"foaf:name":[{"@language":"ja","@value":"稲永 俊介"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420282801189358080","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"70343316"},{"@type":"NRID","@value":"1000070343316"},{"@type":"NRID","@value":"9000016889919"},{"@type":"NRID","@value":"9000018711466"},{"@type":"NRID","@value":"9000242080761"},{"@type":"NRID","@value":"9000403580307"},{"@type":"NRID","@value":"9000017682024"},{"@type":"NRID","@value":"9000402400631"},{"@type":"NRID","@value":"9000318582851"},{"@type":"NRID","@value":"9000258103984"},{"@type":"NRID","@value":"9000021003740"},{"@type":"NRID","@value":"9000272254766"},{"@type":"NRID","@value":"9000413490081"},{"@type":"NRID","@value":"9000019950700"},{"@type":"NRID","@value":"9000399239863"},{"@type":"NRID","@value":"9000020879567"},{"@type":"NRID","@value":"9000347536872"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/takuya_kida"}],"foaf:name":[{"@language":"ja","@value":"喜田 拓也"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"北海学園大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420845751155618176","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"80804682"},{"@type":"NRID","@value":"1000080804682"},{"@type":"NRID","@value":"9000310746102"},{"@type":"NRID","@value":"9000410023821"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/yuto0nakashima"}],"foaf:name":[{"@language":"ja","@value":"中島 祐人"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"九州大学"}],"role":"co_investigator_buntan"},{"@id":"https://cir.nii.ac.jp/crid/1420001326207108736","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"20323644"},{"@type":"NRID","@value":"1000020323644"},{"@type":"NRID","@value":"9000016397333"},{"@type":"NRID","@value":"9000254877706"},{"@type":"NRID","@value":"9000403557110"},{"@type":"NRID","@value":"9000411075201"},{"@type":"NRID","@value":"9000254339151"},{"@type":"NRID","@value":"9000254842127"},{"@type":"NRID","@value":"9000005705211"},{"@type":"NRID","@value":"9000410923935"},{"@type":"NRID","@value":"9000410023823"},{"@type":"NRID","@value":"9000403559586"},{"@type":"NRID","@value":"9000254838772"},{"@type":"NRID","@value":"9000241954675"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/hdbn"}],"foaf:name":[{"@language":"ja","@value":"坂内 英夫"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"東京医科歯科大学"}],"role":"co_investigator_buntan"}],"since":"2018","until":"2022","institution":[{"institutionIdentifier":[{"@type":"NII","@value":"0017102"}],"notation":[{"@language":"ja","@value":"九州大学"},{"@language":"en","@value":"Kyushu University"}]}],"fundingProgram":[{"jpcoar:funderName":[{"@language":"ja","@value":"科学研究費助成事業"},{"@language":"en","@value":"Grants-in-Aid for Scientific Research"}]}],"url":[{"@id":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18H04098/","notation":[{"@value":"KAKEN"}]}],"createdAt":"2018-04-23","modifiedAt":"2025-11-19","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=%E6%83%85%E5%A0%B1%E7%88%86%E7%B8%AE","dc:title":"情報爆縮"},{"@id":"https://cir.nii.ac.jp/all?q=%E5%9C%A7%E7%B8%AE%E3%83%87%E3%83%BC%E3%82%BF%E5%87%A6%E7%90%86","dc:title":"圧縮データ処理"},{"@id":"https://cir.nii.ac.jp/all?q=%E5%9C%A7%E7%B8%AE%E3%83%87%E3%83%BC%E3%82%BF%E6%A7%8B%E9%80%A0","dc:title":"圧縮データ構造"},{"@id":"https://cir.nii.ac.jp/all?q=%E7%B0%A1%E6%BD%94%E3%83%87%E3%83%BC%E3%82%BF%E6%A7%8B%E9%80%A0","dc:title":"簡潔データ構造"},{"@id":"https://cir.nii.ac.jp/all?q=IoT%E3%83%87%E3%83%BC%E3%82%BF%E5%87%A6%E7%90%86","dc:title":"IoTデータ処理"}],"product":[{"@id":"https://cir.nii.ac.jp/crid/1360303782142775296","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s00453-022-00968-2"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s00453-022-00968-2.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s00453-022-00968-2/fulltext.html"}],"notation":[{"@value":"A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length"}]},{"@id":"https://cir.nii.ac.jp/crid/1360290617657367040","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/dcc47342.2020.00032"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9102212/9105663/09105914.pdf?arnumber=9105914"},{"@type":"DOI","@value":"10.1016/j.ic.2021.104794"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0890540121001103?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0890540121001103?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1904.07467"}],"notation":[{"@value":"c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches"}]},{"@id":"https://cir.nii.ac.jp/crid/1360017279829022720","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2022.06.002"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397522003553?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397522003553?httpAccept=text/plain"}],"notation":[{"@value":"Combinatorics of minimal absent words for a sliding window"}]},{"@id":"https://cir.nii.ac.jp/crid/1361412891783077888","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.ic.2020.104519"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0890540120300067?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0890540120300067?httpAccept=text/plain"}],"notation":[{"@value":"Compact and succinct data structures for multidimensional orthogonal range searching"}]},{"@id":"https://cir.nii.ac.jp/crid/1360017280645256192","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.ic.2022.104924"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0890540122000773?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0890540122000773?httpAccept=text/plain"}],"notation":[{"@value":"Order-preserving pattern matching indeterminate strings"}]},{"@id":"https://cir.nii.ac.jp/crid/1360306905151280128","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.ic.2023.105124"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S089054012300127X?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S089054012300127X?httpAccept=text/plain"},{"@type":"DOI","@value":"10.1109/dcc52660.2022.00034"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9810654/9810655/09810695.pdf?arnumber=9810695"},{"@type":"DOI","@value":"10.48550/arxiv.2111.04332"}],"notation":[{"@value":"Succinct data structure for path graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593685955584","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s10994-020-05883-7"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s10994-020-05883-7.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s10994-020-05883-7/fulltext.html"}],"notation":[{"@value":"Guest Editorial: Special issue on Discovery Science"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298754847901184","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/a15070229"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/15/7/229/pdf"},{"@type":"DOI","@value":"10.48550/arxiv.2110.05088"}],"notation":[{"@value":"Privacy-Preserving Feature Selection with Fully Homomorphic Encryption"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580232147785216","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-031-06678-8_24"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-031-06678-8_24"}],"notation":[{"@value":"Space-Efficient B Trees via Load-Balancing"}]},{"@id":"https://cir.nii.ac.jp/crid/1360849940034681344","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-38919-2_13"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-38919-2_13"},{"@type":"DOI","@value":"10.48550/arxiv.1909.02804"}],"notation":[{"@value":"Minimal Unique Substrings and Minimal Absent Words in a Sliding Window"}]},{"@id":"https://cir.nii.ac.jp/crid/1010005505720482310","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2019.27"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2019.27"}],"notation":[{"@language":"ja","@value":"Faster Queries for Longest Substring Palindrome After Block Edit"}]},{"@id":"https://cir.nii.ac.jp/crid/1360572092496834688","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-59212-7_3"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-59212-7_3"},{"@type":"DOI","@value":"10.48550/arxiv.2005.08190"}],"notation":[{"@value":"Towards Efficient Interactive Computation of Dynamic Time Warping Distance"}]},{"@id":"https://cir.nii.ac.jp/crid/1360290617657368832","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/dcc47342.2020.00092"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9102212/9105663/09105694.pdf?arnumber=9105694"},{"@type":"DOI","@value":"10.3390/a14010005"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/14/1/5/pdf"},{"@type":"DOI","@value":"10.48550/arxiv.1908.04933"}],"notation":[{"@value":"Re-Pair in Small Space"}]},{"@id":"https://cir.nii.ac.jp/crid/1360849942245052800","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2019.08.005"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397519304943?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397519304943?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1802.05906"}],"notation":[{"@value":"Refining the r-index"}]},{"@id":"https://cir.nii.ac.jp/crid/1050306506453217408","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"HDL","@value":"https://hdl.handle.net/2115/71743"},{"@type":"DOI","@value":"10.1007/978-3-319-07959-2_16"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-319-07959-2_16"},{"@type":"DOI","@value":"10.3390/a11080128"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/11/8/128/pdf"},{"@type":"HANDLE","@value":"2115/71743"},{"@type":"NAID","@value":"120006531980"}],"notation":[{"@language":"en","@value":"DenseZDD : A Compact and Fast Index for Families of Sets"},{"@value":"DenseZDD: A Compact and Fast Index for Families of Sets †"}]},{"@id":"https://cir.nii.ac.jp/crid/1010576118579513873","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP"}]},{"@id":"https://cir.nii.ac.jp/crid/1361694364955222784","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-25005-8_35"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-25005-8_35"}],"notation":[{"@value":"Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142543409920","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-59212-7_19"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-59212-7_19"},{"@type":"DOI","@value":"10.48550/arxiv.2006.13576"}],"notation":[{"@value":"Lyndon Words, the Three Squares Lemma, and Primitive Squares"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004230602290304","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-319-98654-8_2"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-319-98654-8_2"}],"notation":[{"@value":"The Runs Theorem and Beyond"}]},{"@id":"https://cir.nii.ac.jp/crid/1360565165273392384","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s00453-017-0333-1"},{"@type":"URI","@value":"http://link.springer.com/article/10.1007/s00453-017-0333-1/fulltext.html"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/s00453-017-0333-1.pdf"}],"notation":[{"@value":"Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees"}]},{"@id":"https://cir.nii.ac.jp/crid/1360021390741379456","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.jcss.2022.07.002"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0022000022000526?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0022000022000526?httpAccept=text/plain"},{"@type":"DOI","@value":"10.1007/978-3-030-68195-1_5"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-68195-1_5"},{"@type":"DOI","@value":"10.2139/ssrn.4069236"},{"@type":"DOI","@value":"10.48550/arxiv.1907.09271"},{"@type":"HANDLE","@value":"11568/1127370"},{"@type":"HANDLE","@value":"11568/1167729"}],"notation":[{"@value":"Succinct representation for (non)deterministic finite automata"}]},{"@id":"https://cir.nii.ac.jp/crid/1360576118788938112","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-86692-1_14"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-86692-1_14"}],"notation":[{"@value":"A Separation of $$\\gamma $$ and b via Thue–Morse Words"}]},{"@id":"https://cir.nii.ac.jp/crid/1360853567442352768","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/tit.2020.3038147"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/18/9300279/09259056.pdf?arnumber=9259056"},{"@type":"DOI","@value":"10.48550/arxiv.1908.06428"}],"notation":[{"@value":"The Smallest Grammar Problem Revisited"}]},{"@id":"https://cir.nii.ac.jp/crid/1360013168884755200","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/tvt.2021.3116223"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/25/9619988/09551710.pdf?arnumber=9551710"}],"notation":[{"@value":"Sleeping Contextual/Non-Contextual Thompson Sampling MAB for mmWave D2D Two-Hop Relay Probing"}]},{"@id":"https://cir.nii.ac.jp/crid/1010576118579513858","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593721740160","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.23919/icmu50196.2021.9638849"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9638698/9638782/09638849.pdf?arnumber=9638849"}],"notation":[{"@value":"WiGig Wireless Sensor Selection Using Sophisticated Multi Armed Bandit Schemes"}]},{"@id":"https://cir.nii.ac.jp/crid/1010576118579513859","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Storing Set Families More Compactly with Top ZDDs"}]},{"@id":"https://cir.nii.ac.jp/crid/1391131406305594368","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.2197/ipsjjip.29.1"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/ipsjjip/29/0/29_1/_pdf"},{"@type":"DOI","@value":"10.48550/arxiv.1904.04513"},{"@type":"NAID","@value":"130007968924"}],"notation":[{"@language":"en","@value":"Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285705576025088","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-319-94776-1_51"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-319-94776-1_51"},{"@type":"DOI","@value":"10.1016/j.tcs.2020.04.009"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397520302139?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397520302139?httpAccept=text/plain"}],"notation":[{"@value":"A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time"}]},{"@id":"https://cir.nii.ac.jp/crid/1360294643732466688","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-67731-2_18"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-67731-2_18"},{"@type":"DOI","@value":"10.48550/arxiv.2008.08506"},{"@type":"HANDLE","@value":"11562/1038207"},{"@type":"HANDLE","@value":"10278/5004036"},{"@type":"HANDLE","@value":"10447/498241"}],"notation":[{"@value":"Novel Results on the Number of Runs of the Burrows-Wheeler-Transform"}]},{"@id":"https://cir.nii.ac.jp/crid/1360294643746536576","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-86692-1_20"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-86692-1_20"},{"@type":"DOI","@value":"10.48550/arxiv.2106.01595"}],"notation":[{"@value":"Position Heaps for Cartesian-Tree Matching on Strings and Tries"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004232264973440","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.jda.2018.11.002"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S1570866718301655?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S1570866718301655?httpAccept=text/plain"}],"notation":[{"@value":"A faster implementation of online RLBWT and its application to LZ77 parsing"}]},{"@id":"https://cir.nii.ac.jp/crid/1360013168770129280","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.ipl.2021.106174"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0020019021000892?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0020019021000892?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.2006.02134"}],"notation":[{"@value":"Palindromic trees for a sliding window and its applications"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593701121664","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/a14040116"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/14/4/116/pdf"},{"@type":"DOI","@value":"10.48550/arxiv.2103.03468"}],"notation":[{"@value":"Compressed Communication Complexity of Hamming Distance"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655481138944","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-319-21500-6_6"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-319-21500-6_6"},{"@type":"DOI","@value":"10.1142/s0129054118400014"},{"@type":"URI","@value":"https://www.worldscientific.com/doi/pdf/10.1142/S0129054118400014"},{"@type":"DOI","@value":"10.48550/arxiv.1503.04045"}],"notation":[{"@value":"Diverse Palindromic Factorization Is NP-complete"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861707132354176","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-031-23101-8_25"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-031-23101-8_25"}],"notation":[{"@value":"Space-Efficient STR-IC-LCS Computation"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298338454024320","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/jiot.2022.3162135"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/6488907/9881201/09741307.pdf?arnumber=9741307"}],"notation":[{"@value":"Energy-Aware Hybrid RF-VLC Multiband Selection in D2D Communication: A Stochastic Multiarmed Bandit Approach"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593815265920","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/s21082835"},{"@type":"URI","@value":"https://www.mdpi.com/1424-8220/21/8/2835/pdf"},{"@type":"PMID","@value":"33920717"}],"notation":[{"@value":"Wi-Fi Assisted Contextual Multi-Armed Bandit for Neighbor Discovery and Selection in Millimeter Wave Device to Device Communications"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593700008576","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s00453-021-00864-1"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s00453-021-00864-1.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s00453-021-00864-1/fulltext.html"}],"notation":[{"@value":"Computing Minimal Unique Substrings for a Sliding Window"}]},{"@id":"https://cir.nii.ac.jp/crid/1360572092465996416","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/a13090234"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/13/9/234/pdf"},{"@type":"HANDLE","@value":"10138/321217"}],"notation":[{"@value":"More Time-Space Tradeoffs for Finding a Shortest Unique Substring"}]},{"@id":"https://cir.nii.ac.jp/crid/1050298532703793792","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"HDL","@value":"https://hdl.handle.net/2324/4495597"},{"@type":"DOI","@value":"10.1007/978-3-030-67731-2_15"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-67731-2_15"},{"@type":"DOI","@value":"10.48550/arxiv.2007.07515"},{"@type":"NAID","@value":"120007164565"}],"notation":[{"@language":"en","@value":"Improved Algorithms for Online Load Balancing"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861707356038272","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2022.06.022"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397522003930?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397522003930?httpAccept=text/plain"}],"notation":[{"@value":"Succinct navigational oracles for families of intersection graphs on a circle"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298757203666560","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/ccnc51644.2023.10060437"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/10059462/10059600/10060437.pdf?arnumber=10060437"}],"notation":[{"@value":"Advanced MAB Schemes for WiGig-Aided Aerial Mounted RIS Wireless Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360862714698819712","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/dcc52660.2022.00032"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9810654/9810655/09810703.pdf?arnumber=9810703"}],"notation":[{"@value":"Converting RLBWT to LZ77 in smaller space"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593699958912","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-86692-1_3"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-86692-1_3"}],"notation":[{"@value":"Longest Common Rollercoasters"}]},{"@id":"https://cir.nii.ac.jp/crid/1010290617246667399","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.ISAAC.2019.40"}],"notation":[{"@language":"ja","@value":"An Improved Data Structure for Left-Right Maximal Generic Words Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1010290617246667398","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Computing Maximal Palindromes and Distinct Palindromes in a Trie"}]},{"@id":"https://cir.nii.ac.jp/crid/1010290617246667402","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"k-Abelian Pattern Matching: Revisited, Corrected, and Extended"}]},{"@id":"https://cir.nii.ac.jp/crid/1010576118579513991","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures"}]},{"@id":"https://cir.nii.ac.jp/crid/1010290617246667406","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Computing Runs on a Trie"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845712979357952","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transinf.2017edp7339"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transinf/E101.D/8/E101.D_2017EDP7339/_pdf"},{"@type":"NAID","@value":"130007429268"}],"notation":[{"@language":"en","@value":"Tighter Generalization Bounds for Matrix Completion Via Factorization Into Constrained Matrices"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285705474328192","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-02224-2_18"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-02224-2_18"}],"notation":[{"@value":"Privacy-Preserving String Edit Distance with Moves"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655529359104","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-319-94667-2_27"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-319-94667-2_27"}],"notation":[{"@value":"LZ-ABT: A Practical Algorithm for $$\\alpha $$-Balanced Grammar Compression"}]},{"@id":"https://cir.nii.ac.jp/crid/1050017057728163840","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"HDL","@value":"https://hdl.handle.net/2324/2231502"},{"@type":"HDL","@value":"https://hdl.handle.net/2324/1932329"},{"@type":"DOI","@value":"10.1007/978-3-319-75172-6_17"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-319-75172-6_17"},{"@type":"DOI","@value":"10.1016/j.tcs.2018.11.027"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397518307175?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397518307175?httpAccept=text/plain"},{"@type":"NAID","@value":"120006603510"}],"notation":[{"@language":"en","@value":"Boosting over non-deterministic ZDDs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285711135967872","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1142/s0129054118410083"},{"@type":"URI","@value":"https://www.worldscientific.com/doi/pdf/10.1142/S0129054118410083"}],"notation":[{"@value":"Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions"}]},{"@id":"https://cir.nii.ac.jp/crid/1010576118579513986","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Re-Pair in Small Space"}]},{"@id":"https://cir.nii.ac.jp/crid/1360853567610952704","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1145/3398681"},{"@type":"URI","@value":"https://dl.acm.org/doi/10.1145/3398681"},{"@type":"URI","@value":"https://dl.acm.org/doi/pdf/10.1145/3398681"},{"@type":"DOI","@value":"10.48550/arxiv.1509.07417"}],"notation":[{"@value":"Deterministic Sparse Suffix Sorting in the Restore Model"}]},{"@id":"https://cir.nii.ac.jp/crid/1361131414996589568","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-17402-6_20"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-17402-6_20"},{"@type":"DOI","@value":"10.48550/arxiv.1903.06289"}],"notation":[{"@value":"The Parameterized Position Heap of a Trie"}]},{"@id":"https://cir.nii.ac.jp/crid/1360853567473540096","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-59212-7_15"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-59212-7_15"},{"@type":"DOI","@value":"10.48550/arxiv.2005.09524"}],"notation":[{"@value":"On Repetitiveness Measures of Thue-Morse Words"}]},{"@id":"https://cir.nii.ac.jp/crid/1360294643862785152","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/globecom46510.2021.9685996"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9685019/9685006/09685996.pdf?arnumber=9685996"}],"notation":[{"@value":"Improved UCB-based Energy-Efficient Channel Selection in Hybrid-Band Wireless Communication"}]},{"@id":"https://cir.nii.ac.jp/crid/1360017279836417408","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/access.2023.3244781"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/6287639/10005208/10044086.pdf?arnumber=10044086"}],"notation":[{"@value":"Load Balancing Multi-Player MAB Approaches for RIS-Aided mmWave User Association"}]},{"@id":"https://cir.nii.ac.jp/crid/1361694366647561600","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.dam.2019.01.014"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0166218X19300319?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0166218X19300319?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1605.09558"}],"notation":[{"@value":"Dynamic index and LZ factorization in compressed space"}]},{"@id":"https://cir.nii.ac.jp/crid/1360294643746528768","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-75242-2_18"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-75242-2_18"},{"@type":"DOI","@value":"10.48550/arxiv.2012.10092"}],"notation":[{"@value":"The Parameterized Suffix Tray"}]},{"@id":"https://cir.nii.ac.jp/crid/1360576118723719040","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2021.07.011"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397521004084?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397521004084?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1901.10633"}],"notation":[{"@value":"Efficiently computing runs on a trie"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295168","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"en","@value":"Simplified and unified analysis of various learning problems by reduction to Multiple-Instance Learning"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861705570987904","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/s22062179"},{"@type":"URI","@value":"https://www.mdpi.com/1424-8220/22/6/2179/pdf"},{"@type":"PMID","@value":"35336350"}],"notation":[{"@value":"Two-Stage Multiarmed Bandit for Reconfigurable Intelligent Surface Aided Millimeter Wave Communications"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861707393434368","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/lwc.2022.3164939"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/5962382/9790070/09749767.pdf?arnumber=9749767"}],"notation":[{"@value":"Energy Aware Multiarmed Bandit for Millimeter Wave-Based UAV Mounted RIS Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360579813386814208","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/electronics11071014"},{"@type":"URI","@value":"https://www.mdpi.com/2079-9292/11/7/1014/pdf"}],"notation":[{"@value":"A Compression-Based Multiple Subword Segmentation for Neural Machine Translation"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861707393201920","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/access.2022.3202956"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/6287639/9668973/09869817.pdf?arnumber=9869817"},{"@type":"DOI","@value":"10.60692/hhst5-cct22"},{"@type":"DOI","@value":"10.60692/wffa8-t3714"}],"notation":[{"@value":"AI-Enabled UAV Communications: Challenges and Future Directions"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295043","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2022.26"}],"notation":[{"@language":"en","@value":"{RePair} Grammars Are the Smallest Grammars for Fibonacci Words"}]},{"@id":"https://cir.nii.ac.jp/crid/1360862714698688256","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s00453-021-00886-9"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s00453-021-00886-9.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s00453-021-00886-9/fulltext.html"}],"notation":[{"@value":"Approximating Dynamic Weighted Vertex Cover with Soft Capacities"}]},{"@id":"https://cir.nii.ac.jp/crid/1360013168886077696","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/lwc.2021.3074972"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/5962382/9478310/09410584.pdf?arnumber=9410584"}],"notation":[{"@value":"Two-Hop Relay Probing in WiGig Device-to-Device Networks Using Sleeping Contextual Bandits"}]},{"@id":"https://cir.nii.ac.jp/crid/1390010292508645632","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transinf.2021fcp0003"},{"@type":"HDL","@value":"http://hdl.handle.net/10466/0002001115"},{"@type":"URI","@value":"https://omu.repo.nii.ac.jp/records/2001115"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021FCP0003/_pdf"},{"@type":"NAID","@value":"130008165588"}],"notation":[{"@language":"en","@value":"Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295047","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2022.14"}],"notation":[{"@language":"en","@value":"Cartesian Tree Subsequence Matching"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142679881984","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2020.09.017"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397520305181?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397520305181?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1905.12854"}],"notation":[{"@value":"Space-efficient algorithms for computing minimal/shortest unique substrings"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295049","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.ISAAC.2022.15"}],"notation":[{"@language":"en","@value":"Computing Palindromes on a Trie in Linear Time"}]},{"@id":"https://cir.nii.ac.jp/crid/1010299673878211332","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"en","@value":"An online semi-definite programming with a generalised log-determinant regularizer and its applications"}]},{"@id":"https://cir.nii.ac.jp/crid/1010299673878211333","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"en","@value":"Expert advice problem with noisy low rank loss"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679357980928","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transinf.2017fcp0010"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transinf/E101.D/3/E101.D_2017FCP0010/_pdf"},{"@type":"NAID","@value":"130006414054"}],"notation":[{"@language":"en","@value":"Approximate Frequent Pattern Discovery in Compressed Space"}]},{"@id":"https://cir.nii.ac.jp/crid/1360286992291590528","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2018.06.044"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397518304602?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397518304602?httpAccept=text/plain"}],"notation":[{"@value":"On the size of the smallest alphabet for Lyndon trees"}]},{"@id":"https://cir.nii.ac.jp/crid/1010285300474909450","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2018.2"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2018.2"}],"notation":[{"@language":"ja","@value":"Order-Preserving Pattern Matching Indeterminate Strings"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295055","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.SWAT.2022.33"}],"notation":[{"@language":"en","@value":"Space-Efficient Data Structure for Posets with Applications"}]},{"@id":"https://cir.nii.ac.jp/crid/1010299673878211344","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.1016/j.ip1.2021.106097"}],"notation":[{"@language":"en","@value":"Longest previous overlapping factor array"}]},{"@id":"https://cir.nii.ac.jp/crid/1010299673878211343","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"en","@value":"Counting Lyndon Subsequences"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295057","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.ESA.2022.12"}],"notation":[{"@language":"en","@value":"Computing NP-Hard Repetitiveness Measures via MAX-SAT"}]},{"@id":"https://cir.nii.ac.jp/crid/1010299673878211347","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2021.7"}],"notation":[{"@language":"en","@value":"Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time"}]},{"@id":"https://cir.nii.ac.jp/crid/1360286990077157888","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-32686-9_3"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-32686-9_3"},{"@type":"DOI","@value":"10.48550/arxiv.1906.00809"},{"@type":"HANDLE","@value":"11568/1097639"}],"notation":[{"@value":"Rpair: Rescaling RePair with Rsync"}]},{"@id":"https://cir.nii.ac.jp/crid/1050298532704748288","@type":"Article","resourceType":"会議発表資料(conference paper)","productIdentifier":[{"@type":"HDL","@value":"https://hdl.handle.net/2324/2320605"},{"@type":"DOI","@value":"10.23919/isita.2018.8664224"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/8660385/8664205/08664224.pdf?arnumber=8664224"},{"@type":"NAID","@value":"120006707035"}],"notation":[{"@language":"en","@value":"Combinatorial Online Prediction"}]},{"@id":"https://cir.nii.ac.jp/crid/1010290617246667393","@type":"Article","resourceType":"学術雑誌論文(journal article)","notation":[{"@language":"ja","@value":"Indexing the Bijective BWT"}]},{"@id":"https://cir.nii.ac.jp/crid/1361975839937418368","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-32686-9_12"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-32686-9_12"},{"@type":"DOI","@value":"10.48550/arxiv.1906.05486"}],"notation":[{"@value":"On Longest Common Property Preserved Substring Queries"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004230496064640","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-00479-8_21"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-00479-8_21"}],"notation":[{"@value":"Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays"}]},{"@id":"https://cir.nii.ac.jp/crid/1360568465058616960","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-39881-1_26"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-39881-1_26"},{"@type":"DOI","@value":"10.48550/arxiv.1911.10719"}],"notation":[{"@value":"Faster Privacy-Preserving Computation of Edit Distance with Moves"}]},{"@id":"https://cir.nii.ac.jp/crid/1360849940030580736","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-32686-9_8"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-32686-9_8"}],"notation":[{"@value":"Compact Data Structures for Shortest Unique Substring Queries"}]},{"@id":"https://cir.nii.ac.jp/crid/1361694364964813184","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-38919-2_11"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-38919-2_11"},{"@type":"DOI","@value":"10.48550/arxiv.2001.05671"}],"notation":[{"@value":"Faster STR-EC-LCS Computation"}]},{"@id":"https://cir.nii.ac.jp/crid/1390564238049487360","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transinf.2017edp7195"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transinf/E101.D/12/E101.D_2017EDP7195/_pdf"},{"@type":"NAID","@value":"130007539376"}],"notation":[{"@language":"en","@value":"Discovering Co-Cluster Structure from Relationships between Biased Objects"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204381260416","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transinf.2017edp7233"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transinf/E101.D/3/E101.D_2017EDP7233/_pdf"},{"@type":"NAID","@value":"130006414035"}],"notation":[{"@language":"en","@value":"Efficient Reformulation of 1-Norm Ranking SVM"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845712994315264","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transfun.e101.a.1334"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transfun/E101.A/9/E101.A_1334/_pdf"},{"@type":"NAID","@value":"130007479529"}],"notation":[{"@language":"en","@value":"Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1360853567473556608","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s00224-020-09980-x"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s00224-020-09980-x.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s00224-020-09980-x/fulltext.html"},{"@type":"DOI","@value":"10.48550/arxiv.1903.06290"}],"notation":[{"@value":"Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861707385216640","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s12652-022-04475-8"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s12652-022-04475-8.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s12652-022-04475-8/fulltext.html"}],"notation":[{"@value":"Dual objective bandit for best channel selection in hybrid band wireless systems"}]},{"@id":"https://cir.nii.ac.jp/crid/1360005515100446336","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-32686-9_27"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-32686-9_27"},{"@type":"DOI","@value":"10.48550/arxiv.1906.00563"}],"notation":[{"@value":"Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657150152448","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.ipl.2017.08.006"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0020019017301485?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0020019017301485?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1612.07475"}],"notation":[{"@value":"A hardness result and new algorithm for the longest common palindromic subsequence problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567180449484544","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-00479-8_15"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-00479-8_15"},{"@type":"DOI","@value":"10.48550/arxiv.1806.00198"}],"notation":[{"@value":"Block Palindromes: A New Generalization of Palindromes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580232178909056","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-031-20643-6_10"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-031-20643-6_10"}],"notation":[{"@value":"Substring Complexities on Run-Length Compressed Strings"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657195106176","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.jda.2018.11.009"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S1570866718301527?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S1570866718301527?httpAccept=text/plain"}],"notation":[{"@value":"Algorithms and combinatorial properties on shortest unique palindromic substrings"}]},{"@id":"https://cir.nii.ac.jp/crid/1360017279825234816","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/s00224-022-10070-3"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/s00224-022-10070-3.pdf"},{"@type":"URI","@value":"https://link.springer.com/article/10.1007/s00224-022-10070-3/fulltext.html"}],"notation":[{"@value":"Factorizing Strings into Repetitions"}]},{"@id":"https://cir.nii.ac.jp/crid/1360017282188211584","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2022.09.008"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397522005436?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397522005436?httpAccept=text/plain"}],"notation":[{"@value":"Parameterized DAWGs: Efficient constructions and bidirectional pattern searches"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861704797871488","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/access.2022.3195303"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/6287639/9668973/09845409.pdf?arnumber=9845409"}],"notation":[{"@value":"Cost-Effective MAB Approaches for Reconfigurable Intelligent Surface Aided Millimeter Wave Relaying"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295171","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.1016/j.jc.2022.104999"}],"notation":[{"@language":"en","@value":"Sensitivity of string compressors and repetitiveness measures"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295169","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2022.11"}],"notation":[{"@language":"en","@value":"Bi-Directional r-Indexes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142544036224","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2021.01.014"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S030439752100027X?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S030439752100027X?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1901.10722"}],"notation":[{"@value":"Computing longest palindromic substring after single-character or block-wise edits"}]},{"@id":"https://cir.nii.ac.jp/crid/1360013168769823616","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-86692-1_10"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-86692-1_10"},{"@type":"DOI","@value":"10.48550/arxiv.2106.01173"}],"notation":[{"@value":"On the Approximation Ratio of LZ-End to LZ77"}]},{"@id":"https://cir.nii.ac.jp/crid/1360576118838678912","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-86692-1_12"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-86692-1_12"}],"notation":[{"@value":"Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree"}]},{"@id":"https://cir.nii.ac.jp/crid/1010866647402295176","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2022.27"}],"notation":[{"@language":"en","@value":"Minimal Absent Words on Run-Length Encoded Strings"}]},{"@id":"https://cir.nii.ac.jp/crid/1360016861600904576","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/dcc52660.2022.00014"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/9810654/9810655/09810687.pdf?arnumber=9810687"},{"@type":"DOI","@value":"10.48550/arxiv.2110.01181"}],"notation":[{"@value":"FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580229790380032","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-031-06678-8_10"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-031-06678-8_10"}],"notation":[{"@value":"Computing Longest (Common) Lyndon Subsequences"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004235187470720","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1109/dcc.2018.00061"},{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx7/8415925/8416564/08416625.pdf?arnumber=8416625"},{"@type":"DOI","@value":"10.48550/arxiv.1706.10061"}],"notation":[{"@value":"Compaction of Church Numerals for Higher-Order Compression"}]},{"@id":"https://cir.nii.ac.jp/crid/1010566775383392640","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.SEA.2018.5"},{"@type":"DOI","@value":"10.4230/lipics.sea.2018.5"}],"notation":[{"@language":"ja","@value":"Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints"}]},{"@id":"https://cir.nii.ac.jp/crid/1360290617487798272","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-59212-7_11"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-59212-7_11"},{"@type":"DOI","@value":"10.48550/arxiv.2006.00216"}],"notation":[{"@value":"Longest Square Subsequence Problem Revisited"}]},{"@id":"https://cir.nii.ac.jp/crid/1360290617724625536","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-59212-7_16"},{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-030-59212-7_16"},{"@type":"DOI","@value":"10.48550/arxiv.1910.07145"},{"@type":"HANDLE","@value":"11568/1097617"}],"notation":[{"@value":"Practical Random Access to SLP-Compressed Texts"}]},{"@id":"https://cir.nii.ac.jp/crid/1010285300474909440","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2018.19"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2018.19"}],"notation":[{"@language":"ja","@value":"Longest Lyndon Substring After Edit"}]},{"@id":"https://cir.nii.ac.jp/crid/1010285300474909441","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2018.12"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2018.12"}],"notation":[{"@language":"ja","@value":"Longest substring palindrome after edit"}]},{"@id":"https://cir.nii.ac.jp/crid/1010285300474909442","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2018.15"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2018.15"}],"notation":[{"@language":"ja","@value":"Computing longest common square subsequences"}]},{"@id":"https://cir.nii.ac.jp/crid/1010285300474909444","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2018.7"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2018.7"}],"notation":[{"@language":"ja","@value":"Online LZ77 Parsing and Matching Statistics with RLBWTs"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845712966153728","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1587/transinf.2017edp7317"},{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transinf/E101.D/6/E101.D_2017EDP7317/_pdf"},{"@type":"DOI","@value":"10.48550/arxiv.1710.10002"},{"@type":"NAID","@value":"130007382405"}],"notation":[{"@language":"en","@value":"Online Linear Optimization with the Log-Determinant Regularizer"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285707499333248","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2018.06.033"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397518304493?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397518304493?httpAccept=text/plain"}],"notation":[{"@value":"Improved upper bounds on all maximal α-gapped repeats and palindromes"}]},{"@id":"https://cir.nii.ac.jp/crid/1010285300474909449","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2018.9"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2018.9"}],"notation":[{"@language":"ja","@value":"Faster Online Elastic Degenerate String Matching"}]},{"@id":"https://cir.nii.ac.jp/crid/1010005505720482304","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI_AS_WRITTEN","@value":"10.4230/LIPIcs.CPM.2019.29"},{"@type":"DOI","@value":"10.4230/lipics.cpm.2019.29"}],"notation":[{"@language":"ja","@value":"On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360287219259390464","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/a12080159"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/12/8/159/pdf"},{"@type":"HANDLE","@value":"2115/75613"}],"notation":[{"@value":"Compaction of Church Numerals"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580232391891712","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-031-20643-6_3"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-031-20643-6_3"}],"notation":[{"@value":"Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142581361664","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1016/j.tcs.2019.10.025"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397519306541?httpAccept=text/xml"},{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S0304397519306541?httpAccept=text/plain"},{"@type":"DOI","@value":"10.48550/arxiv.1609.03000"}],"notation":[{"@value":"Efficient computation of longest single-arm-gapped palindromes in a string"}]},{"@id":"https://cir.nii.ac.jp/crid/1360294643746540928","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.1007/978-3-030-86692-1_8"},{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-030-86692-1_8"},{"@type":"DOI","@value":"10.48550/arxiv.2105.13744"}],"notation":[{"@value":"Grammar Index by Induced Suffix Sorting"}]},{"@id":"https://cir.nii.ac.jp/crid/1360850169212837632","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/a13040103"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/13/4/103/pdf"}],"notation":[{"@value":"Practical Grammar Compression Based on Maximal Repeats"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567189424672640","@type":"Article","resourceType":"学術雑誌論文(journal article)","productIdentifier":[{"@type":"DOI","@value":"10.3390/a12030052"},{"@type":"URI","@value":"https://www.mdpi.com/1999-4893/12/3/52/pdf"}],"notation":[{"@value":"Space-Efficient Fully Dynamic DFS in Undirected Graphs †"}]}],"dataSourceIdentifier":[{"@type":"KAKEN","@value":"18H04098"}],"grant":{"grantIdentifier":[{"@type":"NII","@value":"68"}],"jpcoar:fundingStream":[{"@language":"ja","@value":"基盤研究(A)"},{"@language":"en","@value":"Grant-in-Aid for Scientific Research (A)"}]},"allocationClassification":[{"notation":[{"@language":"ja","@value":"補助金"},{"@language":"en","@value":"Single-year Grants"}]}],"projectStatus":"discontinued","allocationAmount":{"totalCost":{"amount":"43160000","currency":"JPY"},"breakdownCost":[{"notation":[{"@language":"ja","@value":"直接経費"},{"@language":"en","@value":"Direct Cost"}],"amount":"33200000","currency":"JPY"},{"notation":[{"@language":"ja","@value":"間接経費"},{"@language":"en","@value":"Indirect Cost"}],"amount":"9960000","currency":"JPY"}]}}