| 2006 |
|---|
| 18 | EE | Tomokazu Imamura,
Kazuo Iwama,
Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings.
IEICE Transactions 89-D(8): 2405-2410 (2006) |
| 17 | EE | Zhi-Zhong Chen,
Tatsuie Tsukiji:
Computing bounded-degree phylogenetic roots of disconnected graphs.
J. Algorithms 59(2): 125-148 (2006) |
| 16 | EE | Tatsuie Tsukiji,
Zhi-Zhong Chen:
Computing phylogenetic roots with bounded degrees and errors is NP-complete.
Theor. Comput. Sci. 363(1): 43-59 (2006) |
| 2004 |
|---|
| 15 | EE | Tomokazu Imamura,
Kazuo Iwama,
Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings.
COCOON 2004: 132-142 |
| 14 | EE | Tatsuie Tsukiji,
Zhi-Zhong Chen:
Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard.
COCOON 2004: 450-461 |
| 13 | EE | Zhi-Zhong Chen,
Tatsuie Tsukiji:
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs.
WG 2004: 308-319 |
| 12 | EE | Hosam M. Mahmoud,
Tatsuie Tsukiji:
Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees.
Acta Inf. 41(2-3): 99-110 (2004) |
| 2002 |
|---|
| 11 | EE | Tatsuie Tsukiji,
Takashi Tokutani:
Learning of Short Boolean Conjunctions from Negative Examples.
Systems and Computers in Japan 33(1): 1-7 (2002) |
| 10 | EE | Shin Aida,
Rainer Schuler,
Tatsuie Tsukiji,
Osamu Watanabe:
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.
Theory Comput. Syst. 35(4): 449-463 (2002) |
| 2001 |
|---|
| 9 | EE | Shin Aida,
Rainer Schuler,
Tatsuie Tsukiji,
Osamu Watanabe:
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.
STACS 2001: 51-62 |
| 8 | EE | Tatsuie Tsukiji,
Hosam M. Mahmoud:
A Limit Law for Outputs in Random Recursive Circuits.
Algorithmica 31(3): 403-412 (2001) |
| 2000 |
|---|
| 7 | EE | Shin Aida,
Rainer Schuler,
Tatsuie Tsukiji,
Osamu Watanabe:
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Electronic Colloquium on Computational Complexity (ECCC) 7(81): (2000) |
| 1999 |
|---|
| 6 | EE | David Guijarro,
Jun Tarui,
Tatsuie Tsukiji:
Finding Relevant Variables in PAC Model with Membership Queries.
ATL 1999: 313- |
| 5 | EE | Jun Tarui,
Tatsuie Tsukiji:
Learning DNF by Approximating Inclusion-Exclusion Formulae.
IEEE Conference on Computational Complexity 1999: 215- |
| 1997 |
|---|
| 4 | | Carlos Domingo,
Tatsuie Tsukiji,
Osamu Watanabe:
Partial Occam's Razor and Its Applications.
ALT 1997: 85-99 |
| 3 | EE | Carlos Domingo,
Tatsuie Tsukiji,
Osamu Watanabe:
Partial Occam's Razor and its Applications.
Inf. Process. Lett. 64(4): 179-185 (1997) |
| 1996 |
|---|
| 2 | | Tatsuie Tsukiji,
Fatos Xhafa:
On the Depth of Randomly Generated Circuits.
ESA 1996: 208-220 |
| 1 | EE | Tatsuie Tsukiji:
On a Small Class of Boolean Sums.
Theor. Comput. Sci. 163(1&2): 283-289 (1996) |
