Candidate Boolean Functions towards Super-Quadratic Formula Size.
IEICE Technical Report, vol. 112, no. 93, COMP2012-18, pp. 49-55, June 21, 2012.
Formula Complexity of Ternary Majorities.
In Proceedings of The 18th Annual International Computing and Combinatorics Conference (COCOON 2012), Sydney, Australia, August 20-22, 2012. [PDF]
Lecture Notes in Computer Science 7434, pp. 433-444, Springer-Verlag, 2012.
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds.
International Journal of Foundations of Computer Science, World Scientific, Vol. 24, No. 8, pp. 1339-1354, World Scientific, December 2013. [DOI]
In Proceedings of The 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), Brno, Czech Republic, August 23-27, 2010.
Lecture Notes in Computer Science 6281, pp. 665-676, Springer-Verlag, 2010.
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints.
Theoretical Computer Science, Vol. 434, pp. 87-97, Elsevier, May 2012. [DOI] [KURENAI]
In Proceedings of The 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009),
Freiburg, Germany, February 26-28, 2009.
Leibniz International Proceedings in Informatics 3, pp. 685-696, Schloss Dagstuhl, 2009.
Relating L versus P to Reversal versus Access and Their Combinatorial Structures.
IEICE Transactions on Information and Systems E91-D (12), pp. 2776-2783, 2008.
Recursion Theoretic Operators for Function Complexity Classes.
IEICE Transactions on Information and Systems E91-D (4), pp. 990-995, 2008.
In Proceedings of The 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005),
Sanya, Hainan, China, December 19-21, 2005.
Lecture Notes in Computer Science 3827, pp. 748-756, Springer-Verlag, 2005.