default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyumi Shinohara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c125]Yutaro Numaya, Yoshito Kawasaki, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets. SOFSEM (2) 2025: 211-224- 2024
- [j32]Davaajav Jargalsaikhan, Diptarama Hendrian, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara:
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm. Acta Informatica 61(4): 415-444 (2024) - [c124]Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Algorithms for Galois Words: Detection, Factorization, and Rotation. CPM 2024: 18:1-18:16 - [c123]Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. ICALP 2024: 89:1-89:19 - [c122]Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. SOFSEM 2024: 340-354 - [i26]Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Algorithms for Galois Words: Detection, Factorization, and Rotation. CoRR abs/2403.02636 (2024) - [i25]Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Subsequence Pattern Matching with Segment Number Constraint. CoRR abs/2407.19796 (2024) - 2023
- [c121]Yutaro Numaya, Diptarama Hendrian
, Ryo Yoshinaka, Ayumi Shinohara:
Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data. ICGI 2023: 23-34 - [c120]Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Efficient Parameterized Pattern Matching in Sublinear Space. SPIRE 2023: 271-283 - [c119]Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Inferring Strings from Position Heaps in Linear Time. WALCOM 2023: 115-126 - [i24]Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Efficient Parameterized Pattern Matching in Sublinear Space. CoRR abs/2306.10714 (2023) - [i23]Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. CoRR abs/2308.05977 (2023) - 2022
- [j31]Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda:
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. 933: 21-42 (2022) - [c118]Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. CPM 2022: 28:1-28:21 - [c117]Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Computing the Parameterized Burrows-Wheeler Transform Online. SPIRE 2022: 70-85 - [i22]Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Parallel algorithm for pattern matching problems under substring consistent equivalence relations. CoRR abs/2202.13284 (2022) - [i21]Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Computing the Parameterized Burrows-Wheeler Transform Online. CoRR abs/2206.15100 (2022) - [i20]Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Inferring strings from position heaps in linear time. CoRR abs/2209.12405 (2022) - 2021
- [c116]Ryuta Kambe, Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka:
Inside-Outside Algorithm for Macro Grammars. ICGI 2021: 32-46 - [c115]Kaito Suzuki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning Algorithm for Symbolic Weighted Finite Automata. ICGI 2021: 202-216 - 2020
- [j30]Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Efficient computation of longest single-arm-gapped palindromes in a string. Theor. Comput. Sci. 812: 160-173 (2020) - [j29]Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Linear-time online algorithm for inferring the shortest path graph from a walk label. Theor. Comput. Sci. 812: 187-202 (2020) - [c114]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM 2020: 12:1-12:11 - [c113]Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara:
In-Place Bijective Burrows-Wheeler Transforms. CPM 2020: 21:1-21:15 - [c112]Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda:
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM 2020: 26:1-26:14 - [c111]Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi:
Grammar Compression with Probabilistic Context-Free Grammar. DCC 2020: 386 - [c110]Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
AOBA: An Online Benchmark Tool for Algorithms in Stringology. SOFSEM (Doctoral Student Research Forum) 2020: 1-12 - [c109]Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
An Extension of Linear-size Suffix Tries for Parameterized Strings. SOFSEM (Doctoral Student Research Forum) 2020: 97-108 - [c108]Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. SOFSEM 2020: 211-222 - [c107]Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Computing Covers Under Substring Consistent Equivalence Relations. SPIRE 2020: 131-146 - [c106]Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences. SEA 2020: 13:1-13:13 - [i19]Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Computing Covers under Substring Consistent Equivalence Relations. CoRR abs/2002.06764 (2020) - [i18]Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda:
DAWGs for parameterized matching: online construction and related indexing structures. CoRR abs/2002.06786 (2020) - [i17]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR abs/2002.06796 (2020) - [i16]Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Fast and linear-time string matching algorithms based on the distances of q-gram occurrences. CoRR abs/2002.08004 (2020) - [i15]Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi:
Grammar compression with probabilistic context-free grammar. CoRR abs/2003.08097 (2020) - [i14]Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara:
In-Place Bijective Burrows-Wheeler Transforms. CoRR abs/2004.12590 (2020)
2010 – 2019
- 2019
- [j28]Diptarama Hendrian, Yohei Ueki, Kazuyuki Narisawa, Ryo Yoshinaka, Ayumi Shinohara:
Permuted Pattern Matching Algorithms on Multi-Track Strings. Algorithms 12(4): 73 (2019) - [j27]Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Efficient dynamic dictionary matching with DAWGs and AC-automata. Theor. Comput. Sci. 792: 161-172 (2019) - [c105]Hiroyuki Nishinoma, Beokhaimook Chayapol, Kazunori Ohno, Ayumi Shinohara, Satoshi Tadokoro:
Development of a Lightweight Cyber-enhanced Rescue Canine Suit with Heat Protection and Anti-slip Countermeasures. SSRR 2019: 74-80 - [c104]Satoshi Kobayashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm. Stringology 2019: 56-68 - [c103]Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning Algorithm for Residual Symbolic Finite Automata. GandALF 2019: 140-153 - [p1]Kazunori Ohno, Ryunosuke Hamada, Tatsuya Hoshi, Hiroyuki Nishinoma, Shumpei Yamaguchi, Solvi Arnold, Kimitoshi Yamazaki, Takefumi Kikusui, Satoko Matsubara, Miho Nagasawa, Takatomi Kubo, Eri Nakahara, Yuki Maruno, Kazushi Ikeda, Toshitaka Yamakawa, Takeshi Tokuyama, Ayumi Shinohara, Ryo Yoshinaka, Diptarama Hendrian, Kaizaburo Chubachi, Satoshi Kobayashi, Katsuhito Nakashima, Hiroaki Naganuma, Ryu Wakimoto, Shu Ishikawa, Tatsuki Miura, Satoshi Tadokoro:
Cyber-Enhanced Rescue Canine. Disaster Robotics 2019: 143-193 - [i13]Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Linear-size Suffix Tries for Parameterized Strings. CoRR abs/1902.00216 (2019) - 2018
- [j26]Masayuki Numao, Yutaka Matsuo, Ayumi Shinohara, Masaki Suwa:
Renewal of the Major Fields from New Generation Computing Vol. 36 (2018). New Gener. Comput. 36(2): 91-93 (2018) - [c102]Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
New Variants of Pattern Matching with Constants and Variables. SOFSEM 2018: 611-623 - [c101]Davaajav Jargalsaikhan, Diptarama, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara:
Duel and Sweep Algorithm for Order-Preserving Pattern Matching. SOFSEM 2018: 624-635 - [c100]Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk. SPIRE 2018: 311-324 - [c99]Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Enumeration of Cryptarithms Using Deterministic Finite Automata. CIAA 2018: 286-298 - [i12]Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk. CoRR abs/1806.09806 (2018) - [i11]Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Ayumi Shinohara:
Enumerating Cryptarithms Using Deterministic Finite Automata. CoRR abs/1807.11580 (2018) - 2017
- [c98]Hayato Mizumoto, Shota Todoroki, Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
An efficient query learning algorithm for zero-suppressed binary decision diagrams. ALT 2017: 360-371 - [c97]Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Parameterized Strings. CPM 2017: 8:1-8:13 - [c96]Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara:
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. SOFSEM 2017: 363-374 - [c95]Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Computing Longest Single-arm-gapped Palindromes in a String. SOFSEM 2017: 375-386 - [i10]Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Parameterized Strings. CoRR abs/1702.02321 (2017) - [i9]Davaajav Jargalsaikhan, Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
Duel and sweep algorithm for order-preserving pattern matching. CoRR abs/1705.09438 (2017) - [i8]Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
New Variants of Pattern Matching with Constants and Variables. CoRR abs/1705.09504 (2017) - [i7]Diptarama, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Efficient Dynamic Dictionary Matching with DAWGs and AC-automata. CoRR abs/1710.03395 (2017) - 2016
- [c94]Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara:
Generalization of Efficient Implementation of Compression by Substring Enumeration. DCC 2016: 630 - [c93]Kotaro Takeda, Naoki Kobayashi, Kazuya Yaguchi, Ayumi Shinohara:
Compact bit encoding schemes for simply-typed lambda-terms. ICFP 2016: 146-157 - [c92]Ichinari Sato, Diptarama, Ayumi Shinohara:
Visualization and Analysis of Electrical Energy Consumption in Laboratories. IIAI-AAI 2016: 509-512 - [c91]Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
QBF Encoding of Generalized Tic-Tac-Toe. QBF@SAT 2016: 14-26 - [c90]Diptarama, Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara:
KMP Based Pattern Matching Algorithms for Multi-Track Strings. SOFSEM (Student Research Forum Papers / Posters) 2016: 100-107 - [c89]Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara:
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions. SOFSEM (Student Research Forum Papers / Posters) 2016: 108-115 - [c88]Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching. SPIRE 2016: 110-121 - [c87]Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings. Stringology 2016: 7-21 - [r1]Masayuki Takeda, Ayumi Shinohara:
Pattern Matching on Compressed Text. Encyclopedia of Algorithms 2016: 1538-1542 - [i6]Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Computing longest single-arm-gapped palindromes in a string. CoRR abs/1609.03000 (2016) - [i5]Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara:
Longest Common Subsequence in at Least k Length Order-isomorphic Substrings. CoRR abs/1609.03668 (2016) - 2015
- [j25]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. Inf. Comput. 240: 74-89 (2015) - [c86]Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Permuted Pattern Matching on Multi-Track String. SOFSEM (Student Research Forum Papers / Posters) 2015: 41-53 - 2014
- [j24]Kazuhiko Kusano, Ayumi Shinohara:
Average number of occurrences of repetitions in a necklace. Discret. Appl. Math. 163: 334-342 (2014) - [c85]Kazuya Yaguchi, Naoki Kobayashi, Ayumi Shinohara:
Efficient Algorithm and Coding for Higher-Order Compression. DCC 2014: 434 - [c84]Yusuke Sato, Kazuyuki Narisawa, Ayumi Shinohara:
A Simple Classification Method for Class Imbalanced Data using the Kernel Mean. KDIR 2014: 327-334 - [c83]Kouta Oguni, Kazuyuki Narisawa, Ayumi Shinohara:
Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities. ICAART (1) 2014: 632-638 - [c82]Tomoki Komatsu, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara:
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints. SOFSEM 2014: 363-374 - 2013
- [c81]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting Regularities on Grammar-Compressed Strings. MFCS 2013: 571-582 - [c80]Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga:
Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: 280-291 - [c79]Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara:
On Morphisms Generating Run-Rich Strings. Stringology 2013: 35-47 - [i4]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 (2013) - 2012
- [j23]Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, Kazuya Yaguchi:
Functional programs as compressed data. High. Order Symb. Comput. 25(1): 39-84 (2012) - [c78]Junya Saito, Kazuyuki Narisawa, Ayumi Shinohara:
Prediction for Control Delay on Reinforcement Learning. ICAART (1) 2012: 579-586 - [c77]Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara:
Functional programs as compressed data. PEPM 2012: 121-130 - [c76]Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara:
Computing Maximum Number of Runs in Strings. SPIRE 2012: 318-329 - 2010
- [j22]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chic. J. Theor. Comput. Sci. 2010 (2010) - [c75]Kengo Matsuta, Hayato Kobayashi, Ayumi Shinohara:
Multi-target adaptive A. AAMAS 2010: 1065-1072 - [c74]Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Inferring Strings from Runs. Stringology 2010: 150-160 - [c73]Kazuhiko Kusano, Ayumi Shinohara:
Average Number of Runs and Squares in Necklace. Stringology 2010: 167-177 - [c72]Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson:
The Number of Runs in a Ternary Word. Stringology 2010: 178-181
2000 – 2009
- 2009
- [j21]Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara:
Linear-Time Text Compression by Longest-First Substitution. Algorithms 2(4): 1429-1448 (2009) - [j20]Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Joshua Gramm, Akira Ishino, Ayumi Shinohara:
Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots. IEICE Trans. Inf. Syst. 92-D(9): 1752-1761 (2009) - [j19]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Average Value of Sum of Exponents of Runs in a String. Int. J. Found. Comput. Sci. 20(6): 1135-1146 (2009) - [j18]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10): 900-913 (2009) - [c71]Tatsuya Kasai, Hayato Kobayashi, Ayumi Shinohara:
Improvement of the performance using received message on learning of communication codes. AAMAS (2) 2009: 1229-1230 - [c70]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. CATS 2009: 19-28 - [c69]Hayato Kobayashi, Ayumi Shinohara:
Complexity of Teaching by a Restricted Number of Examples. COLT 2009 - [c68]Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara:
A Series of Run-Rich Strings. LATA 2009: 578-587 - [c67]Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Bit-parallel Algorithms for Computing all the Runs in a String. Stringology 2009: 203-213 - 2008
- [c66]Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Akira Ishino, Ayumi Shinohara:
Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. RoboCup 2008: 109-120 - [c65]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375 - [c64]Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. Stringology 2008: 140-145 - [c63]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Average Value of Sum of Exponents of Runs in Strings. Stringology 2008: 185-192 - [i3]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program. Structure-Based Compression of Complex Massive Data 2008 - [i2]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. CoRR abs/0804.1214 (2008) - 2007
- [c62]Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara:
Reducing Trials by Thinning-Out in Skill Discovery. Discovery Science 2007: 127-138 - 2006
- [c61]Hayato Kobayashi, Akira Ishino, Ayumi Shinohara:
A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. IAS 2006: 660-667 - [c60]Jun Inoue, Akira Ishino, Ayumi Shinohara:
Ball tracking with velocity based on Monte-Carlo localization. IAS 2006: 686-693 - [c59]Hayato Kobayashi, Tsugutoyo Osaki, Eric Williams, Akira Ishino, Ayumi Shinohara:
Autonomous Learning of Ball Trapping in the Four-Legged Robot League. RoboCup 2006: 86-97 - 2005
- [j17]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-line construction of compact directed acyclic word graphs. Discret. Appl. Math. 146(2): 156-179 (2005) - [j16]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
A fully compressed pattern matching algorithm for simple collage systems. Int. J. Found. Comput. Sci. 16(6): 1155-1166 (2005) - [j15]Zdenek Tronícek, Ayumi Shinohara:
The size of subsequence automaton. Theor. Comput. Sci. 341(1-3): 379-384 (2005) - [c58]Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Fully Incremental LCS Computation. FCT 2005: 563-574 - [c57]Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara:
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. SOFSEM 2005: 380-384 - [c56]Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara:
New Bit-Parallel Indel-Distance Algorithm. WEA 2005: 380-390 - 2004
- [j14]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano:
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinform. Comput. Biol. 2(2): 273-288 (2004) - [j13]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1): 33-51 (2004) - [j12]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 159-170 (2004) - [j11]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004) - [c55]Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda:
On Bit-Parallel Processing of Multi-byte Text. AIRS 2004: 289-300 - [c54]Ayumi Shinohara:
String Pattern Discovery. ALT 2004: 1-13 - [c53]Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science 2004: 32-46 - [c52]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. Developments in Language Theory 2004: 225-236 - [c51]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113 - [c50]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
Finding Optimal Pairs of Patterns. WABI 2004: 450-462 - 2003
- [j10]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. 10(1): 2-12 (2003) - [j9]Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda:
Uniform characterizations of polynomial-query learnabilities. Theor. Comput. Sci. 292(2): 377-385 (2003) - [j8]Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci. 292(2): 465-479 (2003) - [j7]Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 298(1): 253-272 (2003) - [c49]Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa:
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 - [c48]Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda:
On the Length of the Minimum Solution of Word Equations in One Variable. MFCS 2003: 189-197 - [c47]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 - [c46]Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara:
Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152 - [c45]Zdenek Tronícek, Ayumi Shinohara:
The Size of Subsequence Automaton. SPIRE 2003: 304-310 - [c44]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130 - 2002
- [c43]Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa:
The Minimum DAWG for All Suffixes of a String and Its Applications. CPM 2002: 153-167 - [c42]Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 - [c41]Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga:
Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 - [c40]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa:
Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352 - [c39]Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa:
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. SPIRE 2002: 170-186 - [c38]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 - [c37]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. Stringology 2002: 9-17 - [e2]Setsuo Arikawa, Ayumi Shinohara:
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project. Lecture Notes in Computer Science 2281, Springer 2002, ISBN 3-540-43338-4 [contents] - 2001
- [c36]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-Line Construction of Compact Directed Acyclic Word Graphs. CPM 2001: 169-180 - [c35]Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206 - [c34]Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468 - [c33]Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469- - [c32]Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri:
Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. Discovery Science 2001: 416-428 - [c31]Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 - [c30]Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara:
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. ISAAC 2001: 719-730 - [c29]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110 - [c28]T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo:
Musical Sequence Comparison for Melodic and Rhythmic Similarities. SPIRE 2001: 111-122 - [c27]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Construction of the CDAWG for a Trie. Stringology 2001: 37-48 - [e1]Klaus P. Jantke, Ayumi Shinohara:
Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings. Lecture Notes in Computer Science 2226, Springer 2001, ISBN 3-540-42956-5 [contents] - 2000
- [j6]Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara:
Polynomial-time Learning of Elementary Formal Systems. New Gener. Comput. 18(3): 217-242 (2000) - [c26]Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa:
Speeding Up Pattern Matching by Text Compression. CIAC 2000: 306-315 - [c25]Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194 - [c24]Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154 - [c23]Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138 - [c22]Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152 - [c21]Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228
1990 – 1999
- 1999
- [c20]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13 - [c19]Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49 - [c18]Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki:
Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. Discovery Science 1999: 359-361 - [c17]Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96 - 1998
- [j5]Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara:
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. Inf. Process. Lett. 66(4): 165-170 (1998) - [c16]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa:
Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112 - [c15]Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda:
Uniform Characterizations of Polynomial-Query Learnabilities. Discovery Science 1998: 84-92 - 1997
- [j4]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997) - [c14]Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda:
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. CPM 1997: 1-11 - [c13]Satoshi Matsumoto, Ayumi Shinohara:
Learning Pattern Languages Using Queries. EuroCOLT 1997: 185-197 - 1996
- [c12]Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara:
On the Hardness of Approximating the Minimum Consistent OBDD Problem. SWAT 1996: 112-123 - 1995
- [j3]Ayumi Shinohara:
Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. Theor. Comput. Sci. 137(1): 129-144 (1995) - [c11]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions. CPM 1995: 205-214 - [c10]Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara:
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. ISMB 1995: 359-366 - [c9]Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara:
Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. Machine Intelligence 15 1995: 227-247 - [i1]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c8]Satoshi Matsumoto, Ayumi Shinohara:
Refutably Probably Approximately Correct Learning. AII/ALT 1994: 469-483 - [c7]Ayumi Shinohara:
Complexity of Computing Generalized VC-Dimensions. ECML 1994: 415-418 - [c6]Satoru Miyano, Ayumi Shinohara:
Machine Learning and Discovery for Bloinformatics: Introduction. HICSS (5) 1994: 111-112 - 1993
- [j2]Setsuo Arikawa, Satoru Miyano, Ayumi Shinohara, Satoru Kuhara, Yasuhito Mukouchi, Takeshi Shinohara:
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. New Gener. Comput. 11(3): 361-375 (1993) - [c5]Ayumi Shinohara:
Complexity of Computing Vapnik-Chervonenkis Dimension. ALT 1993: 279-287 - 1992
- [c4]Setsuo Arikawa, Satoru Kuhara, Satoru Miyano, Yasuhito Mukouchi, Ayumi Shinohara, Takeshi Shinohara:
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. FGCS 1992: 618-625 - 1991
- [j1]Ayumi Shinohara:
Teachability in Computational Learning. New Gener. Comput. 8(4): 337-347 (1991) - [c3]Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara:
Which classes of elementary formal systems are polynomial-time learnable. ALT 1991: 139-150 - [c2]Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara:
More About Learning Elementary Formal Systems. Nonmonotonic and Inductive Logic 1991: 107-117 - 1990
- [c1]Ayumi Shinohara, Satoru Miyano:
Teachability in Computational Learning. ALT 1990: 247-255
Coauthor Index
Diptarama
aka: Diptarama Hendrian
aka: Diptarama Hendrian
[j32] [c124] [c123] [c122] [i26] [c121] [c120] [c119] [i24] [i23] [j31] [c118] [c117] [i22] [i21] [i20] [c115] [j30] [j29] [c113] [c112] [c111] [c110] [c109] [c108] [c107] [c106] [i19] [i18] [i16] [i15] [i14] [j28] [j27] [c104] [c103] [p1] [i13] [c102] [c101] [c100] [c99] [i12] [i11] [c98] [c97] [c96] [c95] [i10] [i9] [i8] [i7] [c92] [c91] [c90] [c88] [c87] [i6] [i5]
[j31] [c114] [c112] [i18] [i17] [r1] [j25] [c81] [i4] [j21] [j17] [j16] [c58] [j14] [j13] [j12] [j11] [c55] [c53] [c52] [c51] [c50] [j10] [j9] [j8] [j7] [c49] [c48] [c47] [c46] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c17] [c16] [c15] [c14]
[c125] [j32] [c124] [c123] [c122] [i26] [i25] [c121] [c120] [c119] [i24] [i23] [j31] [c118] [c117] [i22] [i21] [i20] [c116] [c115] [j29] [c112] [c111] [c110] [c109] [c108] [c107] [c106] [i19] [i18] [i16] [i15] [j28] [j27] [c104] [c103] [p1] [i13] [c102] [c101] [c100] [c99] [i12] [i11] [c98] [c96] [i9] [i8] [i7] [c91] [c88] [c87] [i5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-11 20:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
