XPath evaluation in linear time M Bojańczyk, P Parys Journal of the ACM (JACM) 58 (4), 17, 2011 | 50 | 2011 |

XPath evaluation in linear time M Bojańczyk, P Parys Journal of the ACM (JACM) 58 (4), 17, 2011 | 50 | 2011 |

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 | 38 | 2006 |

On the significance of the collapse operation P Parys 2012 27th Annual IEEE Symposium on Logic in Computer Science, 521-530, 2012 | 29 | 2012 |

The MSO+ U theory of (N,<) is undecidable M Bojańczyk, P Parys, S Toruńczyk arXiv preprint arXiv:1502.04578, 2015 | 21 | 2015 |

Strictness of the collapsible pushdown hierarchy A Kartzow, P Parys International Symposium on Mathematical Foundations of Computer Science, 566-577, 2012 | 20 | 2012 |

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 | 20 | 2011 |

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games W Czerwiński, L Daviaud, N Fijalkow, M Jurdzińskit, R Lazić, P Parys Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 17 | 2019 |

XPath evaluation in linear time with polynomial combined complexity. P Parys PODS, 55-64, 2009 | 17 | 2009 |

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 | 15 | 2016 |

Ordered tree-pushdown systems L Clemente, P Parys, S Salvati, I Walukiewicz arXiv preprint arXiv:1510.03278, 2015 | 14 | 2015 |

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 | 14 | 2012 |

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 | 13 | 2014 |

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 | 11 | 2015 |

Weak alternating timed automata P Parys, I Walukiewicz International Colloquium on Automata, Languages, and Programming, 273-284, 2009 | 8 | 2009 |

The complexity of the diagonal problem for recursion schemes P Parys 37th IARCS Annual Conference on Foundations of Software Technology and …, 2018 | 6 | 2018 |

Minimization of tree pattern queries W Czerwinski, W Martens, M Niewerth, P Parys Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 6 | 2016 |

Decidable classes of documents for XPath V Bárány, M Bojańczyk, D Figueira, P Parys | 6 | 2012 |

Optimizing tree patterns for querying graph-and tree-structured data W Czerwinski, W Martens, M Niewerth, P Parys ACM SIGMOD Record 46 (1), 15-22, 2017 | 5 | 2017 |

Intersection types and counting P Parys arXiv preprint arXiv:1701.05303, 2017 | 5 | 2017 |