Masayuki Takeda
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
124
Venues
20
Active years
1997–2024
Best venue rank
A*
Where they publish
Papers
124 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | IWOCA | Computing Maximal Palindromes in Non-standard Matching Models. | Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | CIAC | The Parameterized Suffix Tray. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | Grammar Index by Induced Suffix Sorting. | Tooru Akagi, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | Longest Common Rollercoasters. | Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | On the Approximation Ratio of LZ-End to LZ77. | Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda |
| 2020 | CPM | Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
| 2020 | CPM | DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
| 2020 | DCC | c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. | Kazuya Tsuruta, Dominik Kppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SOFSEM | Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. | Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SOFSEM | Faster STR-EC-LCS Computation. | Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | On Repetitiveness Measures of Thue-Morse Words. | Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Towards Efficient Interactive Computation of Dynamic Time Warping Distance. | Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CIAC | The Parameterized Position Heap of a Trie. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Faster Queries for Longest Substring Palindrome After Block Edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Computing Runs on a Trie. | Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | ISAAC | An Improved Data Structure for Left-Right Maximal Generic Words Problem. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | IWOCA | Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. | Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | On Longest Common Property Preserved Substring Queries. | Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka |
| 2019 | SPIRE | Compact Data Structures for Shortest Unique Substring Queries. | Takuya Mieno, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Faster Online Elastic Degenerate String Matching. | Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest substring palindrome after edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Lyndon Factorization of Grammar Compressed Texts Revisited. | Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Computing longest common square subsequences. | Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyr, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest Lyndon Substring After Edit. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | SPIRE | Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. | Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Faster STR-IC-LCS Computation via RLE. | Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Tight Bounds on the Maximum Number of Shortest Unique Substrings. | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | ISAAC | Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | IWOCA | Shortest Unique Palindromic Substring Queries in Optimal Time. | Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | IWOCA | Computing Abelian String Regularities Based on RLE. | Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | MFCS | Small-Space LCE Data Structure with Constant-Time Queries. | Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2017 | SPIRE | Order Preserving Pattern Matching on Trees and DAGs. | Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | CPM | Factorizing a String into Squares in Linear Time. | Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea |
| 2016 | CPM | Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. | Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda |
| 2016 | ICAART | A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization. | Hirotaka Goto, Asuka Ohta, Tomofumi Matsuzawa, Munehiro Takimoto, Yasushi Kambayashi, Masayuki Takeda |
| 2016 | IWOCA | Finding Gapped Palindromes Online. | Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. | Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Shortest Unique Substring Queries on Run-Length Encoded Strings. | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Fully Dynamic Data Structure for LCE Queries in Compressed Space. | Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | CIAC | An Opportunistic Text Indexing Structure Based on Run Length Encoding. | Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | CPM | LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2015 | CPM | Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. | Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | ISAAC | Inferring Strings from Full Abelian Periods. | Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | SODA | A new characterization of maximal repetitions by Lyndon trees. | Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta |
| 2015 | SPIRE | A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. | Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | CPM | Computing Palindromic Factorizations and Palindromic Covers On-line. | Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | MFCS | Inferring Strings from Lyndon Factorization. | Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | STACS | Faster Compact On-Line Lempel-Ziv Factorization. | Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2014 | SOFSEM | Shortest Unique Substrings Queries in Optimal Time. | Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | CPM | Converting SLP to LZ78 in almost Linear Time. | Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda |
| 2013 | CPM | Efficient Lyndon Factorization of Grammar Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | From Run Length Encoding to LZ78 and Back Again. | Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | Computing Convolution on Grammar-Compressed Text. | Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | MFCS | Detecting Regularities on Grammar-Compressed Strings. | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara |
| 2013 | SPIRE | Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2012 | CPM | Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SOFSEM | Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SPIRE | Efficient LZ78 Factorization of Grammar Compressed Text. | Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SPIRE | Eager XPath Evaluation over XML Streams. | Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda |
| 2012 | SPIRE | The Position Heap of a Trie. | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2011 | CPM | Palindrome Pattern Matching. | Tomohiro I, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | CPM | Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | ISAAC | Online Linear Optimization over Permutations. | Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda |
| 2011 | SPIRE | Fast q-gram Mining on SLP Compressed Strings. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2010 | CPM | Verifying a Parameterized Border Array in | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2010 | DASFAA | Chimera: Stream-Oriented XML Filtering/Querying Engine. | Tatsuya Asai, Shin-ichiro Tago, Hiroya Inakoshi, Seishi Okamoto, Masayuki Takeda |
| 2010 | DIS | Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. | Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda |
| 2010 | SPIRE | Counting and Verifying Maximal Palindromes. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2009 | IWOCA | Lightweight Parameterized Suffix Array Construction. | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2009 | LATA | Counting Parameterized Border Arrays for a Binary Alphabet. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2008 | ALT | Smooth Boosting for Margin-Based Ranking. | Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda |
| 2008 | COLT | Online Learning of Maximum p-Norm Margin Classifiers with Bias. | Kosuke Ishibashi, Kohei Hatano, Masayuki Takeda |
| 2008 | DIS | String Kernels Based on Variable-Length-Don't-Care Patterns. | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda |
| 2008 | SPIRE | Context-Sensitive Grammar Transform: Compression and Pattern Matching. | Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda |
| 2007 | CPM | Efficient Computation of Substring Equivalence Classes with Suffix Arrays. | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2007 | DCC | Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. | Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2007 | DIS | Unsupervised Spam Detection Based on String Alienness Measures. | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda |
| 2006 | CPM | On-Line Linear-Time Construction of Word Suffix Trees. | Shunsuke Inenaga, Masayuki Takeda |
| 2006 | DIS | A New Family of String Classifiers Based on Local Relatedness. | Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2006 | SPIRE | Sparse Directed Acyclic Word Graphs. | Shunsuke Inenaga, Masayuki Takeda |
| 2005 | DIS | Practical Algorithms for Pattern Based Linear Regression. | Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda |
| 2005 | FCT | Fully Incremental LCS Computation. | Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2005 | GECCO | A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices. | Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto |
| 2005 | SPIRE | A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. | Hisashi Tsuji, Akira Ishino, Masayuki Takeda |
| 2004 | DIS | Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. | Shunsuke Inenaga, Hideo Bannai, Heikki Hyyr, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano |
| 2004 | DLT | An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2004 | WABI | Finding Optimal Pairs of Patterns. | Hideo Bannai, Heikki Hyyr, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano |
| 2003 | DIS | A Method of Extracting Related Words Using Standardized Mutual Information. | Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo |
| 2003 | DIS | Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa |
| 2003 | MFCS | On the Length of the Minimum Solution of Word Equations in One Variable. | Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda |
| 2003 | MFCS | Inferring Strings from Graphs and Arrays. | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2003 | SPIRE | Linear-Time Off-Line Text Compression by Longest-First Substitution. | Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara |
| 2002 | CPM | The Minimum DAWG for All Suffixes of a String and Its Applications. | Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa |
| 2002 | DIS | Discovering Best Variable-Length-Don't-Care Patterns. | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2002 | MFCS | Space-Economical Construction of Index Structures for All Suffixes of a String. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa |
| 2002 | SPIRE | Compact Directed Acyclic Word Graphs for a Sliding Window. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2002 | SPIRE | Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. | Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa |
| 2001 | CPM | On-Line Construction of Compact Directed Acyclic Word Graphs. | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi |
| 2001 | CPM | Multiple Pattern Matching Algorithms on Collage System. | Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 2001 | CPM | String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. | Masayuki Takeda |
| 2001 | DCC | Compressed Pattern Matching for SEQUITUR. | Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2001 | DCC | Faster Approximate String Matching over Compressed Text. | Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 2001 | DIS | A Practical Algorithm to Find the Best Episode Patterns. | Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2001 | DIS | Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. | Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri |
| 2001 | ISAAC | Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. | Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara |
| 2001 | SPIRE | On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2001 | SPIRE | Musical Sequence Comparison for Melodic and Rhythmic Similarities. | T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo |
| 2000 | CIAC | Speeding Up Pattern Matching by Text Compression. | Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa |
| 2000 | CPM | A Boyer-Moore Type Algorithm for Compressed Pattern Matching. | Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 2000 | DIS | A Practical Algorithm to Find the Best Subsequence Patterns. | Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2000 | DIS | Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC. | Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri |
| 2000 | SPIRE | Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. | Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2000 | SPIRE | Online Construction of Subsequence Automata for Multiple Texts. | Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2000 | SPIRE | Bit-Parallel Approach to Approximate String Matching in Compressed Texts. | Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 1999 | CPM | Shift-And Approach to Pattern Matching in LZW Compressed Text. | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 1999 | CPM | Pattern Matching in Text Compressed by Using Antidictionaries. | Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 1999 | DIS | Discovering Poetic Allusion in Anthologies of Classical Japanese Poems. | Kouichi Tamari, Mayumi Yamasaki, Takuya Kida, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri |
| 1999 | SPIRE | A Unifying Framework for Compressed Pattern Matching. | Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa |
| 1998 | DCC | Multiple Pattern Matching in LZW Compressed Text. | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa |
| 1998 | DIS | Uniform Characterizations of Polynomial-Query Learnabilities. | Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda |
| 1998 | DIS | Discovering Characteristic Patterns from Collections of Classical Japanese Poems. | Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri |
| 1997 | CPM | An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. | Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda |