Back to the list of the institutes
Publications
Szymon Toruńczyk
Number of publications: 432023
- Pierre Ohlmann, Michał Pilipczuk , Wojciech Przybyszewski , Szymon Toruńczyk , Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
- Jakub Gajarský , Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk , Wojciech Przybyszewski , Sebastian Siebertz, Marek Sokołowski , Szymon Toruńczyk , Flipper Games for Monadically Stable Graph Classes, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
- Szymon Toruńczyk , Flip-width: Cops and Robber on dense graphs, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
- Szymon Toruńczyk , Jan Dreier, Nikolas Mahlmann, Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023, 261 2023. See in PBN
2022
- Michał Pilipczuk , Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk , Alexandre Vigny, Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN
- Édouard Bonnet, Jan Dreier, Jakub Gajarský , Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk , Model Checking on Interpretations of Classes of Bounded Local Cliquewidth, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Jakub Gajarský , Michał Pilipczuk , Szymon Toruńczyk , Stable graphs of bounded twin-width, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Jan Dreier, Jakub Gajarský , Sandra Kiefer, Michał Pilipczuk , Szymon Toruńczyk , Treelike Decompositions for Transductions of Sparse Graphs, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Jakub Gajarský , Michał Pilipczuk , Wojciech Przybyszewski , Szymon Toruńczyk , Twin-Width and Types, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN
- Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk , Twin-width IV: ordered graphs and matrices, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
2021
- Bartosz Klin , Sławomir Lasota , Szymon Toruńczyk , Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages, 24th International Conference on Foundations of Software Science and Computation Structures, Luksemburg, Luxembourg, 27 March 2021 - 1 April 2021. See in PBN
2020
- Szymon Toruńczyk , Aggregate Queries on Sparse Databases, 39th ACM SIGMOD-SIGACT-SIGART Conference on Principles of Database Systems, Portland, the United States of America, 14 June 2020 - 19 June 2020. See in PBN
- Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona De Mendez, Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Jakub Gajarský , First-Order Interpretations of Bounded Expansion Classes, ACM Transactions on Computational Logic, 21 (4) 2020, p. 29:1-29:41. See in PBN
- Thomas Zeume, Szymon Toruńczyk , Register Automata with Extrema Constraints, and an Application to Two-Variable Logic, 35th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
- Grzegorz Fabiański , Michał Skrzypczak , Szymon Toruńczyk , Uniformisations of Regular Relations Over Bi-Infinite Words, Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
2019
- Khadijeh Keshvardoost, Bartosz Klin , Sławomir Lasota , Joanna Ochremiak, Szymon Toruńczyk , Definable isomorphism problem, Logical Methods in Computer Science, 15 (4) 2019, p. 14:1–14:19. See in PBN
- Grzegorz Fabiański , Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Progressive Algorithms for Domination and Independence, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 March 2019 - 16 March 2019, 126 2019, p. 27:1--27:16. See in PBN
2018
- Michał Pilipczuk , Sebastian Siebertz, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Szymon Toruńczyk , Jakub Gajarský , First-Order Interpretations of Bounded Expansion Classes, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July, 2018. See in PBN
- Mikołaj Bojańczyk , Szymon Toruńczyk , On computability and tractability for infinite sets, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, the United Kingdom of Great Britain and Northern Ireland, 9 July 2018 - 12 July 2018. See in PBN
- Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , On the number of types in sparse graphs, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, the United Kingdom of Great Britain and Northern Ireland, 9 July 2018 - 12 July 2018. See in PBN
- Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Parameterized circuit complexity of model-checking on sparse structures, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, the United Kingdom of Great Britain and Northern Ireland, 9 July 2018 - 12 July 2018. See in PBN
2017
- Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. See in PBN
- Tomasz Gogacz , Szymon Toruńczyk , Entropy Bounds for Conjunctive Queries with Functional Dependencies, 20th International Conference on Database Theory, Venice, Italy, 21 March 2017 - 24 March 2017. See in PBN
- Eryk Kopczyński , Szymon Toruńczyk , LOIS: Syntax and Semantics, ACM SIGACT Symposium on Principles of Programming Languages, Paryż, France, 15 January 2017 - 21 January 2017. See in PBN
2016
- Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Toruńczyk , Cost Functions Definable by Min/Max Automata, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orlean, France, 17 February 2016 - 20 February 2016. See in PBN
- Bartosz Klin , Sławomir Lasota , Joanna Ochremiak, Szymon Toruńczyk , Homomorphism Problems for First-Order Definable Structures, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 13 December 2016 - 15 December 2016. See in PBN
- Eryk Kopczyński , Szymon Toruńczyk , LOIS: an Application of SMT Solvers, International Workshop on Satisfiability Modulo Theories affiliated with the International Joint Conference on Automated Reasoning, Coimbra, Portugal, 1 July 2016 - 2 July 2016. See in PBN
- Paweł Parys , Szymon Toruńczyk , Models of Lambda-Calculus and the Weak MSO Logic, 25th EACSL Annual Conference on Computer Science Logic, Marseille, France, 29 August 2016 - 1 September 2016. See in PBN
- Albert Atserias, Szymon Toruńczyk , Non-Homogenizable Classes of Finite Structures, 25th EACSL Annual Conference on Computer Science Logic, Marsylia, France, 29 August 2016 - 1 September 2016. See in PBN
- Michał Pilipczuk , Szymon Toruńczyk , On Ultralimits of Sparse Graph Classes, Electronic Journal of Combinatorics, 23 (2) 2016, p. P2.32. See in PBN
- Mikołaj Bojańczyk , Paweł Parys , Szymon Toruńczyk , The MSO+U Theory of (N,<) Is Undecidable, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orlean, France, 17 February 2016 - 20 February 2016. See in PBN
2015
- Bartosz Klin , Eryk Kopczyński , Joanna Ochremiak, Szymon Toruńczyk , Locally Finite Constraint Satisfaction Problems, 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6 July 2015 - 10 July 2016. See in PBN
2014
- Bartosz Klin , Sławomir Lasota , Joanna Ochremiak, Szymon Toruńczyk , Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity, ACM/IEEE Symposium on Logic in Computer Science, 2014. See in PBN
2013
- Mikołaj Bojańczyk , Bartosz Klin , Sławomir Lasota , Szymon Toruńczyk , Turing machines with atoms, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, the United States of America, 25 June 2013 - 28 June 2013. See in PBN
- Mikołaj Bojańczyk , Luc Segoufin, Szymon Toruńczyk , Verification of database-driven systems via amalgamation, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013. See in PBN
2012
- Mikołaj Bojańczyk , Szymon Toruńczyk , Imperative Programming in Sets with Atoms, 2012. See in PBN
- Szymon Toruńczyk , Languages of Profinite Words and the Limitedness Problem, 2012. See in PBN
- Eryk Kopczyński , Mikołaj Bojańczyk , Szymon Toruńczyk , Ramsey’s theorem for colors from a metric space, Semigroup Forum, 2012. See in PBN
- Mikołaj Bojańczyk , Szymon Toruńczyk , Weak MSO+U over infinite trees, 2012. See in PBN
2011
- Luc Segoufin, Szymon Toruńczyk , Automata based verification over linearly ordered data domains, 2011. See in PBN
2010
- Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean Raskin, Szymon Toruńczyk , Energy and Mean-Payoff Games with Imperfect Information, Lecture Notes in Computer Science, 2010. See in PBN
- Szczepan Hummel, Michał Skrzypczak , Szymon Toruńczyk , On the Topological Complexity of MSO+U and Related Automata Models, Mathematical Foundations of Computer Science 2010, Brno, Czechia, 2010. See in PBN
2009
- Mikołaj Bojańczyk , Szymon Toruńczyk , Deterministic Automata and Extensions of Weak MSO, 2009. See in PBN