Loading Deep Networks Is Hard. - Jirí Síma (Neural Comput., 1994)

Neural Language Acceptors. - Jirí Síma; Jirí Wiedermann (Developments in Language Theory, 1995)

Hopfield Languages. - Jirí Síma (SOFSEM, 1995)

Neural expert systems. - Jirí Síma (Neural Networks, 1995)

Aunt's Problem: Table Rounding. - Jirí Síma (SOFSEM, 1996)

Back-propagation is not Efficient. - Jirí Síma (Neural Networks, 1996)

Theory of Neuromata. - Jirí Síma; Jirí Wiedermann (J. ACM, 1998)

Some Afterthoughts on Hopfield Networks. - Jirí Síma; Pekka Orponen; Teemu Antti-Poika (SOFSEM, 1999)

Table Rounding Problem. - Jirí Síma (Comput. Artif. Intell., 1999)

Robust Implementaion of Finite Automata by Recurrent RBF Networks. - Michal Sorel; Jirí Síma (SOFSEM, 2000)

Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard. - Jirí Síma (ALT, 2001)

Exponential Transients in Continuous-Time Symmetric Hopfield Nets. - Jirí Síma; Pekka Orponen (ICANN, 2001)

Computing with continuous-time Liapunov systems. - Jirí Síma; Pekka Orponen (STOC, 2001)

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. - Jirí Síma; Pekka Orponen; Teemu Antti-Poika (Neural Comput., 2001)

Training a Single Sigmoidal Neuron Is Hard. - Jirí Síma (Neural Comput., 2002)

On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays. - Jirí Síma (ALT, 2003)

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. - Jirí Síma; Pekka Orponen (Neural Comput., 2003)

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. - Jirí Síma; Pekka Orponen (Neural Comput., 2003)

Exponential transients in continuous-time Liapunov systems. - Jirí Síma; Pekka Orponen (Theor. Comput. Sci., 2003)

Robust RBF finite automata. - Michal Sorel; Jirí Síma (Neurocomputing, 2004)

Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets. - Jirí Síma (ICANN (1), 2005)

On the Nonlearnability of a Single Spiking Neuron. - Jirí Síma; Jirí Sgall (Neural Comput., 2005)

On the NP-Completeness of Some Graph Cluster Measures. - Jirí Síma; Satu Elisa Schaeffer (SOFSEM, 2006)

A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. - Jirí Síma; Stanislav Zák (SOFSEM (1), 2007)

Gradient Learning in Networks of Smoothly Spiking Neurons. - Jirí Síma (ICONIP (2), 2008)

Sequential Triangle Strip Generator Based on Hopfield Networks. - Jirí Síma; Radim Lnenicka (Neural Comput., 2009)

Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. - Jirí Síma; Stanislav Zák (CSR, 2011)

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). - Jirí Síma; Stanislav Zák (SOFSEM, 2012)

A Low-Energy Implementation of Finite Automata by Optimal-Size Neural Nets. - Jirí Síma (ICANN, 2013)

A Turing Machine Distance Hierarchy. - Stanislav Zák; Jirí Síma (LATA, 2013)

The Power of Extra Analog Neuron. - Jirí Síma (TPNC, 2014)

Energy Complexity of Recurrent Neural Networks. - Jirí Síma (Neural Comput., 2014)

Neural networks between integer and rational weights. - Jirí Síma (IJCNN, 2017)

Cut Languages in Rational Bases. - Jirí Síma; Petr Savický (LATA, 2017)

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity. - Jirí Síma; Stanislav Zák (Fundam. Informaticae, 2017)

Three Analog Neurons Are Turing Universal. - Jirí Síma (TPNC, 2018)

Quasi-periodic β-expansions and cut languages. - Jirí Síma; Petr Savický (Theor. Comput. Sci., 2018)

Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural Networks. - Jérémie Cabessa; Jirí Síma (ICANN (1), 2019)

Counting with Analog Neurons. - Jirí Síma (ICANN (1), 2019)

One Analog Neuron Cannot Recognize Deterministic Context-Free Languages. - Jirí Síma; Martin Plátek (ICONIP (3), 2019)

Subrecursive neural networks. - Jirí Síma (Neural Networks, 2019)

Pumping Deterministic Monotone Restarting Automata and DCFL. - Frantisek Mráz; Dana Pardubská; Martin Plátek; Jirí Síma (ITAT, 2020)

Analog neuron hierarchy. - Jirí Síma (Neural Networks, 2020)

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. - Martin Plátek; Frantisek Mráz; Dana Pardubská; Daniel Prusa; Jirí Síma (ITAT, 2021)

The Simplest Non-Regular Deterministic Context-Free Language. - Petr Jancar; Jirí Síma (MFCS, 2021)

A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. - Jirí Síma; Stanislav Zák (Fundam. Informaticae, 2021)

Stronger separation of analog neuron hierarchy by deterministic context-free languages. - Jirí Síma (Neurocomputing, 2022)

Energy Complexity Model for Convolutional Neural Networks. - Jirí Síma; Petra Vidnerová; Vojtech Mrazek (ICANN (10), 2023)

Energy Complexity of Fully-Connected Layers. - Jirí Síma; Jérémie Cabessa (IWANN (1), 2023)

Energy Complexity of Convolutional Neural Networks. - Jirí Síma; Petra Vidnerová; Vojtech Mrazek (Neural Comput., 2024)

On energy complexity of fully-connected layers. - Jirí Síma; Jérémie Cabessa; Petra Vidnerová (Neural Networks, 2024)