Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Paweł Parys
2019
- Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdziński, Ranko Lazić and Paweł Parys, Universal Trees Grow Inside Separating Automata: Quasi-Polynomial Lower Bounds for Parity Games, in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, SIAM, 2019, p. 2333–2349.see in PBN
2018
- Wojciech Czerwiński, Claire David, Filip Murlak and Paweł Parys, Reasoning About Integrity Constraints for Tree-Structured Data, Theory Of Computing Systems 62 (4) 2018, p. 941–976.see in PBN
- Paweł Parys, Recursion Schemes and the WMSO+U Logic, in: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 53, p. 1–16.see in PBN
- Paweł Parys, Homogeneity Without Loss of Generality, in: 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 27, p. 1–15.see in PBN
- Wojciech Czerwiński, Wim Martens, Matthias Niewerth and Paweł Parys, Minimization of Tree Patterns, Journal Of The Acm 65 (4) 2018, p. 26:1–26:46.see in PBN
- Paweł Parys, The Complexity of the Diagonal Problem for Recursion Schemes, in: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 45, p. 1–14.see in PBN
2017
- Paweł Parys, Intersection Types and Counting, in: Proceedings Eighth Workshop on Intersection Types and Related Systems, ITRS 2016, Porto, Portugal, 26th June 2016, 2017, p. 48–63.see in PBN
- Wojciech Czerwiński, Wim Martens, Matthias Niewerth and Paweł Parys, Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data, Sigmod Record 46 (1) 2017, p. 15–22.see in PBN
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter and Lorenzo ClementeFilip Murlak (ed.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.see in PBN
2016
- Paweł Parys, Weak Containment for Partial Words is coNP-Complete, Information Processing Letters 116 (2) 2016, p. 125–127.see in PBN
- Achim Blumensath, Thomas Colcombet and Paweł Parys, On a Fragment of AMSO and Tiling Systems, in: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 19, p. 19:1–19:14.see in PBN
- Mikołaj Bojańczyk, Paweł Parys and Szymon Toruńczyk, The MSO+U Theory of (N,<) Is Undecidable, in: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 21, p. 21:1–21:8.see in PBN
- Wojciech Czerwiński, Wim Martens, Matthias Niewerth and Paweł Parys, Minimization of Tree Pattern Queries, in: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, ACM, New York 2016, p. 43–54.see in PBN
- Lorenzo Clemente, Paweł Parys, Sylvain Salvati and Igor Walukiewicz, The Diagonal Problem for Higher-Order Recursion Schemes is Decidable, in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, p. 96–105.see in PBN
- Wojciech Czerwiński, Claire David, Filip Murlak and Paweł Parys, Reasoning About Integrity Constraints for Tree-Structured Data, in: 19th International Conference on Database Theory (ICDT 2016), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, r. 20, p. 20:1–20:18.see in PBN
- Paweł Parys and Szymon Toruńczyk, Models of Lambda-Calculus and the Weak MSO Logic, in: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), Schloss Dagstuhl 2016, r. 11, p. 11:1–11:12.see in PBN
- Paweł Parys, A Characterization of Lambda-Terms Transforming Numerals, Journal Of Functional Programming 26 2016, p. e12.see in PBN
2015
- Wojciech Czerwiński, Wim Martens, Paweł Parys and Marcin Przybyłko, The (Almost) Complete Guide to Tree Pattern Containment, in: Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015, ACM, 2015, p. 117–130.see in PBN
- Paweł Parys, Sylvain Salvati, Igor Walukiewicz and Lorenzo Clemente, Ordered Tree-Pushdown Systems, in: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, p. 163–177.see in PBN
2014
- Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Paweł Parys and Michael Vanden Boom, Two-Way Cost Automata and Cost Logics Over Infinite Trees, in: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014, r. 16.see in PBN
- Paweł Parys, How Many Numbers Can a Lambda-Term Contain?, in: Functional and Logic Programming - 12th International Symposium, FLOPS 2014, Kanazawa, Japan, June 4-6, 2014. Proceedings, 2014, p. 302–318.see in PBN
- Paweł Parys, First-Order Logic on CPDA Graphs, in: Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, 2014, p. 300–313.see in PBN
2012
- Paweł Parys, A Pumping Lemma for Pushdown Graphs of Any Level, in: STACS, 2012.see in PBN
- Vince Bárány, Mikołaj Bojańczyk, Diego Figueira and Paweł Parys, Decidable Classes of Documents for XPath, in: FSTTCS, LIPICS, Dagstuhl 2012.see in PBN
- Paweł Parys, Higher-Order Pushdown Systems With Data, in: GandALF, 2012.see in PBN
- Paweł Parys and Igor Walukiewicz, Weak Alternating Timed Automata, Logical Methods In Computer Science 8 (3) 2012.see in PBN
- Paweł Parys, Variants of Collapsible Pushdown Systems, in: CSL, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011, p. 500–515.see in PBN
- Paweł Parys, On the Significance of the Collapse Operation, in: LICS, 2008, p. 521–530.see in PBN
- Alexander Kartzow and Paweł Parys, Strictness of the Collapsible Pushdown Hierarchy, in: MFCS, 2010, p. 566–577.see in PBN
2009
- Paweł Parys, Lower Bound for Evaluation of mu-nu Fixpoint, in: 6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, 12-13 September 2009, Proceedings, 2009.see in PBN
- Paweł Parys and Igor Walukiewicz, Weak Alternating Timed Automata, Lecture Notes In Computer Science 5555 2009, p. 273–284.see in PBN
- Paweł Parys, XPath Evaluation in Linear Time With Polynomial Combined Complexity, in: PODS, ACM, Providence 2009.see in PBN
2006
- Krzysztof Onak and Paweł Parys, Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders, in: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, 2006, p. 379–388.see in PBN
2004
- Wojciech Legierski and Paweł Parys, Planowanie zajęć metodami programowania z ograniczeniami, in: Automatyzacja Procesów Dyskretnych, WNT, Warszawa 2004, p. 125–132.see in PBN
2003
- Wojciech Legierski and Paweł Parys, System for Solving Timetabling Problems, in: Proceedings of the AI-METH 2003 Symposium on Methods of Artificial Intelligence, 2003, p. 76–77.see in PBN
You are not logged in | log in
