Energy Complexity and Entropy of Threshold Circuits. - Wolfgang Maass 001; Kei Uchizawa; Rodney J. Douglas (Electron. Colloquium Comput. Complex., 2006)

On the Computational Power of Threshold Circuits with Sparse Activity. - Kei Uchizawa; Rodney J. Douglas; Wolfgang Maass 001 (Neural Comput., 2006)

An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity. - Kei Uchizawa; Eiji Takimoto (CCC, 2007)

Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity. - Kei Uchizawa; Eiji Takimoto (Theor. Comput. Sci., 2008)

Energy Complexity and Depth of Threshold Circuits. - Kei Uchizawa; Takao Nishizeki; Eiji Takimoto (FCT, 2009)

Size and Energy of Threshold Circuits Computing Mod Functions. - Kei Uchizawa; Takao Nishizeki; Eiji Takimoto (MFCS, 2009)

Energy and depth of threshold circuits. - Kei Uchizawa; Takao Nishizeki; Eiji Takimoto (Theor. Comput. Sci., 2010)

Lower Bounds for Linear Decision Trees via an Energy Complexity Argument. - Kei Uchizawa; Eiji Takimoto (MFCS, 2011)

Energy and Fan-In of Threshold Circuits Computing Mod Functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (TAMC, 2011)

Size-energy tradeoffs for unate circuits computing symmetric Boolean functions. - Kei Uchizawa; Eiji Takimoto; Takao Nishizeki (Theor. Comput. Sci., 2011)

Hitori Number. - Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (FUN, 2012)

Complexity of Counting Output Patterns of Logic Circuits. - Kei Uchizawa; Zhenghong Wang; Hiroki Morizumi; Xiao Zhou 001 (CATS, 2013)

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (TAMC, 2013)

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Akira Suzuki 001; Xiao Zhou 001 (Algorithmica, 2013)

Energy-Efficient Threshold Circuits Computing mod Functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (Int. J. Found. Comput. Sci., 2013)

Energy and fan-in of logic circuits computing symmetric Boolean functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (Theor. Comput. Sci., 2013)

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (CoRR, 2014)

Generalized rainbow connectivity of graphs. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

Lower Bounds for Linear Decision Trees with Bounded Weights. - Kei Uchizawa; Eiji Takimoto (SOFSEM, 2015)

Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems. - Mitsunori Ogihara; Kei Uchizawa (TAMC, 2015)

Competitive Diffusion on Weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (WADS, 2015)

Threshold Circuits for Global Patterns in 2-Dimensional Maps. - Kei Uchizawa; Daiki Yashima; Xiao Zhou 001 (WALCOM, 2015)

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

Threshold Circuits Detecting Global Patterns in Two-dimensional Maps. - Kei Uchizawa; Daiki Yashima; Xiao Zhou 001 (J. Graph Algorithms Appl., 2016)

Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. - Akinori Kawachi; Mitsunori Ogihara; Kei Uchizawa (MFCS, 2017)

Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs. - Mitsunori Ogihara; Kei Uchizawa (Inf. Comput., 2017)

Hitori Numbers. - Akira Suzuki 001; Masashi Kiyomi; Yota Otachi; Kei Uchizawa; Takeaki Uno (J. Inf. Process., 2017)

Computational Power of Threshold Circuits of Energy at most Two. - Hiroki Maniwa; Takayuki Oki; Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. - Akinori Kawachi; Mitsunori Ogihara; Kei Uchizawa (Theor. Comput. Sci., 2019)

Size, Depth and Energy of Threshold Circuits Computing Parity Function. - Kei Uchizawa (ISAAC, 2020)

Circuit Complexity of Visual Search. - Kei Uchizawa; Haruki Abe (CoRR, 2021)

Foreword. - Kei Uchizawa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

A Generalization of Spatial Monte Carlo Integration. - Muneki Yasuda; Kei Uchizawa (Neural Comput., 2021)

A Theory for Discrete-time Boolean Finite Dynamical Systems with Uncertainty. - Mitsunori Ogihara; Kei Uchizawa (CoRR, 2022)

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. - Yasuaki Kobayashi; Shin-Ichi Nakano; Kei Uchizawa; Takeaki Uno; Yutaro Yamaguchi 001; Katsuhisa Yamanaka (IEICE Trans. Inf. Syst., 2022)

Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy. - Kei Uchizawa; Haruki Abe (MFCS, 2023)

Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. - Mitsunori Ogiwara; Kei Uchizawa (Theory Comput. Syst., 2023)

Energy and Output Patterns in Boolean Circuits. - Jayalal Sarma; Kei Uchizawa (TAMC, 2024)

Trade-Offs Between Energy and Depth of Neural Networks. - Kei Uchizawa; Haruki Abe (Neural Comput., 2024)