Etsuji Tomita

发表

A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable

Etsuji Tomita, Kazushi Seino, 1985, Theor. Comput. Sci..

Guest Editors' Foreword

Mohammad Sohel Rahman, Etsuji Tomita, 2016, J. Graph Algorithms Appl..

Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings

Tetsuro Nishino, Etsuji Tomita, Yasubumi Sakaibara, 2006, ICGI.

A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2011, BMC Bioinformatics.

Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm.

Tatsuya Akutsu, Etsuji Tomita, Bahadur K C Dukka, 2002, Genome informatics. International Conference on Genome Informatics.

The worst-case time complexity for generating all maximal cliques and computational experiments

Akira Tanaka, Etsuji Tomita, Haruhisa Takahashi, 2006, Theor. Comput. Sci..

Some Properties of Deterministic Restricted One-Counter Automata

Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki, 1996 .

Algorithms for Computing an Optimal Protein Threading with Profiles and Distance Restraints

Tatsuya Akutsu, Etsuji Tomita, Morihiro Hayashida, 2003 .

Special issue on WALCOM 2015

Mohammad Sohel Rahman, Etsuji Tomita, 2016, J. Discrete Algorithms.

An analysis of enterprise communities by cliques.

Etsuji Tomita, Tsutomu Matsunaga, Chikara Yonemori, 2007 .

A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2012, J. Comput. Biol..

Protein threading with profiles and constraints

Tatsuya Akutsu, Etsuji Tomita, Morihiro Hayashida, 2004, Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering.

Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications

Etsuji Tomita, E. Tomita, 2017, WALCOM.

A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity

Etsuji Tomita, Miklo Shindo, 1990, Systems and Computers in Japan.

A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata

Etsuji Tomita, 1982, Inf. Control..

An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata

Etsuji Tomita, 1984, Theor. Comput. Sci..

Learning Boolean functions in AC0 on attribute and classification noise - Estimating an upper bound on attribute and classification noise

Etsuji Tomita, Jun Tarui, Akinobu Miyata, 2011, Theor. Comput. Sci..

Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers

Etsuji Tomita, Mitsuo Wakatsuki, 2010, ICGI.

A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2016, PAKDD.

A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, 2007, PDPTA.

Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Satoshi Kobayashi, Tetsuro Nishino, Etsuji Tomita, 2006 .

An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique

Etsuji Tomita, Tomokazu Seki, 2003, DMTCS.

The Worst-Case Time Complexity for Generating All Maximal Cliques

Akira Tanaka, Etsuji Tomita, Haruhisa Takahashi, 2004, COCOON.

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations

Etsuji Tomita, Mitsuo Wakatsuki, Ken'ichi Imamatsu, 1997, Systems and Computers in Japan.

Polynomial time learning of simple deterministic languages via queries and a representative sample

Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, 2004, Theor. Comput. Sci..

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, 2016, FAW.

Relational Change Pattern Mining Based on Modularity Difference

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2013, MIWAI.

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data

Etsuji Tomita, Mitsuo Wakatsuki, Kiyoshi Teraguchi, 2004, ICGI.

Clique-based algorithms for protein threading with profiles and constraints

Tatsuya Akutsu, Etsuji Tomita, Katsuhisa Horimoto, 2005, APBC.

A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data

Etsuji Tomita, Mitsuo Wakatsuki, Go Yamada, 2006, ICGI.

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode

Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki, 1998 .

A polynomial-time algorithm for finding a near-maximum clique and its experimental evaluation

Etsuji Tomita, 1991 .

Toward Advanced Algorithms

Etsuji Tomita, 2009 .

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments

Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, 2017, J. Inf. Process..

Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings

Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita, 2005, ALT.

A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata

Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki, 1995, IEICE Trans. Inf. Syst..

Guest Editors' Foreword

Hans Ulrich Simon, Mohammad Sohel Rahman, Etsuji Tomita, 2007, J. Graph Algorithms Appl..

The Worst-Case Time Complexity for Finding All the Cliques

Akira Tanaka, Etsuji Tomita, Haruhisa Takahashi, 2016 .

Rate-Monotonic Scheduling.

Etsuji Tomita, 2015 .

A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State

Tetsuro Nishino, Etsuji Tomita, Mitsuo Wakatsuki, 2015, Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

Clique-based data mining for related genes in a biomedical database

Etsuji Tomita, Masaaki Muramatsu, Tsutomu Matsunaga, 2009, BMC Bioinformatics.

A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars

Etsuji Tomita, 1983, Theor. Comput. Sci..

Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2016, MLDM.

