Travelled to:1 × Canada
1 × New Zealand
1 × Spain
2 × USA
Collaborated with:S.Inenaga T.Matsumoto K.Hagio T.I H.Bannai A.Shinohara T.Nishimoto S.Miyamoto
Talks about:match (5) compress (4) automata (4) pattern (3) effici (3) dictionari (2) implement (2) time (2) run (2) parameter (1)
Person: Masayuki Takeda
DBLP: Takeda:Masayuki
Contributed to:
20132015
200920082009
20042003Wrote 7 papers:
- CIAA-2013-INIBT #automaton #taxonomy
- Compressed Automata for Dictionary Matching (TI, TN, SI, HB, MT), pp. 319–330.
- CIAA-J-2013-INIBT15 #automaton #taxonomy
- Compressed automata for dictionary matching (TI, TN, SI, HB, MT), pp. 30–41.
- LATA-2009-IIBT #array
- Counting Parameterized Border Arrays for a Binary Alphabet (TI, SI, HB, MT), pp. 422–433.
- CIAA-2008-MatsumotoHT #automaton #implementation #pattern matching #performance #runtime
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 201–211.
- CIAA-J-2008-MatsumotoHT09 #automaton #implementation #pattern matching #performance #runtime
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 717–733.
- DLT-2004-InenagaST #algorithm #context-free grammar #pattern matching #performance #subclass
- An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.
- CIAA-2003-MiyamotoITS #graph #word
- Ternary Directed Acyclic Word Graphs (SM, SI, MT, AS), pp. 120–130.