Spremljaj
Paweł Parys
Paweł Parys
Preverjeni e-poštni naslov na mimuw.edu.pl
Naslov
Navedeno
Navedeno
Leto
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
642006
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
532019
XPath evaluation in linear time
M Bojańczyk, P Parys
Journal of the ACM (JACM) 58 (4), 17, 2011
502011
XPath evaluation in linear time
M Bojańczyk, P Parys
Journal of the ACM (JACM) 58 (4), 17, 2011
502011
On the significance of the collapse operation
P Parys
2012 27th Annual IEEE Symposium on Logic in Computer Science, 521-530, 2012
382012
Parity games: Zielonka's algorithm in quasi-polynomial time
P Parys
arXiv preprint arXiv:1904.12446, 2019
362019
The diagonal problem for higher-order recursion schemes is decidable
L Clemente, P Parys, S Salvati, I Walukiewicz
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
352016
The MSO+ U theory of (N,<) is undecidable
M Bojańczyk, P Parys, S Toruńczyk
arXiv preprint arXiv:1502.04578, 2015
332015
Strictness of the collapsible pushdown hierarchy
A Kartzow, P Parys
International Symposium on Mathematical Foundations of Computer Science, 566-577, 2012
232012
A recursive approach to solving parity games in quasipolynomial time
K Lehtinen, P Parys, S Schewe, D Wojtczak
Logical Methods in Computer Science 18, 2022
202022
Collapse operation increases expressive power of deterministic higher order pushdown automata
P Parys
28th International Symposium on Theoretical Aspects of Computer Science …, 2011
202011
Ordered tree-pushdown systems
L Clemente, P Parys, S Salvati, I Walukiewicz
arXiv preprint arXiv:1510.03278, 2015
192015
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
192015
XPath evaluation in linear time with polynomial combined complexity
P Parys
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009
192009
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
182014
A pumping lemma for pushdown graphs of any level
P Parys
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
152012
The complexity of the diagonal problem for recursion schemes
P Parys
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
132018
A quasi-polynomial black-box algorithm for fixed point evaluation
A Arnold, D Niwiński, P Parys
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021
112021
Minimization of tree patterns
W CzerwiŃski, W Martens, M Niewerth, P Parys
Journal of the ACM (JACM) 65 (4), 1-46, 2018
112018
Homogeneity without loss of generality
P Parys
3rd International Conference on Formal Structures for Computation and …, 2018
102018
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20