Research outputs
2025
Resolving Nondeterminism by Chance
Paul, S., Purser, D., Schewe, S., Tang, Q., Totzke, P., & Yen, D. D. (2025). Resolving Nondeterminism by Chance. In Leibniz International Proceedings in Informatics Lipics Vol. 348. doi:10.4230/LIPIcs.CONCUR.2025.32
Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata
Li, Y., Paul, S., Schewe, S., & Tang, Q. (2025). Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata. In Unknown Conference (pp. 276-298). Springer Nature Switzerland. doi:10.1007/978-3-031-98679-6_13
2021
Pushable chromatic number of graphs with degree constraints
Bensmail, J., Das, S., Nandi, S., Paul, S., Pierron, T., Sen, S., & Sopena, É. (2021). Pushable chromatic number of graphs with degree constraints. Discrete Mathematics, 344(1), 112151. doi:10.1016/j.disc.2020.112151