default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Síma
Person information
- affiliation: Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic
- unicode name: Jiří Šíma
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Jirí Síma, Jérémie Cabessa
, Petra Vidnerová:
On energy complexity of fully-connected layers. Neural Networks 178: 106419 (2024)- 2023
- [c29]Jirí Síma, Petra Vidnerová, Vojtech Mrazek:
Energy Complexity Model for Convolutional Neural Networks. ICANN (10) 2023: 186-198 - [c28]Jirí Síma, Jérémie Cabessa:
Energy Complexity of Fully-Connected Layers. IWANN (1) 2023: 3-15 - 2022
- [j20]Jirí Síma:
Stronger separation of analog neuron hierarchy by deterministic context-free languages. Neurocomputing 493: 605-612 (2022) - 2021
- [j19]Jirí Síma, Stanislav Zák:
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Fundam. Informaticae 184(4): 307-354 (2021) - [c27]Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma:
On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. ITAT 2021: 140-146 - [c26]Petr Jancar, Jirí Síma:
The Simplest Non-Regular Deterministic Context-Free Language. MFCS 2021: 63:1-63:18 - [i5]Jirí Síma, Stanislav Zák:
A polynomial time construction of a hitting set for read-once branching programs of width 3. CoRR abs/2101.01151 (2021) - [i4]Jirí Síma:
Stronger Separation of Analog Neuron Hierarchy by Deterministic Context-Free Languages. CoRR abs/2102.01633 (2021) - [i3]Petr Jancar, Jirí Síma:
Simplest Non-Regular Deterministic Context-Free Language. CoRR abs/2102.10416 (2021) - 2020
- [j18]Jirí Síma:
Analog neuron hierarchy. Neural Networks 128: 199-215 (2020) - [c25]Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma:
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT 2020: 51-58
2010 – 2019
- 2019
- [j17]Jirí Síma:
Subrecursive neural networks. Neural Networks 116: 208-223 (2019) - [c24]Jirí Síma:
Counting with Analog Neurons. ICANN (1) 2019: 389-400 - [c23]Jérémie Cabessa, Jirí Síma:
Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural Networks. ICANN (1) 2019: 806-818 - [c22]Jirí Síma, Martin Plátek:
One Analog Neuron Cannot Recognize Deterministic Context-Free Languages. ICONIP (3) 2019: 77-89 - 2018
- [j16]Jirí Síma, Petr Savický:
Quasi-periodic β-expansions and cut languages. Theor. Comput. Sci. 720: 1-23 (2018) - [c21]Jirí Síma:
Three Analog Neurons Are Turing Universal. TPNC 2018: 460-472 - 2017
- [j15]Jirí Síma, Stanislav Zák:
On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity. Fundam. Informaticae 152(4): 397-409 (2017) - [c20]Jirí Síma:
Neural networks between integer and rational weights. IJCNN 2017: 154-161 - [c19]Jirí Síma, Petr Savický:
Cut Languages in Rational Bases. LATA 2017: 311-322 - 2014
- [j14]Jirí Síma:
Energy Complexity of Recurrent Neural Networks. Neural Comput. 26(5): 953-973 (2014) - [c18]Jirí Síma:
The Power of Extra Analog Neuron. TPNC 2014: 243-254 - 2013
- [c17]Jirí Síma:
A Low-Energy Implementation of Finite Automata by Optimal-Size Neural Nets. ICANN 2013: 114-121 - [c16]Stanislav Zák, Jirí Síma:
A Turing Machine Distance Hierarchy. LATA 2013: 570-578 - 2012
- [c15]Jirí Síma, Stanislav Zák:
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). SOFSEM 2012: 406-418 - 2011
- [c14]Jirí Síma, Stanislav Zák:
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. CSR 2011: 120-133 - 2010
- [i2]Jirí Síma, Stanislav Zák:
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j13]Jirí Síma, Radim Lnenicka:
Sequential Triangle Strip Generator Based on Hopfield Networks. Neural Comput. 21(2): 583-617 (2009) - 2008
- [c13]Jirí Síma:
Gradient Learning in Networks of Smoothly Spiking Neurons. ICONIP (2) 2008: 179-186 - 2007
- [c12]Jirí Síma, Stanislav Zák:
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. SOFSEM (1) 2007: 522-531 - 2006
- [c11]Jirí Síma, Satu Elisa Schaeffer:
On the NP-Completeness of Some Graph Cluster Measures. SOFSEM 2006: 530-537 - 2005
- [j12]Jirí Síma, Jirí Sgall:
On the Nonlearnability of a Single Spiking Neuron. Neural Comput. 17(12): 2635-2647 (2005) - [c10]Jirí Síma:
Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets. ICANN (1) 2005: 199-204 - [i1]Jirí Síma, Satu Elisa Schaeffer:
On the NP-Completeness of Some Graph Cluster Measures. CoRR abs/cs/0506100 (2005) - 2004
- [j11]Michal Sorel, Jirí Síma:
Robust RBF finite automata. Neurocomputing 62: 93-110 (2004) - 2003
- [j10]Jirí Síma, Pekka Orponen:
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. Neural Comput. 15(3): 693-733 (2003) - [j9]Jirí Síma, Pekka Orponen:
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. Neural Comput. 15(12): 2727-2778 (2003) - [j8]Jirí Síma, Pekka Orponen:
Exponential transients in continuous-time Liapunov systems. Theor. Comput. Sci. 306(1-3): 353-372 (2003) - [c9]Jirí Síma:
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays. ALT 2003: 221-233 - 2002
- [j7]Jirí Síma:
Training a Single Sigmoidal Neuron Is Hard. Neural Comput. 14(11): 2709-2728 (2002) - 2001
- [j6]Jirí Síma, Pekka Orponen, Teemu Antti-Poika:
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. Neural Comput. 12(12): 2965-2989 (2001) - [c8]Jirí Síma:
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard. ALT 2001: 92-105 - [c7]Jirí Síma, Pekka Orponen:
Exponential Transients in Continuous-Time Symmetric Hopfield Nets. ICANN 2001: 806-813 - [c6]Jirí Síma, Pekka Orponen:
Computing with continuous-time Liapunov systems. STOC 2001: 722-731 - 2000
- [c5]Michal Sorel, Jirí Síma:
Robust Implementaion of Finite Automata by Recurrent RBF Networks. SOFSEM 2000: 431-439
1990 – 1999
- 1999
- [j5]Jirí Síma:
Table Rounding Problem. Comput. Artif. Intell. 18(2): 175-189 (1999) - [c4]Jirí Síma, Pekka Orponen, Teemu Antti-Poika:
Some Afterthoughts on Hopfield Networks. SOFSEM 1999: 459-469 - 1998
- [j4]Jirí Síma, Jirí Wiedermann:
Theory of Neuromata. J. ACM 45(1): 155-178 (1998) - 1996
- [j3]Jirí Síma:
Back-propagation is not Efficient. Neural Networks 9(6): 1017-1023 (1996) - [c3]Jirí Síma:
Aunt's Problem: Table Rounding. SOFSEM 1996: 441-450 - 1995
- [j2]Jirí Síma:
Neural expert systems. Neural Networks 8(2): 261-271 (1995) - [c2]Jirí Síma, Jirí Wiedermann:
Neural Language Acceptors. Developments in Language Theory 1995: 430-439 - [c1]Jirí Síma:
Hopfield Languages. SOFSEM 1995: 461-468 - 1994
- [j1]Jirí Síma:
Loading Deep Networks Is Hard. Neural Comput. 6(5): 842-850 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
