Parys, Paweł
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
2019/04/29 by Paweł Parys, Parys, Paweł · 2 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification
- Constrained Adaptive Rejection Sampling
2025/10/02 by Paweł Parys, Sairam Vaidya, Parys, Paweł +5 · 2 voices · 1 citation
#cs.AI #cs.CL #cs.LG
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
2016/05/02 by Lorenzo Clemente, Clemente, Lorenzo, Paweł Parys +5 · 1 citation
Computer Science · #semigroups and automata theory #Formal Methods in Verification #Logic, programming, and type systems
- Parity Games: Another View on Lehtinen's Algorithm
2019/10/09 by Parys, Paweł · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games
2023/04/29 by Paweł Parys, Parys, Paweł, Aleksander Wiącek +1 · 1 citation
Computer Science · #Artificial Intelligence in Games #Complexity and Algorithms in Graphs #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification