Kei Uchizawa

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

Trade-Offs Between Energy and Depth of Neural Networks.

[BibT_eX]

[DOI]

Haruki Abe

Neural Comput., 2024

Energy and Output Patterns in Boolean Circuits.

[BibT_eX]

[DOI]

Jayalal Sarma

Proceedings of the Theory and Applications of Models of Computation, 2024

2023

Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy.

[BibT_eX]

[DOI]

Haruki Abe

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2022

A Theory for Discrete-time Boolean Finite Dynamical Systems with Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2022

2021

A Generalization of Spatial Monte Carlo Integration.

[BibT_eX]

[DOI]

Muneki Yasuda

Neural Comput., 2021

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Circuit Complexity of Visual Search.

[BibT_eX]

[DOI]

Haruki Abe

CoRR, 2021

2020

Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Size, Depth and Energy of Threshold Circuits Computing Parity Function.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs.

[BibT_eX]

[DOI]

Akinori Kawachi

Theor. Comput. Sci., 2019

2018

Computational Power of Threshold Circuits of Energy at most Two.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017

Hitori Numbers.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems.

[BibT_eX]

[DOI]

Akinori Kawachi

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Threshold Circuits Detecting Global Patterns in Two-dimensional Maps.

[BibT_eX]

[DOI]

Daiki Yashima

J. Graph Algorithms Appl., 2016

2015

Threshold Circuits for Global Patterns in 2-Dimensional Maps.

[BibT_eX]

[DOI]

Daiki Yashima

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Competitive Diffusion on Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2015

Lower Bounds for Linear Decision Trees with Bounded Weights.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Swapping Labeled Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Energy and fan-in of logic circuits computing symmetric Boolean functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Generalized Rainbow Connectivity of Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Complexity of Counting Output Patterns of Logic Circuits.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

Hitori Number.

[BibT_eX]

[DOI]

Takeaki Uno

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Size-energy tradeoffs for unate circuits computing symmetric Boolean functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Energy and Fan-In of Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Lower Bounds for Linear Decision Trees via an Energy Complexity Argument.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Energy-Efficient Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Energy and depth of threshold circuits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

2009

Size and Energy of Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Energy Complexity and Depth of Threshold Circuits.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006

On the Computational Power of Threshold Circuits with Sparse Activity.

[BibT_eX]

[DOI]

Rodney J. Douglas

Wolfgang Maass

Neural Comput., 2006

Energy Complexity and Entropy of Threshold Circuits.

[BibT_eX]

[DOI]