Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. - Hideaki Fukuhara; Eiji Takimoto (CATS, 2009)

Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators. - Hideaki Fukuhara; Eiji Takimoto (IEICE Trans. Inf. Syst., 2010)

NPN-Representatives of a Set of Optimal Boolean Formulas. - Hideaki Fukuhara; Eiji Takimoto; Kazuyuki Amano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)