Department of Computer Science
Total number of titles in2012:9
BABIAK, Tomáš - STREJČEK, Jan - ŘEHÁK, Vojtěch.
Almost Linear Büchi Automata. Mathematical Structures in Computer Science, Cambridge, Cambridge University Press, Great Britain. ISSN 0960-1295, 2012, vol. to appear, 26 p.
BARNAT, Jiří - BAUCH, Petr - BRIM, Luboš - ČEŠKA, Milan.
Designing Fast LTL Model Checking Algorithms for Many-core GPUs. Journal of Parallel and Distributed Computing, , Elsevier. ISSN 0743-7315, 2012.
PAUNKOVIC, N - BOUDA, Jan - MATEUS, P.
Fair and optimistic quantum contract signing. Phys. Rev. A, USA, The American Physical Society, USA. ISSN 1094-1622, 2012, p. to appear.
BABIAK, Tomáš - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
LTL to Büchi Automata Translation: Fast and More Deterministic. In TACAS 2012: 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Berlin, Heidelberg : Springer-Verlag, 2012. 15 p. 2012, Tallinn, Estonia.
BARNAT, Jiří - BRIM, Luboš - KREJČÍ, Adam - STRECK, Adam - ŠAFRÁNEK, David - VEJNÁR, Martin - VEJPUSTEK, Tomáš.
On Parameter Synthesis by Parallel Model Checking. IEEE/ACM Transactions on Computational Biology and Bioinformatics. ISSN 1545-5963, 2012, vol. 99, no. PrePrints, 14 p.
BARNAT, Jiří - BRIM, Luboš - ROČKAI, Petr.
On-the-fly Parallel Model Checking Algorithm that is Optimal for Verification of Weak LTL Properties. Science of Computer Programming, , Elsevier. ISSN 0167-6423, 2012, vol. 2011, no. 0.
GANIAN, Robert.
Parameterized Algorithms on Width Parameters of Graphs. 2012.
YORDANOV, Boyan - TŮMOVÁ, Jana - ČERNÁ, Ivana - BARNAT, Jiří - BELTA, Calin.
Temporal Logic Control of Discrete-Time Piecewise Affine Systems. IEEE Transactions on Automatic Control. ISSN 0018-9286, 2012. In print. Scheduled issue of publication: Volume 57 (2012), Issue 6 (June).
HLINĚNÝ, Petr - CHIMANI, Markus - MUTZEL, Petra.
Vertex insertion approximates the crossing number of apex graphs. European Journal of Combinatorics, , Elsevier, USA. ISSN 0195-6698, 2012, p. to appear.











