# Tatsuie Tsukiji

According to our database

^{1}, Tatsuie Tsukiji## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2016

Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata.

IEICE Transactions, 2016

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications.

IEICE Transactions, 2016

2011

Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton's Ant Is PSPACE-Hard.

Algorithms, 2011

2006

Computing phylogenetic roots with bounded degrees and errors is NP-complete.

Theor. Comput. Sci., 2006

Computing bounded-degree phylogenetic roots of disconnected graphs.

J. Algorithms, 2006

Approximated Vertex Cover for Graphs with Perfect Matchings.

IEICE Transactions, 2006

2004

Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees.

Acta Inf., 2004

Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard.

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Approximated Vertex Cover for Graphs with Perfect Matchings.

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2002

Learning of Short Boolean Conjunctions from Negative Examples.

Systems and Computers in Japan, 2002

The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.

Theory Comput. Syst., 2002

2001

A Limit Law for Outputs in Random Recursive Circuits.

Algorithmica, 2001

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.

Proceedings of the STACS 2001, 2001

2000

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems

Electronic Colloquium on Computational Complexity (ECCC), 2000

1999

Learning DNF by Approximating Inclusion-Exclusion Formulae.

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

Finding Relevant Variables in PAC Model with Membership Queries.

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1997

Partial Occam's Razor and its Applications.

Inf. Process. Lett., 1997

Partial Occam's Razor and Its Applications.

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

On a Small Class of Boolean Sums.

Theor. Comput. Sci., 1996

On the Depth of Randomly Generated Circuits.

Proceedings of the Algorithms, 1996