Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Shinohara, Ayumi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Detecting regularities on grammar-compressed strings
Tomohiro I
,
Wataru Matsubara
,
Kouji Shimohira
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
,
Kazuyuki Narisawa
,
Ayumi Shinohara
Lecture Notes in Computer Science
8087
, 2013, pp. 571-582
Average value of sum of exponents of runs in a string
Kazuhiko Kusano
,
Wataru Matsubara
,
Akira Ishino
,
Ayumi Shinohara
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1135-1146
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Wataru Matsubara
,
Shunsuke Inenaga
,
Akira Ishino
,
Ayumi Shinohara
,
Tomoyuki Nakamura
,
Kazuo Hashimoto
Theoretical Computer Science
410
(8-10), 2009, pp. 900-913
A fully compressed pattern matching algorithm for simple collage systems
Shunsuke Inenaga
,
Ayumi Shinohara
,
Masayuki Takeda
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1155-1166
The size of subsequence automaton
Zdenȇk Troníc̑ek
,
Ayumi Shinohara
Theoretical Computer Science
341
(1-3), 2005, pp. 379-384
Ternary directed acyclic word graphs
Satoru Miyamoto
,
Shunsuke Inenaga
,
Masayuki Takeda
,
Ayumi Shinohara
Theoretical Computer Science
328
(1-2), 2004, pp. 97-111
On the length of the minimum solution of word equations in one variable
Kensuke Baba
,
Satoshi Tsuruta
,
Ayumi Shinohara
,
Masayuki Takeda
Lecture Notes in Computer Science
2747
, 2003, pp. 189-197
Inferring strings from graphs and arrays
Hideo Bannai
,
Shunsuke Inenaga
,
Ayumi Shinohara
,
Masayuki Takeda
Lecture Notes in Computer Science
2747
, 2003, pp. 208-217
Uniform characterizations of polynomial-query learnabilities
Yosuke Hayashi
,
Satoshi Matsumoto
,
Ayumi Shinohara
,
Masayuki Takeda
Theoretical Computer Science
292
(2), 2003, pp. 377-385
A practical algorithm to find the best subsequence patterns
Masahiro Hirao
,
Hiromasa Hoshino
,
Ayumi Shinohara
,
Masayuki Takeda
,
Setsuo Arikawa
Theoretical Computer Science
292
(2), 2003, pp. 465-479
Collage system: A unifying framework for compressed pattern matching
Takuya Kida
,
Tetsuya Matsumoto
,
Yusuke Shibata
,
Masayuki Takeda
,
Ayumi Shinohara
,
Setsuo Arikawa
Theoretical Computer Science
298
(1), 2003, pp. 253-272
Space-economical construction of index structures for all suffixes of a string
Shunsuke Inenaga
,
Ayumi Shinohara
,
Masayuki Takeda
,
Hideo Bannai
,
Setsuo Arikawa
Lecture Notes in Computer Science
2420
, 2002, pp. 341-352
The minimum DAWG for all suffixes of a string and its applications
Shunsuke Inenaga
,
Masayuki Takeda
,
Ayumi Shinohara
,
Hiromasa Hoshino
,
Setsuo Arikawa
Lecture Notes in Computer Science
2373
, 2002, pp. 153-167
Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works
Hideaki Hori
,
Shinichi Shimozono
,
Masayuki Takeda
,
Ayumi Shinohara
Lecture Notes in Computer Science
2223
, 2001, pp. 719-730
On-line construction of compact directed acyclic word graphs
Shunsuke Inenaga
,
Hiromasa Hoshino
,
Ayumi Shinohara
,
Masayuki Takeda
,
Setsuo Arikawa
,
Giancarlo Mauri
,
Giulio Pavesi
Lecture Notes in Computer Science
2089
, 2001, pp. 169-180
Multiple pattern matching algorithms on collage system
Takuya Kida
,
Tetsuya Matsumoto
,
Masayuki Takeda
,
Ayumi Shinohara
,
Setsuo Arikawa
Lecture Notes in Computer Science
2089
, 2001, pp. 193-206
Speeding up pattern matching by text compression
Yusuke Shibata
,
Takuya Kida
,
Shuichi Fukamachi
,
Masayuki Takeda
,
Ayumi Shinohara
,
Takeshi Shinohara
,
Setsuo Arikawa
Lecture Notes in Computer Science
1767
, 2000, pp. 306-315
A Boyer-Moore type algorithm for compressed pattern matching
Yusuke Shibata
,
Tetsuya Matsumoto
,
Masayuki Takeda
,
Ayumi Shinohara
,
Setsuo Arikawa
Lecture Notes in Computer Science
1848
, 2000, pp. 181-194
Shift-and approach to pattern matching in LZW compressed text
Takuya Kida
,
Masayuki Takeda
,
Ayumi Shinohara
,
Setsuo Arikawa
Lecture Notes in Computer Science
1645
, 1999, pp. 1-13
Pattern matching in text compressed by using antidictionaries
Yusuke Shibata
,
Masayuki Takeda
,
Ayumi Shinohara
,
Setsuo Arikawa
Lecture Notes in Computer Science
1645
, 1999, pp. 37-49
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram
Shinichi Shimozono
,
Kouichi Hirata
,
Ayumi Shinohara
Information Processing Letters
66
(4), 1998, pp. 165-170
An improved pattern matching algorithm for strings in terms of straight-line programs
Masamichi Miyazaki
,
Ayumi Shinohara
,
Masayuki Takeda
Lecture Notes in Computer Science
1264
, 1997, pp. 1-11
On the hardness of approximating the minimum consistent OBDD problem
Kouichi Hirata
,
Shinichi Shimozono
,
Ayumi Shinohara
Lecture Notes in Computer Science
1097
, 1996, pp. 112-123
Pattern-matching for strings with short descriptions
Marek Karpinski
,
Wojciech Rytter
,
Ayumi Shinohara
Lecture Notes in Computer Science
937
, 1995, pp. 205-214
Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
Ayumi Shinohara
Theoretical Computer Science
137
(1), 1995, pp. 129-144
Seiten 1
2
>