Paweł Parys
Paweł Parys
Verified email at mimuw.edu.pl
Title
Cited by
Cited by
Year
XPath evaluation in linear time
M Bojańczyk, P Parys
Journal of the ACM (JACM) 58 (4), 17, 2011
522011
XPath evaluation in linear time
M Bojańczyk, P Parys
Journal of the ACM (JACM) 58 (4), 17, 2011
522011
Generalization of binary search: Searching in trees and forest-like partial orders
K Onak, P Parys
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
482006
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
382019
On the significance of the collapse operation
P Parys
2012 27th Annual IEEE Symposium on Logic in Computer Science, 521-530, 2012
382012
The MSO+ U theory of (N,<) is undecidable
M Bojańczyk, P Parys, S Toruńczyk
arXiv preprint arXiv:1502.04578, 2015
292015
The diagonal problem for higher-order recursion schemes is decidable
L Clemente, P Parys, S Salvati, I Walukiewicz
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
232016
Strictness of the collapsible pushdown hierarchy
A Kartzow, P Parys
International Symposium on Mathematical Foundations of Computer Science, 566-577, 2012
232012
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
P Parys
arXiv preprint arXiv:1904.12446, 2019
202019
Collapse operation increases expressive power of deterministic higher order pushdown automata
P Parys
Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 603-614, 2011
192011
XPath evaluation in linear time with polynomial combined complexity
P Parys
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009
182009
Ordered tree-pushdown systems
L Clemente, P Parys, S Salvati, I Walukiewicz
arXiv preprint arXiv:1510.03278, 2015
162015
The (almost) complete guide to tree pattern containment
W Czerwiński, W Martens, P Parys, M Przybylko
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015
162015
Two-way cost automata and cost logics over infinite trees
A Blumensath, T Colcombet, D Kuperberg, P Parys, MV Boom
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
152014
A pumping lemma for pushdown graphs of any level
P Parys
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 54-65, 2012
152012
The complexity of the diagonal problem for recursion schemes
P Parys
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
112018
Recursion schemes and the WMSO+ U logic
P Parys
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
102018
Weak alternating timed automata
P Parys, I Walukiewicz
International Colloquium on Automata, Languages, and Programming, 273-284, 2009
92009
Parity Games: Another View on Lehtinen's Algorithm
P Parys
arXiv preprint arXiv:1910.03919, 2019
82019
Minimization of tree patterns
W CzerwiŃski, W Martens, M Niewerth, P Parys
Journal of the ACM (JACM) 65 (4), 1-46, 2018
82018
The system can't perform the operation now. Try again later.
Articles 1–20