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