Vojtech Vorel

24 papers A 1B 1C 3Journal 17Unranked 2
YearRankTypeTitle / Venue / Authors
2021 B conf
Lower Bounds on Avoiding Thresholds.
MFCS
Robert Ferens, Marek Szykula, Vojtech Vorel
2019 J jnl
A lower bound on CNF encodings of the at-most-one constraint.
Theor. Comput. Sci.
Petr Kucera, Petr Savický, Vojtech Vorel
2019 J jnl
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink.
J. Autom. Lang. Comb.
Dmitry S. Ananichev, Vojtech Vorel
2019 J jnl
Complexity of road coloring with prescribed reset words.
J. Comput. Syst. Sci.
Vojtech Vorel, Adam Roman
2018 J jnl
On Basic Properties of Jumping Finite Automata.
Int. J. Found. Comput. Sci.
Vojtech Vorel
2017 A conf
A Lower Bound on CNF Encodings of the At-Most-One Constraint.
SAT
Petr Kucera, Petr Savický, Vojtech Vorel
2017 J jnl
A lower bound on CNF encodings of the at-most-one constraint.
CoRR
Petr Kucera, Petr Savický, Vojtech Vorel
2017 J jnl
Characterization and complexity results on jumping finite automata.
Theor. Comput. Sci.
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
2017 J jnl
Complexity of a problem concerning reset words for Eulerian binary automata.
Inf. Comput.
Vojtech Vorel
2017 J jnl
Two Results on Discontinuous Input Processing.
J. Autom. Lang. Comb.
Vojtech Vorel
2016 C conf
An Extremal Series of Eulerian Synchronizing Automata.
DLT
Marek Szykula, Vojtech Vorel
2016 J jnl
An Extremal Series of Eulerian Synchronizing Automata.
CoRR
Vojtech Vorel, Marek Szykula
2016 J jnl
Subset Synchronization and Careful Synchronization of Binary Finite Automata.
Int. J. Found. Comput. Sci.
Vojtech Vorel
2016 — conf
Two Results on Discontinuous Input Processing.
DCFS
Vojtech Vorel
2015 J jnl
Characterization and Complexity Results on Jumping Finite Automata.
CoRR
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
2015 C conf
Complexity of Road Coloring with Prescribed Reset Words.
LATA
Vojtech Vorel, Adam Roman
2015 J jnl
On Basic Properties of Jumping Finite Automata.
CoRR
Vojtech Vorel
2015 J jnl
Parameterized Complexity of Synchronization and Road Coloring.
Discret. Math. Theor. Comput. Sci.
Vojtech Vorel, Adam Roman
2015 J jnl
Two Results on Discontinuous Input Processing.
CoRR
Vojtech Vorel
2014 J jnl
Complexity of Road Coloring with Prescribed Reset Words.
CoRR
Vojtech Vorel, Adam Roman
2014 C conf
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata.
LATA
Vojtech Vorel
2014 J jnl
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata.
CoRR
Vojtech Vorel
2014 J jnl
Detecting Short Reset Words Parameterized by Number of States.
CoRR
Vojtech Vorel
2014 — conf
Subset Synchronization of Transitive Automata.
AFL
Vojtech Vorel