default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTatsuie Tsukiji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Fumitaka Ito, Masahiko Naito, Naoyuki Katabami, Tatsuie Tsukiji
:
EXPTIME Hardness of an n by n Custodian Capture Game. Algorithms 14(3): 70 (2021)- [i2]Tatsuie Tsukiji:
Smoothed Complexity of Learning Disjunctive Normal Forms, Inverting Fourier Transforms, and Verifying Small Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j13]Takeo Hagiwara, Tatsuie Tsukiji:
Hardness of Approximation for Langton's Ant on a Twisted Torus. Algorithms 13(12): 344 (2020)
2010 – 2019
- 2016
- [j12]Takeo Hagiwara, Tatsuie Tsukiji, Zhi-Zhong Chen:
Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1034-1049 (2016) - [j11]Zhi-Zhong Chen, Tatsuie Tsukiji, Hiroki Yamada:
Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1050-1058 (2016) - 2011
- [j10]Tatsuie Tsukiji, Takeo Hagiwara:
Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton's Ant Is PSPACE-Hard. Algorithms 4(1): 1-15 (2011)
2000 – 2009
- 2006
- [j9]Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings. IEICE Trans. Inf. Syst. 89-D(8): 2405-2410 (2006) - [j8]Zhi-Zhong Chen, Tatsuie Tsukiji:
Computing bounded-degree phylogenetic roots of disconnected graphs. J. Algorithms 59(2): 125-148 (2006) - [j7]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
- [j6]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 Informatica 41(2-3): 99-110 (2004) - [c8]Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings. COCOON 2004: 132-142 - [c7]Tatsuie Tsukiji, Zhi-Zhong Chen:
Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. COCOON 2004: 450-461 - [c6]Zhi-Zhong Chen, Tatsuie Tsukiji:
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. WG 2004: 308-319 - 2002
- [j5]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) - [j4]Tatsuie Tsukiji, Takashi Tokutani:
Learning of Short Boolean Conjunctions from Negative Examples. Syst. Comput. Jpn. 33(1): 1-7 (2002) - 2001
- [j3]Tatsuie Tsukiji, Hosam M. Mahmoud:
A Limit Law for Outputs in Random Recursive Circuits. Algorithmica 31(3): 403-412 (2001) - [c5]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 - 2000
- [i1]Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe:
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c4]David Guijarro, Jun Tarui, Tatsuie Tsukiji:
Finding Relevant Variables in PAC Model with Membership Queries. ALT 1999: 313- - [c3]Jun Tarui, Tatsuie Tsukiji:
Learning DNF by Approximating Inclusion-Exclusion Formulae. CCC 1999: 215- - 1997
- [j2]Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe:
Partial Occam's Razor and its Applications. Inf. Process. Lett. 64(4): 179-185 (1997) - [c2]Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe:
Partial Occam's Razor and Its Applications. ALT 1997: 85-99 - 1996
- [j1]Tatsuie Tsukiji:
On a Small Class of Boolean Sums. Theor. Comput. Sci. 163(1&2): 283-289 (1996) - [c1]Tatsuie Tsukiji, Fatos Xhafa:
On the Depth of Randomly Generated Circuits. ESA 1996: 208-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
