( en | de | ru )

 

Disambiguation of "Parys, Pawel"

Author of the publication

copydeleteadd this publication to your clipboard
Ordered Tree-Pushdown Systems.

, , , and . FSTTCS, volume 45 of LIPIcs, page 163-177. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Annette Parys

Hubert Parys

Claudia Parys

Sabine Parys

Roman Parys

 

Other publications of authors with the same name

Intersection Types for Unboundedness Problems.. DCM/ITRS, volume 293 of EPTCS, page 7-27. (2018)Efficient Evaluation of Nondeterministic Automata Using Factorization Forests., and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 515-526. Springer, (2010)XPath evaluation in linear time., and . J. ACM, 58 (4): 17:1-17:33 (2011)The Complexity of the Diagonal Problem for Recursion Schemes.. FSTTCS, volume 93 of LIPIcs, page 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Significance of the Collapse Operation.. LICS, page 521-530. IEEE Computer Society, (2012)Models of Lambda-Calculus and the Weak MSO Logic., and . CSL, volume 62 of LIPIcs, page 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Systems of Equations Satisfied in All Commutative Finite Semigroups.. FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 261-272. Springer, (2008)XPath evaluation in linear time., and . PODS, page 241-250. ACM, (2008)First-Order Logic on CPDA Graphs.. CSR, volume 8476 of Lecture Notes in Computer Science, page 300-313. Springer, (2014)Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time.. MFCS, volume 138 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)