Search the dblp DataBase

Publications of Author

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