default search action
Vojtech Vorel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c7]Robert Ferens
, Marek Szykula
Lower Bounds on Avoiding Thresholds. MFCS 2021: 46:1-46:14
2010 – 2019
- 2019
- [j9]Dmitry S. Ananichev, Vojtech Vorel:
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. J. Autom. Lang. Comb. 24(2-4): 153-164 (2019) - [j8]Vojtech Vorel, Adam Roman:
Complexity of road coloring with prescribed reset words. J. Comput. Syst. Sci. 104: 342-358 (2019) - [j7]Petr Kucera
A lower bound on CNF encodings of the at-most-one constraint. Theor. Comput. Sci. 762: 51-73 (2019) - 2018
- [j6]Vojtech Vorel:
On Basic Properties of Jumping Finite Automata. Int. J. Found. Comput. Sci. 29(1): 1-16 (2018) - 2017
- [j5]Vojtech Vorel:
Complexity of a problem concerning reset words for Eulerian binary automata. Inf. Comput. 253: 497-509 (2017) - [j4]Vojtech Vorel:
Two Results on Discontinuous Input Processing. J. Autom. Lang. Comb. 22(1-3): 189-203 (2017) - [j3]Henning Fernau
Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679: 31-52 (2017) - [c6]Petr Kucera, Petr Savický, Vojtech Vorel:
A Lower Bound on CNF Encodings of the At-Most-One Constraint. SAT 2017: 412-428 - [i8]Petr Kucera, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. CoRR abs/1704.08934 (2017) - 2016
- [j2]Vojtech Vorel:
Subset Synchronization and Careful Synchronization of Binary Finite Automata. Int. J. Found. Comput. Sci. 27(5): 557-578 (2016) - [c5]Vojtech Vorel:
Two Results on Discontinuous Input Processing. DCFS 2016: 205-216 - [c4]Marek Szykula
An Extremal Series of Eulerian Synchronizing Automata. DLT 2016: 380-392 - [i7]Vojtech Vorel, Marek Szykula:
An Extremal Series of Eulerian Synchronizing Automata. CoRR abs/1604.02879 (2016) - 2015
- [j1]Vojtech Vorel, Adam Roman:
Parameterized Complexity of Synchronization and Road Coloring. Discret. Math. Theor. Comput. Sci. 17(1): 283-306 (2015) - [c3]Vojtech Vorel, Adam Roman:
Complexity of Road Coloring with Prescribed Reset Words. LATA 2015: 161-172 - [i6]Vojtech Vorel:
On Basic Properties of Jumping Finite Automata. CoRR abs/1511.08396 (2015) - [i5]Vojtech Vorel:
Two Results on Discontinuous Input Processing. CoRR abs/1511.08642 (2015) - [i4]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and Complexity Results on Jumping Finite Automata. CoRR abs/1512.00482 (2015) - 2014
- [c2]Vojtech Vorel:
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata. LATA 2014: 576-587 - [c1]Vojtech Vorel:
Subset Synchronization of Transitive Automata. AFL 2014: 370-381 - [i3]Vojtech Vorel:
Detecting Short Reset Words Parameterized by Number of States. CoRR abs/1403.4749 (2014) - [i2]Vojtech Vorel:
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata. CoRR abs/1409.2003 (2014) - [i1]Vojtech Vorel, Adam Roman:
Complexity of Road Coloring with Prescribed Reset Words. CoRR abs/1412.0799 (2014)
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-04-24 22:57 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: