教員情報 - 築地　立家 | 東京電機大学

ツキジ　タツイエ TSUKIJI Tatsuie
築地　立家

所属東京電機大学理工学部理工学科　情報システムデザイン学系

東京電機大学大学院理工学研究科情報学専攻

職種准教授

著書・論文歴
1.	著書	EXPTIME Hardness of an n by n Custodian Capture Game Algorithms 14 (3),70-106頁 (共著) 2021/01
2.	著書	Hardness of Approximation for Langton's Ant on a Twisted Torus Algorithms 13 (12),344-362頁 (共著) 2020/12
3.	著書	Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton's Ant Is PSPACE-Hard 4 (1),1-15 (共著) 2011/01
4.	論文	Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 99 (6),1034-1049頁 (共著) 2016
5.	論文	Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 99 (6),1050-1058頁 (共著) 2016
6.	論文	振幅を制限した無誤り量子計算について RA004,19-24 (単著) 2010/09
7.	論文	Complexity of Generalized Langton's Ant,116-123 (共著) 2010/07
8.	論文	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs 59 (2),125-148 (共著) 2006
9.	論文	Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard 363 (1),43-59 (共著) 2006
10.	論文	Limit laws for terminal nodes in random circuits with restricted fan-out：a family of graphs generalizing binary search trees, Acta Informatica, vol.40,,1-12, (共著) 2004
11.	論文	Limit laws for terminal nodes in random circuits with restricted fan-out：a family of graphs generalizing binary search trees, Acta Informatica, vol.40,,1-12, (共著) 2004
12.	論文	Ｃ７-Coloring Problem, IEICE Transactions on Informations and Systems, (共著) 2004
13.	論文	Ｃ７-Coloring Problem, IEICE Transactions on Informations and Systems, (共著) 2004
14.	論文	Learning Short Boolean Conjunctions from Negative Examples, Systems and Computers in Japan, vol.33,,1-7, (共著) 2002
15.	論文	Learning Short Boolean Conjunctions from Negative Examples, Systems and Computers in Japan, vol.33,,1-7, (共著) 2002
16.	論文	On the Internal Structure of Random Recursive Circuits, Journal of Computer and Applied Mathematics, vol.142,,155-171, (共著) 2002
17.	論文	On the Internal Structure of Random Recursive Circuits, Journal of Computer and Applied Mathematics, vol.142,,155-171, (共著) 2002
18.	論文	The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems, Mathematical Systems Theory, Vol.35,,449-463, (共著) 2002
19.	論文	The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems, Mathematical Systems Theory, Vol.35,,449-463, (共著) 2002
20.	論文	A Limit Law for Outputs in Random Recursive Circuits, Algorithmica, vol.31,,403-412, (共著) 2001
21.	論文	A Limit Law for Outputs in Random Recursive Circuits, Algorithmica, vol.31,,403-412, (共著) 2001
22.	論文	O（logn）長の単調多項式の負例学習について，電子情報通信学会論文誌， Vol.J84-D-1,,40-47 (共著) 2001
23.	論文	O（logn）長の単調多項式の負例学習について，電子情報通信学会論文誌， Vol.J84-D-1,,40-47 (共著) 2001
24.	論文	P-comp Versus P-samp Question under Avp-domination, IEICE Transactions on Informations and Systems, vol.E84-D-10,,1402-1410, (共著) 2001
25.	論文	P-comp Versus P-samp Question under Avp-domination, IEICE Transactions on Informations and Systems, vol.E84-D-10,,1402-1410, (共著) 2001
26.	論文	一般化詰将棋問題の指数時間完全性，電子情報通信学会論文誌， vol.D-1-3,,239-246 (共著) 2001
27.	論文	一般化詰将棋問題の指数時間完全性，電子情報通信学会論文誌， vol.D-1-3,,239-246 (共著) 2001
28.	論文	手数制限つき一般化詰将棋問題の PSPACE 完全性について，電子情報通信学会論文誌， vol.J84-D-1-1,,58-61, (共著) 2001
29.	論文	手数制限つき一般化詰将棋問題の PSPACE 完全性について，電子情報通信学会論文誌， vol.J84-D-1-1,,58-61, (共著) 2001
30.	その他	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs, Proc. of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Bonn, Germany, Lecture Notes in Computer Science, (共著) 2004/06
31.	その他	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs, Proc. of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Bonn, Germany, Lecture Notes in Computer Science, (共著) 2004/06
32.	その他	Approximated Vertex Cover for Graphs with Perfect Matchings, Proc. of the 10th Annual International Conference on Computing and combinatorics, Jeju island, Korea, August 2004 （COCOON2004）, Lecture Notes in Computer Science, vol.3106,,132-142, (共著) 2004
33.	その他	Approximated Vertex Cover for Graphs with Perfect Matchings, Proc. of the 10th Annual International Conference on Computing and combinatorics, Jeju island, Korea, August 2004 （COCOON2004）, Lecture Notes in Computer Science, vol.3106,,132-142, (共著) 2004
34.	その他	Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard, Proc. of the 10th Annual International Conference on Computing and Combinatorics, Jeju Island, Korea, August 2004 （COCOON2004）, Lecture Notes in Computer Science, vol.3106,,450-461, (共著) 2004
35.	その他	Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard, Proc. of the 10th Annual International Conference on Computing and Combinatorics, Jeju Island, Korea, August 2004 （COCOON2004）, Lecture Notes in Computer Science, vol.3106,,450-461, (共著) 2004
36.	その他	The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems, The 18th Symposium on Theoretical Aspects of Computer Science,,51-62. (共著) 2001/02
37.	その他	The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems, The 18th Symposium on Theoretical Aspects of Computer Science,,51-62. (共著) 2001/02