Publications
Selected publications
- An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space (Journal article - 2019)
- Omega-Regular Objectives in Model-Free Reinforcement Learning (Conference Paper - 2019)
- Facility Reallocation on the Line (Conference Paper - 2021)
- Verification of Distributed Epistemic Gossip Protocols (Journal article - 2018)
2024
Multi-Agent Reinforcement Learning for Alternating-Time Logic
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2024). Multi-Agent Reinforcement Learning for Alternating-Time Logic. In Frontiers in Artificial Intelligence and Applications. IOS Press. doi:10.3233/faia240676
Decentralized multi-agent cooperation via adaptive partner modeling
Xu, C., Wang, J., Zhu, X., Yue, Y., Zhou, W., Liang, Z., & Wojtczak, D. (2024). Decentralized multi-agent cooperation via adaptive partner modeling. Complex & Intelligent Systems, 10(4), 4989-5004. doi:10.1007/s40747-024-01421-3
Correction: MC-NN: An End-to-End Multi-Channel Neural Network Approach for Predicting Influenza A Virus Hosts and Antigenic Types
Xu, Y., & Wojtczak, D. (n.d.). Correction: MC-NN: An End-to-End Multi-Channel Neural Network Approach for Predicting Influenza A Virus Hosts and Antigenic Types. SN Computer Science, 5(4). doi:10.1007/s42979-024-02802-8
Omega-Regular Decision Processes
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (n.d.). Omega-Regular Decision Processes. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 38 (pp. 21125-21133). Association for the Advancement of Artificial Intelligence (AAAI). doi:10.1609/aaai.v38i19.30105
2023
Omega-Regular Reward Machines
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2023). Omega-Regular Reward Machines. In Frontiers in Artificial Intelligence and Applications. IOS Press. doi:10.3233/faia230368
MC-NN: An End-to-End Multi-Channel Neural Network Approach for Predicting Influenza A Virus Hosts and Antigenic Types
Xu, Y., & Wojtczak, D. (n.d.). MC-NN: An End-to-End Multi-Channel Neural Network Approach for Predicting Influenza A Virus Hosts and Antigenic Types. SN Computer Science, 4(5). doi:10.1007/s42979-023-01839-5
Multi-objective ω-Regular Reinforcement Learning
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2023). Multi-objective ω-Regular Reinforcement Learning. FORMAL ASPECTS OF COMPUTING, 35(2). doi:10.1145/3605950
Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2023). Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning. In Lecture Notes in Computer Science (pp. 527-545). Springer Nature Switzerland. doi:10.1007/978-3-031-30823-9_27
2022
An Impossibility Result in Automata-Theoretic Reinforcement Learning
Hahn, E. M., Trivedi, A., Perez, M., Somenzi, F., Schewe, S., & Wojtczak, D. (2022). An Impossibility Result in Automata-Theoretic Reinforcement Learning. In ATVA22.
Dive into machine learning algorithms for influenza virus host prediction with hemagglutinin sequences
Xu, Y., & Wojtczak, D. (2022). Dive into machine learning algorithms for influenza virus host prediction with hemagglutinin sequences. Biosystems, 220, 104740. doi:10.1016/j.biosystems.2022.104740
Facility Reallocation on the Line
de Keijzer, B., & Wojtczak, D. (2018). Facility Reallocation on the Line. In PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 188-194). Retrieved from https://www.webofscience.com/
Reinforcement Learning with Guarantees That Hold for Ever
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2022). Reinforcement Learning with Guarantees That Hold for Ever. In Proceedings of FMICS’22.
Facility Reallocation on the Line
de Keijzer, B., & Wojtczak, D. (2022). Facility Reallocation on the Line. Algorithmica. doi:10.1007/s00453-022-00993-1
Coordination Games on Weighted Directed Graphs
Apt, K. R., Simon, S., & Wojtczak, D. (n.d.). Coordination Games on Weighted Directed Graphs. Mathematics of Operations Research. doi:10.1287/moor.2021.1159
Predicting Influenza A Viral Host Using PSSM and Word Embeddings
Xu, Y., & Wojtczak, D. (2021). Predicting Influenza A Viral Host Using PSSM and Word Embeddings. In 2021 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY (CIBCB) (pp. 255-264). doi:10.1109/CIBCB49929.2021.9562959
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
Lehtinen, K., Parys, P., Schewe, S., & Wojtczak, D. (n.d.). A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Logical Methods in Computer Science, Volume 18, Issue 1. doi:10.46298/lmcs-18(1:8)2022
Alternating Good-for-MDPs Automata
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2022). Alternating Good-for-MDPs Automata. In Lecture Notes in Computer Science (pp. 303-319). Springer International Publishing. doi:10.1007/978-3-031-19992-9_19
End-to-End Multi-channel Neural Networks for Predicting Influenza a Virus Hosts and Antigenic Types
Xu, Y., & Wojtczak, D. (2022). End-to-End Multi-channel Neural Networks for Predicting Influenza a Virus Hosts and Antigenic Types. In Proceedings of the 14th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (pp. 40-50). SCITEPRESS - Science and Technology Publications. doi:10.5220/0011526300003335
Hidden 1-Counter Markov Models and How to Learn Them
Kurucan, M., Özbaltan, M., Schewe, S., & Wojtczak, D. (2022). Hidden 1-Counter Markov Models and How to Learn Them. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 4857-4863). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2022/673
Propositional Gossip Protocols under Fair Schedulers
Livesey, J., & Wojtczak, D. (2022). Propositional Gossip Protocols under Fair Schedulers. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 391-397). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2022/56
Recursive Reinforcement Learning
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2022). Recursive Reinforcement Learning. In Advances in Neural Information Processing Systems Vol. 35.
2021
Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives
Hahn, E. -M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives. In Lecture Notes in Computer Science Vol. 13047 (pp. 142-159). Springer Nature. doi:10.1007/978-3-030-90870-6
Minimal Number of Calls in Propositional Protocols
Livesey, J., & Wojtczak, D. (2021). Minimal Number of Calls in Propositional Protocols. In P. C. Bell, P. Totzke, & I. Potapov (Eds.), Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings Vol. 13035 (pp. 132-148). Springer. doi:10.1007/978-3-030-89716-1_9
Leveraging Neural Networks in Malaria Control
Livesey, J., & Wojtczak, D. (2021). Leveraging Neural Networks in Malaria Control. In 2021 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB) (pp. 1-6). IEEE. doi:10.1109/cibcb49929.2021.9562789
Model-Free Reinforcement Learning for Branching Markov Decision Processes
Hahn, E. -M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Branching Markov Decision Processes. In Lecture Notes in Computer Science Vol. 12507 (pp. 651-673). Springer Nature. doi:10.1007/978-3-030-81688-9\_30
Model-Free Reinforcement Learning for Branching Markov Decision Processes
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Branching Markov Decision Processes. COMPUTER AIDED VERIFICATION, PT II, CAV 2021, 12760, 651-673. doi:10.1007/978-3-030-81688-9_30
Facility Reallocation on the Line
Keijzer, B. D., & Wojtczak, D. (2021). Facility Reallocation on the Line. Retrieved from http://arxiv.org/abs/2103.12894v1
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
Totzke, P., Schewe, S., & Wojtczak, D. (2021). Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. In Lecture Notes in Computer Science Vol. 12650 (pp. 427-447). Luxembourg: Springer Nature.
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
Mayr, R., Schewe, S., Totzke, P., & Wojtczak, D. (2021). Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 12650, 427-447. doi:10.1007/978-3-030-71995-1_22
Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant
Faraggi, A. E., Percival, B., Schewe, S., & Wojtczak, D. (2021). Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant. PHYSICS LETTERS B, 816. doi:10.1016/j.physletb.2021.136187
Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives. In Unknown Book (Vol. 13047, pp. 142-159). doi:10.1007/978-3-030-90870-6_8
Propositional Gossip Protocols
Livesey, J., & Wojtczak, D. (2021). Propositional Gossip Protocols. In Unknown Conference (pp. 354-370). Springer International Publishing. doi:10.1007/978-3-030-86593-1_25
2020
Model-free reinforcement learning for stochastic parity games
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Model-free reinforcement learning for stochastic parity games. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 171 (pp. 211-2116). doi:10.4230/LIPIcs.CONCUR.2020.21
How to Play in Infinite MDPs (Invited Talk)
Kiefer, S., Mayr, R., Shirmohammadi, M., Totzke, P., & Wojtczak, D. (2020). How to Play in Infinite MDPs (Invited Talk). In A. Czumaj, A. Dawar, & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) Vol. 168 (pp. 3:1-3:18). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.ICALP.2020.3
Reward Shaping for Reinforcement Learning with Omega-Regular Objectives
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Reward Shaping for Reinforcement Learning with Omega-Regular Objectives. Retrieved from http://arxiv.org/abs/2001.05977v1
Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2020) Vol. 12302 (pp. 108-124). doi:10.1007/978-3-030-59152-6_6
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning. In Unknown Conference (pp. 306-323). Springer International Publishing. doi:10.1007/978-3-030-45190-5_17
2019
Open Problems in a Logic of Gossips
Apt, K. R., & Wojtczak, D. (n.d.). Open Problems in a Logic of Gossips. Electronic Proceedings in Theoretical Computer Science, 297, 1-18. doi:10.4204/eptcs.297.1
Recursive stochastic games with positive rewards
Etessami, K., Wojtczak, D., & Yannakakis, M. (2019). Recursive stochastic games with positive rewards. THEORETICAL COMPUTER SCIENCE, 777, 308-328. doi:10.1016/j.tcs.2018.12.018
An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space
Fearnley, J. S., Jain, S., De Keijzer, B., Schewe, S., Stephan, F., & Wojtczak, D. K. (2019). An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space. International Journal on Software Tools for Technology Transfer, 21(3), 325-349. doi:10.1007/s10009-019-00509-3
Improving the complexity of Parys' recursive algorithm
Lehtinen, K., Schewe, S., & Wojtczak, D. (2019). Improving the complexity of Parys' recursive algorithm. Retrieved from http://arxiv.org/abs/1904.11810v4
Limit Reachability for Model-Free Reinforcement Learning of ω-Regular Objectives
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2019). Limit Reachability for Model-Free Reinforcement Learning of ω-Regular Objectives. In PROCEEDINGS OF THE 5TH INTERNATIONAL WORKSHOP ON SYMBOLIC-NUMERIC METHODS FOR REASONING ABOUT CPS AND IOT (SNR 2019) (pp. 16-18). doi:10.1145/3313149.3313369
Omega-Regular Objectives in Model-Free Reinforcement Learning
Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. K. (2019). Omega-Regular Objectives in Model-Free Reinforcement Learning. In Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2019. Lecture Notes in Computer Science Vol. 11427 (pp. 395-412). Prague, Czech Republic. doi:10.1007/978-3-030-17462-0_27
2018
On Strong NP-Completeness of Rational Problems
Wojtczak, D. (2018). On Strong NP-Completeness of Rational Problems. In COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018 Vol. 10846 (pp. 308-320). doi:10.1007/978-3-319-90530-3_26
Verification of Distributed Epistemic Gossip Protocols
Apt, K., & Wojtczak, D. (2018). Verification of Distributed Epistemic Gossip Protocols. Journal of Artificial Intelligence Research, 62, 101-133. doi:10.1613/jair.1.11204
2017
Synchronisation Games on Hypergraphs
Simon, S., & Wojtczak, D. (2017). Synchronisation Games on Hypergraphs. In PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 402-408). Retrieved from https://www.webofscience.com/
MDPs with energy-parity objectives
Mayr, R., Schewe, S., Totzke, P., & Wojtczak, D. (2017). MDPs with energy-parity objectives. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 (pp. 1-12). Reykjavik, Iceland. doi:10.1109/LICS.2017.8005131
Parity Objectives in Countable MDPs
Kiefer, S., Mayr, R., Shirmohammadi, M., & Wojtczak, D. (2017). Parity Objectives in Countable MDPs. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). ACM. doi:10.1109/LICS.2017.8005100
Common Knowledge in a Logic of Gossips
Apt, K. R., & Wojtczak, D. (2017). Common Knowledge in a Logic of Gossips. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, (251), 10-27. doi:10.4204/EPTCS.251.2
An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space
Fearnley, J., Jain, S., Schewe, S., Stephan, F., & Wojtczak, D. (2017). An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. In SPIN'17: PROCEEDINGS OF THE 24TH ACM SIGSOFT INTERNATIONAL SPIN SYMPOSIUM ON MODEL CHECKING OF SOFTWARE (pp. 112-121). doi:10.1145/3092282.3092286
Optimal Control for Multi-Mode Systems with Discrete Costs
Mousa, M. A. A., Schewe, S., & Wojtczak, D. (2017). Optimal Control for Multi-Mode Systems with Discrete Costs. Retrieved from http://arxiv.org/abs/1706.09886v1
On Strong Determinacy of Countable Stochastic Games
Kiefer, S., Mayr, R., Shirmohammadi, M., & Wojtczak, D. (2017). On Strong Determinacy of Countable Stochastic Games. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1-12). Reykjavik, Iceland: IEEE. doi:10.1109/LICS.2017.8005134
An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space.
Fearnley, J., Jain, S., Schewe, S., Stephan, F., & Wojtczak, D. (2017). An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space.. CoRR, abs/1703.01296.
Constrained Pure Nash Equilibria in Polymatrix Games
Simon, S., & Wojtczak, D. (n.d.). Constrained Pure Nash Equilibria in Polymatrix Games. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 31. Association for the Advancement of Artificial Intelligence (AAAI). doi:10.1609/aaai.v31i1.10599
Common Knowledge in a Logic of Gossips
Apt, K., & Wojtczak, D. (2017). Common Knowledge in a Logic of Gossips. In Proc. of TARK (pp. (to appear)). LIPIcs.
Decidability of Fair Termination of Gossip Protocols
Apt, K., & Wojtczak, D. (2017). Decidability of Fair Termination of Gossip Protocols. In Proc. of LPAR (pp. (to appear)). Kalpa Publications.
On the Computational Complexity of Gossip Protocols
Apt, K. R., Kopczynski, E., & Wojtczak, D. (2017). On the Computational Complexity of Gossip Protocols. In PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 765-771). Retrieved from https://www.webofscience.com/
On the Computational Complexity of Gossip Protocols
Apt, K. R., Kopczyński, E., & Wojtczak, D. (2017). On the Computational Complexity of Gossip Protocols. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (pp. 765-771). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2017/106
Optimal Control for Multi-mode Systems with Discrete Costs
Mousa, M. A. A., Schewe, S., & Wojtczak, D. (2017). Optimal Control for Multi-mode Systems with Discrete Costs. In FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2017) Vol. 10419 (pp. 77-96). doi:10.1007/978-3-319-65765-3_5
Synchronisation Games on Hypergraphs
Simon, S., & Wojtczak, D. (2017). Synchronisation Games on Hypergraphs. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (pp. 402-408). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2017/57
2016
Optimal Control for Simple Linear Hybrid Systems
Mousa, M. A. A., Schewe, S., & Wojtczak, D. (2016). Optimal Control for Simple Linear Hybrid Systems. In PROCEEDINGS 23RD INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING - TIME 2016 (pp. 12-20). doi:10.1109/TIME.2016.9
Constrained Pure Nash Equilibria in Polymatrix Games
Simon, S., & Wojtczak, D. (2017). Constrained Pure Nash Equilibria in Polymatrix Games. In THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 691-697). Retrieved from https://www.webofscience.com/
Efficient Local Search in Coordination Games on Graphs
Simon, S., & Wojtczak, D. K. (2016). Efficient Local Search in Coordination Games on Graphs. In 25th International Joint Conference on Artificial Intelligence IJCAI-16.
Coordination Games on Directed Graphs
Apt, K. R., Simon, S., & Wojtczak, D. (2016). Coordination Games on Directed Graphs. In ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE (pp. 67-80). doi:10.4204/EPTCS.215.6
On Decidability of a Logic of Gossips
Apt, K. R., & Wojtczak, D. (2016). On Decidability of a Logic of Gossips. In LOGICS IN ARTIFICIAL INTELLIGENCE, (JELIA 2016) Vol. 10021 (pp. 18-33). doi:10.1007/978-3-319-48758-8_2
2015
On Pure Nash Equilibria in Stochastic Games
Das, A., Krishna, S. N., Manasa, L., Trivedi, A., & Wojtczak, D. (2015). On Pure Nash Equilibria in Stochastic Games. In THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015) Vol. 9076 (pp. 359-371). doi:10.1007/978-3-319-17142-5_31
2014
Making the Best of Limited Memory in Multi-Player Discounted Sum Games
Gupta, A., Schewe, S., & Wojtczak, D. (2015). Making the Best of Limited Memory in Multi-Player Discounted Sum Games. In ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE (pp. 16-30). doi:10.4204/EPTCS.193.2
Automated Analysis of Probabilistic Infinite-state Systems
Wojtczak, D. (n.d.). Automated Analysis of Probabilistic Infinite-state Systems. In Electronic Proceedings in Theoretical Computer Science Vol. 140 (pp. 85-86). Open Publishing Association. doi:10.4204/eptcs.140.6
2013
Multi-objective Discounted Reward Verification in Graphs and MDPs
Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective Discounted Reward Verification in Graphs and MDPs. In Unknown Conference (pp. 228-242). Springer Berlin Heidelberg. doi:10.1007/978-3-642-45221-5_17
Expected Termination Time in BPA Games
Wojtczak, D. (2013). Expected Termination Time in BPA Games. In Unknown Conference (pp. 303-318). Springer International Publishing. doi:10.1007/978-3-319-02444-8_22
Optimal Control for Linear-Rate Multi-mode Systems
Wojtczak, D. (2013). Optimal Control for Linear-Rate Multi-mode Systems. In Unknown Conference (pp. 258-273). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40229-6_18
Optimal Scheduling for Constant-Rate Multi-Mode Systems
Alur, R., Trivedi, A., & Wojtczak, D. (2012). Optimal Scheduling for Constant-Rate Multi-Mode Systems. In HSCC 12: PROCEEDINGS OF THE 15TH ACM INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL (pp. 75-84). Retrieved from https://www.webofscience.com/
2012
Minimizing Expected Termination Time in One-Counter Markov Decision Processes
Brázdil, T., Kučera, A., Novotný, P., & Wojtczak, D. (2012). Minimizing Expected Termination Time in One-Counter Markov Decision Processes. Retrieved from http://arxiv.org/abs/1205.1473v1
Minimizing Expected Termination Time in One-Counter Markov Decision Processes
Brázdil, T., Kučera, A., Novotný, P., & Wojtczak, D. (2012). Minimizing Expected Termination Time in One-Counter Markov Decision Processes. In Lecture Notes in Computer Science (pp. 141-152). Springer Berlin Heidelberg. doi:10.1007/978-3-642-31585-5_16
Minimizing expected termination time in one-counter markov decision processes
Brázdil, T., Kučera, A., Novotný, P., & Wojtczak, D. (2012). Minimizing expected termination time in one-counter markov decision processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 7392 LNCS (pp. 141-152). doi:10.1007/978-3-642-31585-5_16
2011
THE COMPLEXITY OF NASH EQUILIBRIA IN STOCHASTIC MULTIPLAYER GAMES
Ummels, M., & Wojtczak, D. (2011). THE COMPLEXITY OF NASH EQUILIBRIA IN STOCHASTIC MULTIPLAYER GAMES. LOGICAL METHODS IN COMPUTER SCIENCE, 7(3). doi:10.2168/LMCS-7(3:20)2011
Trust Metrics for the SPKI/SDSI Authorisation Framework
Wojtczak, D. (2011). Trust Metrics for the SPKI/SDSI Authorisation Framework. In Unknown Conference (pp. 168-182). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24372-1_13
The Complexity of Nash Equilibria in Limit-Average Games
Ummels, M., & Wojtczak, D. (2011). The Complexity of Nash Equilibria in Limit-Average Games. In CONCUR 2011: CONCURRENCY THEORY Vol. 6901 (pp. 482-+). Retrieved from https://www.webofscience.com/
Trust Metrics for the SPKI/SDSI Authorisation Framework
Wojtczak, D. (2011). Trust Metrics for the SPKI/SDSI Authorisation Framework. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS Vol. 6996 (pp. 168-182). Retrieved from https://www.webofscience.com/
2010
On Probabilistic Parallel Programs with Process Creation and Synchronisation
Kiefer, S., & Wojtczak, D. (2011). On Probabilistic Parallel Programs with Process Creation and Synchronisation. In TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS Vol. 6605 (pp. 296-310). Retrieved from https://www.webofscience.com/
Timed Branching Processes
Trivedi, A., & Wojtczak, D. (2010). Timed Branching Processes. In 2010 Seventh International Conference on the Quantitative Evaluation of Systems (pp. 219-228). IEEE. doi:10.1109/qest.2010.36
Recursive Timed Automata
Trivedi, A., & Wojtczak, D. (2010). Recursive Timed Automata. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS Vol. 6252 (pp. 306-324). Retrieved from https://www.webofscience.com/
Quasi-Birth Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
Etessami, K., Wojtczak, D., & Yannakakis, M. (2010). Quasi-Birth Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. PERFORMANCE EVALUATION, 67(9), 837-857. doi:10.1016/j.peva.2009.12.009
2009
Decision Problems for Nash Equilibria in Stochastic Games
Ummels, M., & Wojtczak, D. (2009). Decision Problems for Nash Equilibria in Stochastic Games. In COMPUTER SCIENCE LOGIC, PROCEEDINGS Vol. 5771 (pp. 515-+). Retrieved from https://www.webofscience.com/
One-Counter Markov Decision Processes
Brazdil, T., Brozek, V., Etessami, K., Kucera, A., & Wojtczak, D. (2010). One-Counter Markov Decision Processes. In PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS Vol. 135 (pp. 863-+). Retrieved from https://www.webofscience.com/
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
Ummels, M., & Wojtczak, D. (2009). The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. Retrieved from http://dx.doi.org/10.1007/978-3-642-02930-1_25
2008
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
Etessami, K., Wojtczak, D., & Yannakakis, M. (2008). Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. In 2008 Fifth International Conference on Quantitative Evaluation of Systems (pp. 243-253). IEEE. doi:10.1109/qest.2008.35
Recursive stochastic games with positive rewards
Etessami, K., Wojtczak, D., & Yannakakis, M. (2008). Recursive stochastic games with positive rewards. In AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS Vol. 5125 (pp. 711-+). Retrieved from https://www.webofscience.com/
2007
PReMo: An analyzer for probabilistic recursive models
Wojtczak, D., & Etessami, K. (2007). PReMo: An analyzer for probabilistic recursive models. In TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS Vol. 4424 (pp. 66-+). Retrieved from https://www.webofscience.com/