Back to the list of the institutes
Publications
Conference: IEEE Symposium on Logic in Computer Science
Number of publications: 312023
- Wojciech Przybyszewski , Distal Combinatorial Tools for Graphs of Bounded Twin-Width, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 June 2023 - 29 June 2023. See in PBN
- Nikhil Balaji, Lorenzo Clemente , Klara Nosan, Mahsa Shirmohammadi, James Worrell, Multiplicity Problems on Algebraic Series and Context-Free Grammars, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 June 2023 - 29 June 2023. See in PBN
- Arka Ghosh , Piotr Hofman , Sławomir Lasota , Orbit-finite linear programming, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 June 2023 - 29 June 2023. See in PBN
- Damian Niwiński , Paweł Parys , Michał Skrzypczak , The Probabilistic Rabin Tree Theorem*, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 June 2023 - 29 June 2023. See in PBN
2022
- Wojciech Czerwiński , Łukasz Orlikowski, Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 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
- Arka Ghosh , Piotr Hofman , Sławomir Lasota , Solvability of orbit-finite systems of linear equations, 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
- Wojciech Czerwiński , Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus Whiteland, The boundedness and zero isolation problems for weighted automata over nonnegative rationals, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Mikolaj Bojanczyk, Mikołaj Bojańczyk , Transducers of polynomial growth, 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
2021
- Mikołaj Bojańczyk , Bartosz Klin , Joshua Moerman, Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 29 June 2021 - 2 July 2021. See in PBN
- Marta Juzepczuk, Mohnish Pattathurajan, Piotr Hofman , Sławomir Lasota , Parikh’s theorem for infinite alphabets, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 29 June 2021 - 2 July 2021. See in PBN
- Balazs F. Mezei, Marcin Wrochna , Stanislav Zivny, PTAS for Sparse General-Valued CSPs, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 29 June 2021 - 2 July 2021. See in PBN
2020
- Georg Zetzsche, Wojciech Czerwiński , An Approach to Regular Separability in Vector Addition Systems, 35th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
- Stefan Göller, Paweł Parys , Bisimulation Finiteness of Pushdown Systems Is Elementary, Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
- Georg Zetzsche, Mikołaj Bojańczyk , Rafał Stefański , Edon Kelmendi, Extensions of ω-Regular Languages, Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
- Amina Doumane, Mikołaj Bojańczyk , First-order tree-to-tree functions, Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. 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
- Mikołaj Bojańczyk , Edon Kelmendi, Michał Skrzypczak , MSO+∇ is undecidable, Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, 24 July 2019 - 27 July 2019. See in PBN
2018
- Mikołaj Bojańczyk , Martin Grohe, Michał Pilipczuk , Definable decompositions for graphs of bounded linear cliquewidth, 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
- 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
- Piotr Hofman , Jerome Leroux, Patrick Totzke, Linear combinations of unordered data vectors, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
- Stephan Kreutzer, Michał Pilipczuk , Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz, Jan van den Heuvel, Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
- Wojciech Czerwiński , Sławomir Lasota , Regular separability of one counter automata, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
- Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki, Timed pushdown automata and branching vector addition systems, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
2016
- Leszek Kołodziejczyk , Henryk Michalewski , How unprovable is Rabin's decidability theorem?, LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Nowy Jork, the United States of America, 5 July 2016 - 8 July 2016. See in PBN
2013
- Alessandro Facchini, Filip Murlak , Michał Skrzypczak , Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata, Twenty-Eighth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE, New Orleans, LA, the United States of America, 25 June 2013 - 28 June 2013. See in PBN