Proceedings of the 4th International Workshop on Algorithmic Learning Theory

Shigenobu Kobayashi, Takashi Yokomori, Etsuji Tomita, 1993 .

The Performance of a Metaheuristic Algorithm for Finding a Maximal Weight Clique in the Fill-in-Blank Problem

Kengo Katayama, Etsuji Tomita, Nobuo Funabiki, 2020 .

PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance

Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita, 2005 .

An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

Etsuji Tomita, Toshikatsu Kameda, E. Tomita, 2009, J. Glob. Optim..

A Direct Branching Algorithm for Checking the Equivalence of a Pair of Non-real-time Deterministic Pushdown Transducers

Etsuji Tomita, Mitsuo Wakatsuki, Kazushi Seino, 2007 .

A Fast Algorithm for Checking the Inclusion for Very Simple Deterministic Pushdown Automata

Etsuji Tomita, Mitsuo Wakatsuki, 1993 .

Learning Boolean Functions in AC0 on Attribute and Classification Noise

Etsuji Tomita, Jun Tarui, Akinobu Miyata, 2004, ALT.

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

Etsuji Tomita, Toshikatsu Kameda, E. Tomita, 2001, J. Glob. Optim..

Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints

Tatsuya Akutsu, Etsuji Tomita, Morihiro Hayashida, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics

Tatsuya Akutsu, Etsuji Tomita, Tsutomu Matsunaga, 2011 .

Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach

Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki, 2005, APBC.

Clique Enumeration

Etsuji Tomita, 2016, Encyclopedia of Algorithms.

Separability of internal representations in multilayer perceptrons with application to learning

Etsuji Tomita, Tsutomu Kawabata, Haruhisa Takahashi, 1993, Neural Networks.

Enumerating Maximal Clique Sets with Pseudo-Clique Constraint

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2015, Discovery Science.

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State

Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki, 1995, IEICE Trans. Inf. Syst..

Algorithmic Learning Theory: 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993 - Proceedings

Shigenobu Kobayashi, Takashi Yokomori, Etsuji Tomita, 1993 .

An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2011, 2011 International Conference on Complex, Intelligent, and Software Intensive Systems.

Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms

Tatsuya Akutsu, Etsuji Tomita, Katsuhisa Horimoto, 2006, J. Bioinform. Comput. Biol..

A randomized algorithm for finding a near-maximum clique and its experimental evaluations

Etsuji Tomita, Haruhisa Takahashi, Yoshiaki Yamada, 1994, Systems and Computers in Japan.

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State

Tetsuro Nishino, Etsuji Tomita, Mitsuo Wakatsuki, 2013, 2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

The extended equivalence problem for a class of non-real-time deterministic pushdown automata

Etsuji Tomita, Kazushi Seino, 2005, Acta Informatica.

A fast and complete algorithm for enumerating pseudo-cliques in large graphs

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2016, International Journal of Data Science and Analytics.

Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2012, Discovery Science.

Editors' Introduction

Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita, 2005, ALT.

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments

Etsuji Tomita, Mitsuo Wakatsuki, Yoichi Sutani, 2013, IEICE Trans. Inf. Syst..

A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample

Yasuhiro Tajima, Etsuji Tomita, E. Tomita, 2000, ICGI.

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

Shinya Takahashi, Etsuji Tomita, Mitsuo Wakatsuki, 2010, WALCOM.

Proceedings of the 16th international conference on Algorithmic Learning Theory

Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita, 2005 .

Finding What Changes for Two Graphs Constructed from Different Time Intervals

Makoto Haraguchi, Etsuji Tomita, Yoshiaki Okubo, 2012, 2012 IIAI International Conference on Advanced Applied Informatics.

Optimal Non-binary Single Insertion Deletion Correcting Code Construction by Maximum Clique Enumeration

Etsuji Tomita, Takayuki Nozaki, Akira Mitsutake, 2021 .

On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms

Alessio Conte, Etsuji Tomita, E. Tomita, 2021, Theor. Comput. Sci..

Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms

Alessio Conte, Etsuji Tomita, E. Tomita, 2021, Workshop on Algorithms and Computation.

The extended equivalence problem for a class of non-real-time deterministic pushdown automata

Etsuji Tomita, Kazushi Seino, 1995 .

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations

Etsuji Tomita, Mitsuo Wakatsuki, Ken'ichi Imamatsu, 1997 .

A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars

Etsuji Tomita, 1983 .

Polynomial-time solvability of the maximum clique problem

Etsuji Tomita, E. Tomita, Hiroaki Nakanishi, 2009 .