Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Szymon Toruńczyk
2018
- Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Sebastian Siebertz i Szymon Toruńczyk, First-Order Interpretations of Bounded Expansion Classes, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, s. 126:1–126:14.zobacz w PBN
- Michał Pilipczuk, Sebastian Siebertz i Szymon Toruńczyk, Parameterized circuit complexity of model-checking on sparse structures, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 789–798.zobacz w PBN
- Michał Pilipczuk, Sebastian Siebertz i Szymon Toruńczyk, On the number of types in sparse graphs, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 799–808.zobacz w PBN
- Mikołaj Bojańczyk i Szymon Toruńczyk, On computability and tractability for infinite sets, w: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, s. 145–154.zobacz w PBN
2017
- Eryk Kopczyński i Szymon Toruńczyk, LOIS: Syntax and Semantics, w: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, ACM, 2017, s. 586–598.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
- Tomasz Gogacz i Szymon Toruńczyk, Entropy Bounds for Conjunctive Queries with Functional Dependencies, w: 20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 15, s. 15:1–15:17.zobacz w PBN
2016
- Eryk Kopczyński i Szymon Toruńczyk, LOIS: an Application of SMT Solvers, w: Proceedings of the 14th International Workshop on Satisfiability Modulo Theories affiliated with the International Joint Conference on Automated Reasoning, SMT@IJCAR 2016, Coimbra, Portugal, July 1-2, 2016, CEUR-WS.org, 2016, s. 51–60.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
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak i Szymon Toruńczyk, Homomorphism Problems for First-Order Definable Structures, w: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), 2016, r. 14, s. 14:1–14:15.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
- Michał Pilipczuk i Szymon Toruńczyk, On Ultralimits of Sparse Graph Classes, Electronic Journal Of Combinatorics 23 (2) 2016, s. P2.32.zobacz w PBN
- Thomas Colcombet, Denis Kuperberg, Amaldev Manuel i Szymon Toruńczyk, Cost Functions Definable by Min/Max Automata, w: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 29, s. 29:1–29:13.zobacz w PBN
2015
- Bartosz Klin, Eryk Kopczyński, Joanna Ochremiak i Szymon Toruńczyk, Locally Finite Constraint Satisfaction Problems, w: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, IEEE, 2015, s. 475–486.zobacz w PBN
2014
- Bartosz Klin, Sławomir Lasota, Joanna Ochremiak i Szymon Toruńczyk, Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, 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.zobacz w PBN
2013
- Mikołaj Bojańczyk, Bartosz Klin, Sławomir Lasota i Szymon Toruńczyk, Turing machines with atoms, w: Proceedings of LICS 2013, 2013, s. 183–192.zobacz w PBN
- Mikołaj Bojańczyk, Luc Segoufin i Szymon Toruńczyk, Verification of database-driven systems via amalgamation, w: Proceedings of PODS 2013, 2013.zobacz w PBN
2012
- Mikołaj Bojańczyk i Szymon Toruńczyk, Imperative Programming in Sets with Atoms, w: FSTTCS, LIPICS, Dagstuhl 2012.zobacz w PBN
- Szymon Toruńczyk, Languages of Profinite Words and the Limitedness Problem, w: ICALP (2), 2012.zobacz w PBN
- Mikołaj Bojańczyk i Szymon Toruńczyk, Weak MSO+U over infinite trees, w: STACS, 2012.zobacz w PBN
2011
- Luc Segoufin i Szymon Toruńczyk, Automata based verification over linearly ordered data domains, w: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.zobacz w PBN
2010
- Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean Raskin i Szymon Toruńczyk, Energy and Mean-Payoff Games with Imperfect Information, Lecture Notes In Computer Science 6247 2010, s. 260–274.zobacz w PBN
- Szczepan Hummel, Michał Paweł Skrzypczak i Szymon Toruńczyk, On the Topological Complexity of MSO+U and Related Automata Models, w: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, Springer, Brno 2010, s. 429–440.zobacz w PBN
2009
- Mikołaj Bojańczyk i Szymon Toruńczyk, Deterministic Automata and Extensions of Weak MSO, w: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, Leibniz-Zentrum fuer Informatik, Dagstuhl 2009.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
