| 2008 |
|---|
| 29 | EE | Mitsuo Wakatsuki,
Etsuji Tomita:
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
IEICE Transactions 91-D(6): 1704-1718 (2008) |
| 2007 |
|---|
| 28 | | Etsuji Tomita,
Yoichi Sutani,
Takanori Higashi:
A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring.
PDPTA 2007: 719-725 |
| 27 | EE | Hans-Ulrich Simon,
Etsuji Tomita:
Guest editors' foreword.
Theor. Comput. Sci. 387(1): 1-3 (2007) |
| 2006 |
|---|
| 26 | | Yasubumi Sakakibara,
Satoshi Kobayashi,
Kengo Sato,
Tetsuro Nishino,
Etsuji Tomita:
Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings
Springer 2006 |
| 25 | EE | Mitsuo Wakatsuki,
Etsuji Tomita,
Go Yamada:
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data.
ICGI 2006: 161-174 |
| 24 | EE | Tatsuya Akutsu,
Morihiro Hayashida,
Dukka Bahadur,
Etsuji Tomita,
Jun'ichi Suzuki,
Katsuhisa Horimoto:
Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints.
IEICE Transactions 89-A(5): 1215-1222 (2006) |
| 23 | EE | K. C. Dukka Bahadur,
Etsuji Tomita,
Jun'ichi Suzuki,
Katsuhisa Horimoto,
Tatsuya Akutsu:
Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms.
J. Bioinformatics and Computational Biology 4(1): 19-42 (2006) |
| 22 | EE | Etsuji Tomita,
Akira Tanaka,
Haruhisa Takahashi:
The worst-case time complexity for generating all maximal cliques and computational experiments.
Theor. Comput. Sci. 363(1): 28-42 (2006) |
| 2005 |
|---|
| 21 | | Sanjay Jain,
Hans-Ulrich Simon,
Etsuji Tomita:
Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings
Springer 2005 |
| 20 | EE | Sanjay Jain,
Hans-Ulrich Simon,
Etsuji Tomita:
Editors' Introduction.
ALT 2005: 1-9 |
| 19 | EE | Dukka Bahadur,
Etsuji Tomita,
Jun'ichi Suzuki,
Katsuhisa Horimoto,
Tatsuya Akutsu:
Clique-based algorithms for protein threading with profiles and constraints.
APBC 2005: 51-64 |
| 18 | EE | K. C. Dukka Bahadur,
Etsuji Tomita,
Jun'ichi Suzuki,
Tatsuya Akutsu:
Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach.
J. Bioinformatics and Computational Biology 3(1): 103-126 (2005) |
| 2004 |
|---|
| 17 | EE | Akinobu Miyata,
Jun Tarui,
Etsuji Tomita:
Learning Boolean Functions in AC0 on Attribute and Classification Noise.
ALT 2004: 142-155 |
| 16 | EE | Dukka Bahadur,
Tatsuya Akutsu,
Etsuji Tomita,
Tomokazu Seki:
Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach.
APBC 2004: 191-200 |
| 15 | EE | Tatsuya Akutsu,
Morihiro Hayashida,
Etsuji Tomita,
Jun'ichi Suzuki,
Katsuhisa Horimoto:
Protein Threading with Profiles and Constraints.
BIBE 2004: 537-544 |
| 14 | EE | Etsuji Tomita,
Akira Tanaka,
Haruhisa Takahashi:
The Worst-Case Time Complexity for Generating All Maximal Cliques.
COCOON 2004: 161-170 |
| 13 | EE | Mitsuo Wakatsuki,
Kiyoshi Teraguchi,
Etsuji Tomita:
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
ICGI 2004: 260-272 |
| 12 | EE | Yasuhiro Tajima,
Etsuji Tomita,
Mitsuo Wakatsuki,
Matsuaki Terada:
Polynomial time learning of simple deterministic languages via queries and a representative sample.
Theor. Comput. Sci. 329(1-3): 203-221 (2004) |
| 2003 |
|---|
| 11 | EE | Etsuji Tomita,
Tomokazu Seki:
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.
DMTCS 2003: 278-289 |
| 2000 |
|---|
| 10 | | Yasuhiro Tajima,
Etsuji Tomita:
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample.
ICGI 2000: 284-297 |
| 1997 |
|---|
| 9 | EE | Etsuji Tomita,
Ken'ichi Imamatsu,
Yasuhiro Kohata,
Mitsuo Wakatsuki:
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations.
Systems and Computers in Japan 28(5): 60-67 (1997) |
| 1995 |
|---|
| 8 | | Etsuji Tomita,
Kazushi Seino:
The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata
Acta Inf. 32(4): 395-413 (1995) |
| 1993 |
|---|
| 7 | | Klaus P. Jantke,
Shigenobu Kobayashi,
Etsuji Tomita,
Takashi Yokomori:
Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings
Springer 1993 |
| 6 | EE | Haruhisa Takahashi,
Etsuji Tomita,
Tsutomu Kawabata:
Separability of internal representations in multilayer perceptrons with application to learning.
Neural Networks 6(5): 689-703 (1993) |
| 1989 |
|---|
| 5 | | Etsuji Tomita,
Kazushi Seino:
A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict.
Theor. Comput. Sci. 64(1): 39-53 (1989) |
| 1985 |
|---|
| 4 | | Etsuji Tomita,
Kazushi Seino:
A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable.
Theor. Comput. Sci. 41: 223-230 (1985) |
| 1984 |
|---|
| 3 | | Etsuji Tomita:
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata.
Theor. Comput. Sci. 32: 87-120 (1984) |
| 1983 |
|---|
| 2 | | Etsuji Tomita:
A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars.
Theor. Comput. Sci. 23: 129-154 (1983) |
| 1982 |
|---|
| 1 | | Etsuji Tomita:
A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata
Information and Control 52(2): 187-238 (1982) |
