Masaryk University

Publication Records

česky | in English

Filter publications

    2022

    1. KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. General Optimization Framework for Recurrent Reachability Objectives. In Luc De Raedt. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022. Neuveden: ijcai.org. p. 4642-4648. ISBN 978-1-956792-00-3. doi:10.24963/ijcai.2022/644. 2022.
    2. JANČÁR, Ján, Marcel FOURNÉ, Daniel DE ALMEIDA BRAGA, Mohamed SABT, Peter SCHWABE, Gilles BARTHE, Pierre-Alain FOUQUE and Yasemin ACAR. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. In 43rd IEEE Symposium on Security and Privacy. San Francisco: IEEE. p. 632-649. ISBN 978-1-6654-1316-9. doi:10.1109/SP46214.2022.9833713. 2022.

    2021

    1. PAULUS, Anselm, Michal ROLÍNEK, Vít MUSIL, Brandon AMOS and Georg MARTIUS. CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. In Meila, M; Zhang, T. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139. 139th ed. SAN DIEGO: JMLR-JOURNAL MACHINE LEARNING RESEARCH. p. 8443-8453. ISBN 978-1-7138-4506-5. 2021.
    2. BENEŠ, Nikola, Luboš BRIM, Samuel PASTVA and David ŠAFRÁNEK. Computing Bottom SCCs Symbolically Using Transition Guided Reduction. In Alexandra Silva, K. Rustan, M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021. Neuveden: Springer Nature. p. 505-528. ISBN 978-3-030-81684-1. doi:10.1007/978-3-030-81685-8_24. 2021.
    3. BENDÍK, Jaroslav and Kuldeep S. MEEL. Counting Maximal Satisfiable Subsets. In 35th AAAI Conference on Artificial Intelligence (AAAI-21). Palo Alto: AAAI. p. 3651-3660. ISBN 978-1-57735-866-4. 2021.
    4. BENDÍK, Jaroslav and Kuldeep S. MEEL. Counting Minimal Unsatisfiable Subsets. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference. Cham: Springer. p. 313-336. ISBN 978-3-030-81687-2. doi:10.1007/978-3-030-81688-9_15. 2021.
    5. CHALUPA, Marek, David KLAŠKA, Jan STREJČEK and Lukáš TOMOVIČ. Fast Computation of Strong Control Dependencies. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham. p. 887-910. ISBN 978-3-030-81687-2. doi:10.1007/978-3-030-81688-9_41. 2021.
    6. HERMOSILLA CASAJÚS, Pedro, Marco SCHÄFER, Matěj LANG, Gloria FACKELMANN, Pere-Pau VÁZQUEZ ALCOCER, Barbora KOZLÍKOVÁ, Michael KRONE, Tobias RITSCHEL and Timo ROPINSKI. Intrinsic-Extrinsic Convolution and Pooling for Learning on 3D Protein Structures. In International Conference on Learning Representations (ICLR). 2021.
    7. CHATTERJEE, Krishnendu, Ehsan Kafshdar GOHARSHADY, Petr NOVOTNÝ and Djordje ŽIKELIĆ. Proving non-termination by program reversal. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). New York, NY, USA: ACM. p. 1033-1048. ISBN 978-1-4503-8391-2. doi:10.1145/3453483.3454093. 2021.
    8. WALLNER, Günter, Marnix van WIJLAND, Regina BERNHAUPT and Simone KRIGLSTEIN. What Players Want: Information Needs of Players on Post-Game Visualizations. In CHI Conference on Human Factors in Computing Systems (CHI '21). New York: Association for Computing Machinery. p. 1-13. ISBN 978-1-4503-8096-6. doi:10.1145/3411764.3445174. 2021.

    2020

    1. KLAŠKA, David, Antonín KUČERA and Vojtěch ŘEHÁK. Adversarial Patrolling with Drones. In Proceedings of the 2020 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems. p. 629-637. ISBN 978-1-4503-7518-4. doi:10.5555/3398761.3398837. 2020.
    2. BENEŠ, Nikola, Luboš BRIM, Jakub KADLECAJ, Samuel PASTVA and David ŠAFRÁNEK. AEON: Attractor Bifurcation Analysis of Parametrised Boolean Networks. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification. CAV 2020. LNCS 12224. Cham: Springer, Cham. p. 569-581. ISBN 978-3-030-53287-1. doi:10.1007/978-3-030-53288-8_28. 2020.
    3. BENDÍK, Jaroslav and Kuldeep S. MEEL. Approximate Counting of Minimal Unsatisfiable Subsets. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020. Neuveden: Springer, Cham. p. 439-462. ISBN 978-3-030-53287-1. doi:10.1007/978-3-030-53288-8_21. 2020.
    4. KUČERA, Antonín, Jérôme LEROUX and Dominik VELAN. Efficient Analysis of VASS Termination Complexity. In Holger Hermanns, Lijun Zhang, Naoki Kobayashi, Dale Miller. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, USA: ACM. p. 676-688. ISBN 978-1-4503-7104-9. doi:10.1145/3373718.3394751. 2020.
    5. BLONDIN, Michael, Javier ESPARZA, Martin HELFRICH, Antonín KUČERA and Philipp MEYER. Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. In Shuvendu K. Lahiri, Chao Wang. Computer Aided Verification, CAV 2020. Cham, Německo: Springer International Publishing. p. 372-397. ISBN 978-3-030-53290-1. doi:10.1007/978-3-030-53291-8_20. 2020.
    6. DĘBSKI, Michał Karol, Stefan FELSNER, Piotr MICEK and Felix SCHRÖDER. Improved bounds for centered colorings. In Shuchi Chawla. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Not specified: SIAM. p. 2212-2226. ISBN 978-1-61197-599-4. doi:10.1137/1.9781611975994.136. 2020.
    7. CHATTERJEE, Krishnendu, Martin CHMELÍK, Deep KARKHANIS, Petr NOVOTNÝ and Amélie ROYER. Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. In Proceedings of the International Conference on Automated Planning and Scheduling. Palo Alto: AAAI Press. p. 48-56. ISBN 978-1-57735-824-4. 2020.
    8. BLAHOUDEK, František, Tomáš BRÁZDIL, Petr NOVOTNÝ, Melkior ORNIK, Pranay THANGEDA and Ufuk TOPCU. Qualitative Controller Synthesis for Consumption Markov Decision Processes. In Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}. Cham: Springer. p. 421-447. ISBN 978-3-030-53290-1. doi:10.1007/978-3-030-53291-8_22. 2020.
    9. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Petr NOVOTNÝ and Jiří VAHALA. Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. Palo Alto, California, USA: AAAI Press. p. 9794-9801. ISBN 978-1-57735-823-7. doi:10.1609/aaai.v34i06.6531. 2020.
    10. BLAHOUDEK, František, Alexandre DURET-LUTZ and Jan STREJČEK. Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II. Cham (Switzerland): Springer. p. 15-27. ISBN 978-3-030-53290-1. doi:10.1007/978-3-030-53291-8_2. 2020.
    11. NIFORATOS, Evangelos, Adam PALMA, Roman GLUSZNY, Athanasios VOURVOPOULOS and Fotios LIAROKAPIS. Would You Do It?: Enacting Moral Dilemmas in Virtual Reality for Understanding Ethical Decision-Making. In Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems. New York, NY, USA: ACM. p. 1-12. ISBN 978-1-4503-6708-0. doi:10.1145/3313831.3376788. 2020.

    2019

    1. ŠKOLA, Filip and Fotis LIAROKAPIS. Examining And Enhancing The Illusory Touch Perception In Virtual Reality Using Non-Invasive Brain Stimulation. In Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, Paper No. 247. Glasgow, Scotland Uk: ACM Press. p. 1-12. ISBN 978-1-4503-5970-2. doi:10.1145/3290605.3300477. 2019.
    2. CHREN, Stanislav, Barbora BÜHNOVÁ, Martin MACÁK, Lukáš DAUBNER and Bruno ROSSI. Mistakes in UML Diagrams: Analysis of Student Projects in a Software Engineering Course. In Sarah Beecham, Daniela Damian. Proceedings of the 41st International Conference on Software Engineering: Software Engineering Education and Training. Piscataway, NJ, USA: IEEE Press. p. 100-109. ISBN 978-1-7281-1000-4. doi:10.1109/ICSE-SEET.2019.00019. 2019.
    3. ASHOK, Pranav, Jan KŘETÍNSKÝ and Maximilian WEININGER. PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. In Computer Aided Verification (CAV 2019). Cham: Springer. p. 497-519. ISBN 978-3-030-25539-8. doi:10.1007/978-3-030-25540-4_29. 2019.
    4. CALZAVARA, Stefano, Riccardo FOCARDI, Matúš NEMEC, Alvise RABITTI and Marco SQUARCINA. Postcards from the Post-HTTP World: Amplification of HTTPS Vulnerabilities in the Web Ecosystem. In Proceedings of the 40th IEEE Symposium on Security and Privacy. San Fransisco, CA, US: IEEE. p. 281-298. ISBN 978-1-5386-6660-9. doi:10.1109/SP.2019.00053. 2019.
    5. JONÁŠ, Martin and Jan STREJČEK. Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors. In Isil Dillig, Serdar Tasiran. CAV 2019: Computer Aided Verification. Cham (Switzerland): Springer. p. 64-73. ISBN 978-3-030-25542-8. doi:10.1007/978-3-030-25543-5_4. 2019.
    6. EIBEN, Eduard, Robert GANIAN, Dusan KNOP and Sebastian ORDYNIAK. Solving Integer Quadratic Programming via Explicit and Structural Restrictions. In Peter Stone. Proceedings of the AAAI Conference on Artificial Intelligence. USA: AAAI Press. p. 1477-1484. ISBN 978-1-57735-809-1. doi:10.1609/aaai.v33i01.33011477. 2019.
    7. EIBEN, Eduard, Robert GANIAN, Iyad KANJ and Stefan SZEIDER. The Parameterized Complexity of Cascading Portfolio Scheduling. In Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alche-Buc and Emily B. Fox and Roman Garnett. Advances in Neural Information Processing Systems 32 (NIPS 2019). USA: Neural Information Processing Systems Foundation, Inc. p. 7666-7676. ISBN 978-1-7281-1044-8. 2019.
    8. ALECHINA, Natasha, Tomáš BRÁZDIL, Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN and Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI. p. 2646-2653. ISBN 978-1-57735-809-1. doi:10.1609/aaai.v33i01.33012646. 2019.

    2018

    1. EIBEN, Eduard, Robert GANIAN and Sebastian ORDYNIAK. A Structural Approach to Activity Selection. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI). USA: ijcai.org. p. 203-209. ISBN 978-0-9992411-2-7. doi:10.24963/ijcai.2018/28. 2018.
    2. KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER and Vojtěch ŘEHÁK. Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. In Proceedings of the 2018 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems. p. 659-666. ISBN 978-1-5108-6808-3. doi:10.5555/3237383.3237481. 2018.
    3. KŘETÍNSKÝ, Jan and Tobias MEGGENDORFER. Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS '18). New York, NY, USA: ACM. p. 609-618. ISBN 978-1-4503-5583-4. doi:10.1145/3209108.3209176. 2018.
    4. CHALUPA, Marek, Krishnendu CHATTERJEE, Andreas PAVLOGIANNIS, Nishant SINHA and Kapil VAIDYA. Data-centric Dynamic Partial Order Reduction. In Proceedings of Symposium on Principles of Programming Languages 2018. New York: ACM. p. 1-30. ISSN 2475-1421. doi:10.1145/3158119. 2018.
    5. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ, Dominik VELAN and Florian ZULEGER. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. In Anuj Dawar, Erich Gradel. 2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Oxford, England: ACM. p. 185-194. ISBN 978-1-4503-5583-4. doi:10.1145/3209108.3209191. 2018.
    6. GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK and Stefan SZEIDER. Parameterized Algorithms for the Matrix Completion Problem. In Jennifer G. Dy, Andreas Krause. Proceedings of the 35th International Conference on Machine Learning (ICML). USA: PMLR. p. 1642-1651. ISBN 978-1-5108-6796-3. 2018.
    7. SCHMID, Stefan and Jiří SRBA. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. In IEEE International Conference on Computer Communications (INFOCOM'18). USA: IEEE. p. 1799-1807. ISBN 978-1-5386-4128-6. doi:10.1109/INFOCOM.2018.8486261. 2018.
    8. BRÁZDIL, Tomáš, Antonín KUČERA and Vojtěch ŘEHÁK. Solving Patrolling Problems in the Internet Environment. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden. Neuveden: International Joint Conferences on Artificial Intelligence. p. 121-127. ISBN 978-0-9992411-2-7. doi:10.24963/ijcai.2018/17. 2018.
    9. BOENNELAND, Frederik M., Peter G. JENSEN, Kim G. LARSEN, Marco MUNIZ and Jiří SRBA. Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. In Proceedings of the 30th International Conference on Computer Aided Verification (CAV'18). Netherlands: Springer. p. 527-546. ISBN 978-3-319-96144-6. doi:10.1007/978-3-319-96145-3_28. 2018.
    10. KIM, Doowon, Bum Jun KWON, Kristián KOZÁK, Christopher GATES and Tudor DUMITRAȘ. The Broken Shield: Measuring Revocation Effectiveness in the Windows Code-Signing PKI. In 27th USENIX Security Symposium (USENIX Security 18). Baltimore, MD: USENIX Association. p. 851-868. ISBN 978-1-931971-46-1. 2018.
    11. EIBEN, Eduard, Robert GANIAN, Dusan KNOP and Sebastian ORDYNIAK. Unary Integer Linear Programming with Structural Restrictions. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. USA: ijcai.org. p. 1284-1290. ISBN 978-0-9992411-2-7. doi:10.24963/ijcai.2018/179. 2018.
    12. KELMENDI, Edon, Julia KRÄMER, Jan KŘETÍNSKÝ and Maximilian WEININGER. Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. In Computer Aided Verification (CAV 2018). Cham: Springer. p. 623-642. ISBN 978-3-319-96144-6. doi:10.1007/978-3-319-96145-3_36. 2018.

    2017

    1. MAVROUDIS, Vasilios, Andrea CERULLI, Petr ŠVENDA, Daniel CVRČEK, Dušan KLINEC and George DANEZIS. A Touch of Evil: High-Assurance Cryptographic Hardware from Untrusted Components. In ACM. CCS '17: Proceedings of the 24th ACM SIGSAC Conference on Computer and Communications Security. Dallas, TX, USA: ACM. p. 1583-1600. ISBN 978-1-4503-4946-8. doi:10.1145/3133956.3133961. 2017.
    2. GANIAN, Robert, M.S. RAMANUJAN and Sebastian ORDYNIAK. Going Beyond Primal Treewidth for {(M)ILP}. In Satinder P. Singh; Shaul Markovitch. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. USA: AAAI. p. 815-821. ISBN 978-1-57735-781-0. 2017.
    3. BENEŠ, Nikola, Luboš BRIM, Martin DEMKO, Samuel PASTVA and David ŠAFRÁNEK. Pithya: A Parallel Tool for Parameter Synthesis of Piecewise Multi-Affine Dynamical Systems. In Rupak Majumdar and Viktor Kunčak. Computer Aided Verification. CAV 2017. LNCS 10426. Cham: Springer International Publishing. p. 591-598. ISBN 978-3-319-63386-2. doi:10.1007/978-3-319-63387-9_29. 2017.
    4. DVORAK, Pavel, Eduard EIBEN, Robert GANIAN, Dusan KNOP and Sebastian ORDYNIAK. Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. In Carles Sierra. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017. USA: ijcai.org. p. 607-613. ISBN 978-0-9992411-0-3. doi:10.24963/ijcai.2017/85. 2017.
    5. NEMEC, Matúš, Marek SÝS, Petr ŠVENDA, Dušan KLINEC and Václav MATYÁŠ. The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM. p. 1631-1648. ISBN 978-1-4503-4946-8. doi:10.1145/3133956.3133969. 2017.

    2016

    1. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK and M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016. New York, NY, USA: ACM. p. 176-184. ISBN 978-1-4503-4391-6. doi:10.1145/2933575.2935314. 2016.
    2. DUPONT DUPUIS, Frédéric, Serge FEHR, Philippe LAMONTAGNE and Louis SALVAIL. Adaptive versus non-adaptive strategies in the quantum setting with applications. In Robshaw, Matthew and Katz, Jonathan. Proceedings of CRYPTO 2016. Santa Barbara, CA: Springer Berlin Heidelberg. p. 33-59. ISBN 978-3-662-53014-6. doi:10.1007/978-3-662-53015-3_2. 2016.
    3. SICKERT, Salomon, Javier ESPARZA, Stefan JAAX and Jan KŘETÍNSKÝ. Limit-Deterministic Büchi Automata for Linear Temporal Logic. In Computer Aided Verification - 28th International Conference, CAV 2016. Switzerland: Springer. p. 312-332. ISBN 978-3-319-41539-0. doi:10.1007/978-3-319-41540-6_17. 2016.
    4. KUČERA, Antonín and Tomáš LAMSER. Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. In Catholijn M. Jonker, Stacy Marsella, John Thangarajah, Karl Tuyls. Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. New York: ACM. p. 1171-1179. ISBN 978-1-4503-4239-1. 2016.
    5. GANIAN, Robert and Sebastian ORDYNIAK. The Complexity Landscape of Decompositional Parameters for ILP. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press. p. 710-716. ISBN 978-1-57735-760-5. 2016.
    6. ŠVENDA, Petr, Matúš NEMEC, Peter SEKAN, Rudolf KVAŠŇOVSKÝ, David FORMÁNEK, David KOMÁREK and Václav MATYÁŠ. The Million-Key Question – Investigating the Origins of RSA Public Keys. In Thorsten Holz, Stefan Savage. Proceedings of 25th USENIX Security Symposium. Austin, Texas: USENIX Association. p. 893-910. ISBN 978-1-931971-32-4. 2016.
    7. GANIAN, Robert, Sebastian ORDYNIAK and Eduard EIBEN. Using Decomposition-Parameters for QBF: Mind the Prefix! In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press. p. 964-970. ISBN 978-1-57735-760-5. 2016.

    2015

    1. ABATE, Alessandro, Milan ČEŠKA, Luboš BRIM and Marta KWIATKOWSKA. Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks. In 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings. LNCS 9206. Berlin: Springer International Publishing. p. 195-213. ISBN 978-3-319-21689-8. doi:10.1007/978-3-319-21690-4_12. 2015.
    2. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Andreas FELLNER and Jan KŘETÍNSKÝ. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer. p. 158-177. ISBN 978-3-319-21689-8. doi:10.1007/978-3-319-21690-4_10. 2015.
    3. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, M.S. RAMANUJAN, Daniel LOKSHTANOV and Saket SAURABH. FO Model Checking on Posets of Bounded Width. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society. p. 963-974. ISBN 978-1-4673-8191-8. doi:10.1109/FOCS.2015.63. 2015.
    4. BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA and Petr NOVOTNÝ. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. In Neuveden. 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. Neuveden: IEEE. p. 44-55. ISBN 978-1-4799-8875-4. doi:10.1109/LICS.2015.15. 2015.
    5. BABIAK, Tomáš, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, Jan KŘETÍNSKÝ, David MÜLLER, David PARKER and Jan STREJČEK. The Hanoi Omega-Automata Format. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer. p. 479-486. ISBN 978-3-319-21689-8. doi:10.1007/978-3-319-21690-4_31. 2015.
    6. CHATTERJEE, Krishnendu, Zuzana KOMÁRKOVÁ and Jan KŘETÍNSKÝ. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Thirtieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Los Alamitos, California: IEEE. p. 244-256. ISBN 978-1-4799-8875-4. doi:10.1109/LICS.2015.32. 2015.
    7. KRONEGGER, Martin, Sebastian ORDYNIAK and Andreas PFANDLER. Variable-Deletion Backdoors to Planning. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Austin; United States: AI Access Foundation. p. 3305-3312. ISBN 978-1-57735-703-2. 2015.

    2014

    1. GASPERS, Serge, Sebastian ORDYNIAK, Stefan SZEIDER, Neelhara MISRA and Stanislav ZIVNY. Backdoors into Heterogeneous Classes of SAT and CSP. In Carla E. Brodley and Peter Stone. AAAI Press. Quebec: AAAI Press. p. 2652-2658. ISBN 978-1-57735-680-6. 2014.
    2. KRONEGGER, Martin, Sebastian ORDYNIAK and Andreas PFANDLER. Backdoors to Planning. In Carla E. Brodley and Peter Stone. AAAI Press. Quebec: AAAI Press. p. 2300-2307. ISBN 978-1-57735-679-0. 2014.
    3. ESPARZA, Javier and Jan KŘETÍNSKÝ. From LTL to Deterministic Automata: A Safraless Compositional Approach. In Computer Aided Verification - 26th International Conference, CAV 2014. Heidelberg Dordrecht London New York: Springer. p. 192-208. ISBN 978-3-319-08866-2. doi:10.1007/978-3-319-08867-9_13. 2014.
    4. BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA and Petr NOVOTNÝ. Minimizing Running Costs in Consumption Systems. In Armin Biere, Roderick Bloem. Computer Aided Verification. Neuveden: Springer International Publishing. p. 457-472. ISBN 978-3-319-08866-2. doi:10.1007/978-3-319-08867-9_30. 2014.
    5. BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ and Joost-Pieter KATOEN. Zero-reachability in probabilistic multi-counter automata. In Thomas Henzinger and Dale Miller. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: ACM. p. nestránkováno, 10 pp. ISBN 978-1-4503-2886-9. doi:10.1145/2603088.2603161. 2014.

    2013

    1. CHATTERJEE, Krishnendu, Andreas GAISER and Jan KŘETÍNSKÝ. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. In Computer Aided Verification - 25th International Conference, CAV 2013. Heidelberg Dordrecht London New York: Springer. p. 559-575. ISBN 978-3-642-39798-1. doi:10.1007/978-3-642-39799-8_37. 2013.
    2. BARNAT, Jiří, Luboš BRIM, Vojtěch HAVEL, Jan HAVLÍČEK, Jan KRIHO, Milan LENČO, Petr ROČKAI, Vladimír ŠTILL and Jiří WEISER. DiVinE 3.0 -- An Explicit-State Model Checker for Multithreaded C & C++ Programs. In Sharygina, Natasha; Veith, Helmut. Computer Aided Verification 2013. Heidelberg: Springer. p. 863-868. ISBN 978-3-642-39798-1. doi:10.1007/978-3-642-39799-8_60. 2013.
    3. BRIM, Luboš, Milan ČEŠKA, Sven DRAŽAN and David ŠAFRÁNEK. Exploring Parameter Space of Stochastic Biochemical Systems Using Quantitative Model Checking. In 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Berlin: Springer Berlin Heidelberg. p. 107-123. ISBN 978-3-642-39798-1. doi:10.1007/978-3-642-39799-8_7. 2013.
    4. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT and Antonín KUČERA. Trading Performance for Stability in Markov Decision Processes. In Proceedings of 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013). London: IEEE Computer Society. p. 331-340. ISBN 978-1-4799-0413-6. doi:10.1109/LICS.2013.39. 2013.
Display details
Displayed: 23/4/2024 11:02