We stand with Ukraine

We stand with Ukraine

Jirí Síma

Affiliations:

Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic

According to our database¹, Jirí Síma authored at least 50 papers between 1994 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2024

On energy complexity of fully-connected layers.

[BibT_eX]

[DOI]

,

Jérémie Cabessa

,

Petra Vidnerová

Neural Networks, 2024

2023

Energy Complexity of Fully-Connected Layers.

[BibT_eX]

[DOI]

,

Jérémie Cabessa

Proceedings of the Advances in Computational Intelligence, 2023

Energy Complexity Model for Convolutional Neural Networks.

[BibT_eX]

[DOI]

,

Petra Vidnerová

,

Proceedings of the Artificial Neural Networks and Machine Learning, 2023

2022

Stronger separation of analog neuron hierarchy by deterministic context-free languages.

[BibT_eX]

[DOI]

Neurocomputing, 2022

2021

A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2021

The Simplest Non-Regular Deterministic Context-Free Language.

[BibT_eX]

[DOI]

,

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns.

[BibT_eX]

[DOI]

,

Frantisek Mráz

,

Dana Pardubská

,

,

Proceedings of the 21st Conference Information Technologies, 2021

2020

Analog neuron hierarchy.

[BibT_eX]

[DOI]

Neural Networks, 2020

Pumping Deterministic Monotone Restarting Automata and DCFL.

[BibT_eX]

[DOI]

Frantisek Mráz

,

Dana Pardubská

,

,

Proceedings of the 20th Conference Information Technologies, 2020

2019

Subrecursive neural networks.

[BibT_eX]

[DOI]

Neural Networks, 2019

One Analog Neuron Cannot Recognize Deterministic Context-Free Languages.

[BibT_eX]

[DOI]

,

Proceedings of the Neural Information Processing - 26th International Conference, 2019

Counting with Analog Neurons.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Theoretical Neural Computation, 2019

Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural Networks.

[BibT_eX]

[DOI]

Jérémie Cabessa

,

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Theoretical Neural Computation, 2019

2018

Quasi-periodic <i>β</i>-expansions and cut languages.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2018

Three Analog Neurons Are Turing Universal.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

2017

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2017

Cut Languages in Rational Bases.

[BibT_eX]

[DOI]

,

Proceedings of the Language and Automata Theory and Applications, 2017

Neural networks between integer and rational weights.

[BibT_eX]

[DOI]

Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

2014

Energy Complexity of Recurrent Neural Networks.

[BibT_eX]

[DOI]

Neural Comput., 2014

The Power of Extra Analog Neuron.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing, 2014

2013

A Turing Machine Distance Hierarchy.

[BibT_eX]

[DOI]

,

Proceedings of the Language and Automata Theory and Applications, 2013

A Low-Energy Implementation of Finite Automata by Optimal-Size Neural Nets.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2013, 2013

2012

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract).

[BibT_eX]

[DOI]

,

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

2011

Almost <i>k</i>-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs.

[BibT_eX]

[DOI]

,

Proceedings of the Computer Science - Theory and Applications, 2011

2009

Sequential Triangle Strip Generator Based on Hopfield Networks.

[BibT_eX]

[DOI]

,

Neural Comput., 2009

2008

Gradient Learning in Networks of Smoothly Spiking Neurons.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neuro-Information Processing, 15th International Conference, 2008

2007

A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3.

[BibT_eX]

[DOI]

,

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

2006

On the NP-Completeness of Some Graph Cluster Measures.

[BibT_eX]

[DOI]

,

Satu Elisa Schaeffer

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

2005

On the Nonlearnability of a Single Spiking Neuron.

[BibT_eX]

[DOI]

,

Neural Comput., 2005

Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks: Biological Inspirations, 2005

2004

Robust RBF finite automata.

[BibT_eX]

[DOI]

,

Neurocomputing, 2004

2003

Exponential transients in continuous-time Liapunov systems.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2003

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results.

[BibT_eX]

[DOI]

,

Neural Comput., 2003

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal.

[BibT_eX]

[DOI]

,

Neural Comput., 2003

On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002

Training a Single Sigmoidal Neuron Is Hard.

[BibT_eX]

[DOI]

Neural Comput., 2002

2001

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets.

[BibT_eX]

[DOI]

,

,

Teemu Antti-Poika

Neural Comput., 2001

Computing with continuous-time Liapunov systems.

[BibT_eX]

[DOI]

,

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Exponential Transients in Continuous-Time Symmetric Hopfield Nets.

[BibT_eX]

[DOI]

,

Proceedings of the Artificial Neural Networks, 2001

Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Robust Implementaion of Finite Automata by Recurrent RBF Networks.

[BibT_eX]

[DOI]

,

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

1999

Table Rounding Problem.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1999

Some Afterthoughts on Hopfield Networks.

[BibT_eX]

[DOI]

,

,

Teemu Antti-Poika

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

1998

Theory of Neuromata.

[BibT_eX]

[DOI]

,

Jirí Wiedermann

J. ACM, 1998

1996

Back-propagation is not Efficient.

[BibT_eX]

[DOI]

Neural Networks, 1996

Aunt's Problem: Table Rounding.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995

Neural expert systems.

[BibT_eX]

[DOI]

Neural Networks, 1995

Hopfield Languages.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995

Neural Language Acceptors.

[BibT_eX]

,

Jirí Wiedermann

Proceedings of the Developments in Language Theory II, 1995

1994

Loading Deep Networks Is Hard.

[BibT_eX]

[DOI]

Neural Comput., 1994

Loading...