Остановите войну!
for scientists:
default search action
Tomás Vojnar
- > Home > Persons > Tomás Vojnar
Publications
- 2022
- [j25]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
SagTree: Towards efficient mutation in evolutionary circuit approximation. Swarm Evol. Comput. 69: 100986 (2022) - [c115]Roman Andriushchenko, Milan Ceska, Vladimír Marcin, Tomás Vojnar:
GPU-Accelerated Synthesis of Probabilistic Programs. EUROCAST 2022: 258-266 - [i19]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Tomás Vojnar:
Designing Approximate Arithmetic Circuits with Combined Error Constraints. CoRR abs/2206.13077 (2022) - 2020
- [j23]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
Adaptive verifiability-driven strategy for evolutionary approximation of arithmetic circuits. Appl. Soft Comput. 95: 106466 (2020) - [j20]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. 22(5): 523-539 (2020) - [c107]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Tomás Vojnar:
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits. SAT 2020: 481-491 - [i16]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
Adaptive Verifiability-Driven Strategy for Evolutionary Approximation of Arithmetic Circuits. CoRR abs/2003.02491 (2020) - 2019
- [c100]Milan Ceska Jr., Milan Ceska, Jirí Matyás, Adam Pankuch, Tomás Vojnar:
Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error. EUROCAST (1) 2019: 482-490 - [c99]Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar:
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM 2019: 109-117 - 2018
- [c96]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
ADAC: Automated Design of Approximate Circuits. CAV (1) 2018: 612-620 - [c92]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) 2018: 155-175 - 2017
- [c88]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished. ICCAD 2017: 416-423 - [i6]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. CoRR abs/1710.08647 (2017) - 2009
- [e1]Milan Ceska, Zdenek Kotásek, Mojmír Kretínský, Ludek Matyska, Tomás Vojnar:
Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2008, Znojmo, Czech Republic, November 14-16, 2008. Electronic Notes in Theoretical Computer Science 251, Elsevier 2009 [contents] - 2008
- [c24]Milan Ceska, Zdenek Kotásek, Mojmír Kretínský, Ludek Matyska, Tomás Vojnar:
Preface. MEMICS 2008: 1-3
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-03-24 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint