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
[1]
Hilfe
Suche: Author="Tomita, Etsuji"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning Boolean functions in
AC^0
on attribute and classification noise - Estimating an upper bound on attribute and classification noise
Akinobu Miyata
,
Jun Tarui
,
Etsuji Tomita
Theoretical Computer Science
412
(35), 2011, pp. 4650-4660
The worst-case time complexity for generating all maximal cliques and computational experiments
Etsuji Tomita
,
Akira Tanaka
,
Haruhisa Takahashi
Theoretical Computer Science
363
(1), 2006, pp. 28-42
Polynomial time learning of simple deterministic languages via queries and a representative sample
Yasuhiro Tajima
,
Etsuji Tomita
,
Mitsuo Wakatsuki
,
Matsuaki Terada
Theoretical Computer Science
329
(1-3), 2004, pp. 203-221
The worst-case time complexity for generating all maximal cliques
Etsuji Tomita
,
Akira Tanaka
,
Haruhisa Takahashi
Lecture Notes in Computer Science
3106
, 2004, pp. 161-170
The extended equivalence problem for a class of non-real-time deterministic pushdown automata
Etsuji Tomita
,
Kazushi Seino
Acta Informatica
32
, 1995, pp. 395-413
A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
Etsuji Tomita
,
Kazushi Seino
Theoretical Computer Science
64
, 1989, pp. 39-53
A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata
Etsuji Tomita
Information and Control
52
(2), 1982, pp. 187-238