On the Depth of Randomly Generated Circuits. - Tatsuie Tsukiji; Fatos Xhafa (ESA, 1996)

On a Small Class of Boolean Sums. - Tatsuie Tsukiji (Theor. Comput. Sci., 1996)

Partial Occam's Razor and its Applications. - Carlos Domingo; Tatsuie Tsukiji; Osamu Watanabe 001 (Inf. Process. Lett., 1997)

Finding Relevant Variables in PAC Model with Membership Queries. - David Guijarro; Jun Tarui; Tatsuie Tsukiji (ALT, 1999)

Learning DNF by Approximating Inclusion-Exclusion Formulae. - Jun Tarui; Tatsuie Tsukiji (CCC, 1999)

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems - Shin Aida; Rainer Schuler; Tatsuie Tsukiji; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2000)

A Limit Law for Outputs in Random Recursive Circuits. - Tatsuie Tsukiji; Hosam M. Mahmoud (Algorithmica, 2001)

Learning of Short Boolean Conjunctions from Negative Examples. - Tatsuie Tsukiji; Takashi Tokutani (Syst. Comput. Jpn., 2002)

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. - Tatsuie Tsukiji; Zhi-Zhong Chen (COCOON, 2004)

Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees. - Hosam M. Mahmoud; Tatsuie Tsukiji (Acta Informatica, 2004)

Approximated Vertex Cover for Graphs with Perfect Matchings. - Tomokazu Imamura; Kazuo Iwama; Tatsuie Tsukiji (IEICE Trans. Inf. Syst., 2006)

Computing bounded-degree phylogenetic roots of disconnected graphs. - Zhi-Zhong Chen; Tatsuie Tsukiji (J. Algorithms, 2006)

Computing phylogenetic roots with bounded degrees and errors is NP-complete. - Tatsuie Tsukiji; Zhi-Zhong Chen (Theor. Comput. Sci., 2006)

Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton's Ant Is PSPACE-Hard. - Tatsuie Tsukiji; Takeo Hagiwara (Algorithms, 2011)

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications. - Zhi-Zhong Chen; Tatsuie Tsukiji; Hiroki Yamada (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata. - Takeo Hagiwara; Tatsuie Tsukiji; Zhi-Zhong Chen (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Hardness of Approximation for Langton's Ant on a Twisted Torus. - Takeo Hagiwara; Tatsuie Tsukiji (Algorithms, 2020)

EXPTIME Hardness of an n by n Custodian Capture Game. - Fumitaka Ito; Masahiko Naito; Naoyuki Katabami; Tatsuie Tsukiji (Algorithms, 2021)

Smoothed Complexity of Learning Disjunctive Normal Forms, Inverting Fourier Transforms, and Verifying Small Circuits. - Tatsuie Tsukiji (Electron. Colloquium Comput. Complex., 2021)